/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 02:41:08,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 02:41:08,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 02:41:08,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 02:41:08,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 02:41:08,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 02:41:08,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 02:41:08,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 02:41:08,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 02:41:08,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 02:41:08,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 02:41:08,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 02:41:08,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 02:41:08,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 02:41:08,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 02:41:08,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 02:41:08,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 02:41:08,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 02:41:08,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 02:41:08,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 02:41:08,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 02:41:08,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 02:41:08,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 02:41:08,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 02:41:08,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 02:41:08,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 02:41:08,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 02:41:08,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 02:41:08,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 02:41:08,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 02:41:08,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 02:41:08,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 02:41:08,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 02:41:08,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 02:41:08,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 02:41:08,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 02:41:08,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 02:41:08,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 02:41:08,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 02:41:08,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 02:41:08,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 02:41:08,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 02:41:08,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 02:41:08,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 02:41:08,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 02:41:08,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 02:41:08,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 02:41:08,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 02:41:08,533 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 02:41:08,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 02:41:08,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 02:41:08,534 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 02:41:08,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 02:41:08,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 02:41:08,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 02:41:08,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 02:41:08,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 02:41:08,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:41:08,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 02:41:08,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 02:41:08,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 02:41:08,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 02:41:08,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 02:41:08,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 02:41:08,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 02:41:08,541 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 02:41:08,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 02:41:08,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 02:41:08,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 02:41:08,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 02:41:08,794 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 02:41:08,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-01-19 02:41:08,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a6a35eb/b458becf52634763a1c788b4f5c464c3/FLAG1ab90e950 [2022-01-19 02:41:09,262 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 02:41:09,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-01-19 02:41:09,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a6a35eb/b458becf52634763a1c788b4f5c464c3/FLAG1ab90e950 [2022-01-19 02:41:09,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a6a35eb/b458becf52634763a1c788b4f5c464c3 [2022-01-19 02:41:09,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 02:41:09,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 02:41:09,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 02:41:09,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 02:41:09,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 02:41:09,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fde86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09, skipping insertion in model container [2022-01-19 02:41:09,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 02:41:09,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 02:41:09,518 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-three-array-max.wvr.c[2823,2836] [2022-01-19 02:41:09,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:41:09,546 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 02:41:09,569 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-three-array-max.wvr.c[2823,2836] [2022-01-19 02:41:09,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:41:09,584 INFO L208 MainTranslator]: Completed translation [2022-01-19 02:41:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09 WrapperNode [2022-01-19 02:41:09,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 02:41:09,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 02:41:09,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 02:41:09,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 02:41:09,591 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:41:09" (1/1) ... [2022-01-19 02:41:09,603 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:41:09" (1/1) ... [2022-01-19 02:41:09,631 INFO L137 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 232 [2022-01-19 02:41:09,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 02:41:09,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 02:41:09,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 02:41:09,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 02:41:09,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 02:41:09,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 02:41:09,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 02:41:09,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 02:41:09,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (1/1) ... [2022-01-19 02:41:09,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:41:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:09,694 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 02:41:09,700 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 02:41:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 02:41:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 02:41:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 02:41:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 02:41:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 02:41:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 02:41:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 02:41:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 02:41:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 02:41:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 02:41:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 02:41:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 02:41:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 02:41:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 02:41:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 02:41:09,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 02:41:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 02:41:09,729 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 02:41:09,807 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 02:41:09,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 02:41:10,191 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 02:41:10,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 02:41:10,269 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 02:41:10,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:41:10 BoogieIcfgContainer [2022-01-19 02:41:10,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 02:41:10,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 02:41:10,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 02:41:10,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 02:41:10,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:41:09" (1/3) ... [2022-01-19 02:41:10,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20da6d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:41:10, skipping insertion in model container [2022-01-19 02:41:10,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:41:09" (2/3) ... [2022-01-19 02:41:10,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20da6d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:41:10, skipping insertion in model container [2022-01-19 02:41:10,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:41:10" (3/3) ... [2022-01-19 02:41:10,278 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-01-19 02:41:10,282 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 02:41:10,283 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 02:41:10,283 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 02:41:10,328 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,328 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,328 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,329 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,329 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,329 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,330 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,330 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,332 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,333 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,333 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,335 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,335 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,335 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,335 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,335 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,336 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,337 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,338 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,339 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,339 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,339 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,347 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,348 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,348 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,348 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,348 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,350 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,350 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,350 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,350 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,350 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,351 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,351 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,351 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,351 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,353 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,353 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,360 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,361 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,362 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:41:10,365 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 02:41:10,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 02:41:10,411 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 02:41:10,412 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 02:41:10,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 02:41:10,544 INFO L129 PetriNetUnfolder]: 27/312 cut-off events. [2022-01-19 02:41:10,544 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 02:41:10,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 312 events. 27/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 205 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 244. Up to 3 conditions per place. [2022-01-19 02:41:10,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 02:41:10,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 301 transitions, 620 flow [2022-01-19 02:41:10,624 INFO L129 PetriNetUnfolder]: 27/300 cut-off events. [2022-01-19 02:41:10,624 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 02:41:10,625 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:10,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:10,627 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 02:41:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1810646857, now seen corresponding path program 1 times [2022-01-19 02:41:10,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:10,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157401168] [2022-01-19 02:41:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:10,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:10,941 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 02:41:10,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:10,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157401168] [2022-01-19 02:41:10,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157401168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:41:10,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:41:10,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 02:41:10,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062922061] [2022-01-19 02:41:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:10,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 02:41:10,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 02:41:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 02:41:10,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 315 [2022-01-19 02:41:10,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 301 transitions, 620 flow. Second operand has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 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 02:41:10,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:10,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 315 [2022-01-19 02:41:10,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:11,080 INFO L129 PetriNetUnfolder]: 22/329 cut-off events. [2022-01-19 02:41:11,080 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-01-19 02:41:11,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 329 events. 22/329 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 383 event pairs, 7 based on Foata normal form. 36/338 useless extension candidates. Maximal degree in co-relation 233. Up to 28 conditions per place. [2022-01-19 02:41:11,085 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 8 selfloop transitions, 0 changer transitions 12/283 dead transitions. [2022-01-19 02:41:11,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 283 transitions, 600 flow [2022-01-19 02:41:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 02:41:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 02:41:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 602 transitions. [2022-01-19 02:41:11,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-01-19 02:41:11,113 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 602 transitions. [2022-01-19 02:41:11,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 602 transitions. [2022-01-19 02:41:11,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:11,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 602 transitions. [2022-01-19 02:41:11,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 301.0) internal successors, (602), 2 states have internal predecessors, (602), 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 02:41:11,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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 02:41:11,140 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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 02:41:11,142 INFO L186 Difference]: Start difference. First operand has 284 places, 301 transitions, 620 flow. Second operand 2 states and 602 transitions. [2022-01-19 02:41:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 283 transitions, 600 flow [2022-01-19 02:41:11,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 283 transitions, 588 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 02:41:11,157 INFO L242 Difference]: Finished difference. Result has 279 places, 271 transitions, 548 flow [2022-01-19 02:41:11,159 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=548, PETRI_PLACES=279, PETRI_TRANSITIONS=271} [2022-01-19 02:41:11,164 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -5 predicate places. [2022-01-19 02:41:11,164 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 271 transitions, 548 flow [2022-01-19 02:41:11,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 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 02:41:11,165 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:11,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:11,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 02:41:11,166 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 02:41:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 759378185, now seen corresponding path program 1 times [2022-01-19 02:41:11,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:11,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805181876] [2022-01-19 02:41:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:11,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:11,557 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 02:41:11,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:11,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805181876] [2022-01-19 02:41:11,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805181876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:41:11,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:41:11,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:41:11,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173339705] [2022-01-19 02:41:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:11,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:41:11,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:41:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:41:11,569 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 315 [2022-01-19 02:41:11,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 271 transitions, 548 flow. Second operand has 8 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 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 02:41:11,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:11,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 315 [2022-01-19 02:41:11,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:11,858 INFO L129 PetriNetUnfolder]: 202/783 cut-off events. [2022-01-19 02:41:11,858 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 02:41:11,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 783 events. 202/783 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3236 event pairs, 103 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1154. Up to 333 conditions per place. [2022-01-19 02:41:11,868 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 91 selfloop transitions, 15 changer transitions 0/283 dead transitions. [2022-01-19 02:41:11,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 283 transitions, 784 flow [2022-01-19 02:41:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 02:41:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 02:41:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1629 transitions. [2022-01-19 02:41:11,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2022-01-19 02:41:11,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1629 transitions. [2022-01-19 02:41:11,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1629 transitions. [2022-01-19 02:41:11,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:11,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1629 transitions. [2022-01-19 02:41:11,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 203.625) internal successors, (1629), 8 states have internal predecessors, (1629), 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 02:41:11,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 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 02:41:11,886 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 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 02:41:11,886 INFO L186 Difference]: Start difference. First operand has 279 places, 271 transitions, 548 flow. Second operand 8 states and 1629 transitions. [2022-01-19 02:41:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 283 transitions, 784 flow [2022-01-19 02:41:11,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 283 transitions, 784 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 02:41:11,896 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 602 flow [2022-01-19 02:41:11,896 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=602, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-01-19 02:41:11,897 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -9 predicate places. [2022-01-19 02:41:11,897 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 602 flow [2022-01-19 02:41:11,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 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 02:41:11,898 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:11,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:11,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 02:41:11,899 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 02:41:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1657129582, now seen corresponding path program 1 times [2022-01-19 02:41:11,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:11,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874374795] [2022-01-19 02:41:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:11,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 02:41:12,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:12,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874374795] [2022-01-19 02:41:12,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874374795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:41:12,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:41:12,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-19 02:41:12,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450987569] [2022-01-19 02:41:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:12,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-19 02:41:12,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-19 02:41:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-01-19 02:41:12,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 315 [2022-01-19 02:41:12,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 602 flow. Second operand has 21 states, 21 states have (on average 174.85714285714286) internal successors, (3672), 21 states have internal predecessors, (3672), 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 02:41:12,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:12,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 315 [2022-01-19 02:41:12,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:13,835 INFO L129 PetriNetUnfolder]: 765/2564 cut-off events. [2022-01-19 02:41:13,835 INFO L130 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2022-01-19 02:41:13,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 2564 events. 765/2564 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 18228 event pairs, 101 based on Foata normal form. 2/2208 useless extension candidates. Maximal degree in co-relation 3686. Up to 282 conditions per place. [2022-01-19 02:41:13,860 INFO L132 encePairwiseOnDemand]: 285/315 looper letters, 146 selfloop transitions, 31 changer transitions 20/357 dead transitions. [2022-01-19 02:41:13,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 357 transitions, 1173 flow [2022-01-19 02:41:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 02:41:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 02:41:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5638 transitions. [2022-01-19 02:41:13,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5593253968253968 [2022-01-19 02:41:13,873 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5638 transitions. [2022-01-19 02:41:13,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5638 transitions. [2022-01-19 02:41:13,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:13,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5638 transitions. [2022-01-19 02:41:13,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 176.1875) internal successors, (5638), 32 states have internal predecessors, (5638), 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 02:41:13,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 315.0) internal successors, (10395), 33 states have internal predecessors, (10395), 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 02:41:13,914 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 315.0) internal successors, (10395), 33 states have internal predecessors, (10395), 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 02:41:13,915 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 602 flow. Second operand 32 states and 5638 transitions. [2022-01-19 02:41:13,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 357 transitions, 1173 flow [2022-01-19 02:41:13,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 357 transitions, 1149 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 02:41:13,923 INFO L242 Difference]: Finished difference. Result has 307 places, 285 transitions, 703 flow [2022-01-19 02:41:13,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=703, PETRI_PLACES=307, PETRI_TRANSITIONS=285} [2022-01-19 02:41:13,926 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 02:41:13,926 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 285 transitions, 703 flow [2022-01-19 02:41:13,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 174.85714285714286) internal successors, (3672), 21 states have internal predecessors, (3672), 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 02:41:13,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:13,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:13,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 02:41:13,928 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 02:41:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1010837465, now seen corresponding path program 1 times [2022-01-19 02:41:13,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:13,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133551821] [2022-01-19 02:41:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:13,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:14,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133551821] [2022-01-19 02:41:14,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133551821] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688227171] [2022-01-19 02:41:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:14,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:14,104 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 02:41:14,106 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 02:41:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:14,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 02:41:14,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:14,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:41:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:15,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688227171] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:41:15,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:41:15,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 02:41:15,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284832046] [2022-01-19 02:41:15,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:41:15,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 02:41:15,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 02:41:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 02:41:15,434 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 02:41:15,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 285 transitions, 703 flow. Second operand has 19 states, 19 states have (on average 240.26315789473685) internal successors, (4565), 19 states have internal predecessors, (4565), 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 02:41:15,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:15,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 02:41:15,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:16,460 INFO L129 PetriNetUnfolder]: 1489/3795 cut-off events. [2022-01-19 02:41:16,461 INFO L130 PetriNetUnfolder]: For 445/539 co-relation queries the response was YES. [2022-01-19 02:41:16,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 3795 events. 1489/3795 cut-off events. For 445/539 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 24274 event pairs, 585 based on Foata normal form. 6/2910 useless extension candidates. Maximal degree in co-relation 6384. Up to 1092 conditions per place. [2022-01-19 02:41:16,493 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 133 selfloop transitions, 54 changer transitions 0/407 dead transitions. [2022-01-19 02:41:16,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 407 transitions, 1375 flow [2022-01-19 02:41:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 02:41:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 02:41:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4907 transitions. [2022-01-19 02:41:16,504 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7788888888888889 [2022-01-19 02:41:16,504 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4907 transitions. [2022-01-19 02:41:16,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4907 transitions. [2022-01-19 02:41:16,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:16,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4907 transitions. [2022-01-19 02:41:16,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 245.35) internal successors, (4907), 20 states have internal predecessors, (4907), 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 02:41:16,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 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 02:41:16,527 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 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 02:41:16,528 INFO L186 Difference]: Start difference. First operand has 307 places, 285 transitions, 703 flow. Second operand 20 states and 4907 transitions. [2022-01-19 02:41:16,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 407 transitions, 1375 flow [2022-01-19 02:41:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 407 transitions, 1331 flow, removed 5 selfloop flow, removed 21 redundant places. [2022-01-19 02:41:16,538 INFO L242 Difference]: Finished difference. Result has 307 places, 322 transitions, 974 flow [2022-01-19 02:41:16,538 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=974, PETRI_PLACES=307, PETRI_TRANSITIONS=322} [2022-01-19 02:41:16,539 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 02:41:16,539 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 322 transitions, 974 flow [2022-01-19 02:41:16,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 240.26315789473685) internal successors, (4565), 19 states have internal predecessors, (4565), 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 02:41:16,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:16,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:16,568 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 02:41:16,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:16,756 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 02:41:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash -378664297, now seen corresponding path program 1 times [2022-01-19 02:41:16,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:16,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498505979] [2022-01-19 02:41:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:16,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:16,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498505979] [2022-01-19 02:41:16,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498505979] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274426862] [2022-01-19 02:41:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:16,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:16,873 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 02:41:16,882 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 02:41:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:17,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 02:41:17,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:17,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:41:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 02:41:18,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274426862] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:41:18,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:41:18,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 02:41:18,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037711345] [2022-01-19 02:41:18,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:41:18,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 02:41:18,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 02:41:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 02:41:18,111 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 02:41:18,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 322 transitions, 974 flow. Second operand has 19 states, 19 states have (on average 237.31578947368422) internal successors, (4509), 19 states have internal predecessors, (4509), 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 02:41:18,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:18,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 02:41:18,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:19,231 INFO L129 PetriNetUnfolder]: 1561/3928 cut-off events. [2022-01-19 02:41:19,231 INFO L130 PetriNetUnfolder]: For 1471/1592 co-relation queries the response was YES. [2022-01-19 02:41:19,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7701 conditions, 3928 events. 1561/3928 cut-off events. For 1471/1592 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 26013 event pairs, 773 based on Foata normal form. 35/3331 useless extension candidates. Maximal degree in co-relation 7683. Up to 1568 conditions per place. [2022-01-19 02:41:19,273 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 72 selfloop transitions, 30 changer transitions 89/408 dead transitions. [2022-01-19 02:41:19,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 408 transitions, 1642 flow [2022-01-19 02:41:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 02:41:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 02:41:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4847 transitions. [2022-01-19 02:41:19,283 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7693650793650794 [2022-01-19 02:41:19,284 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4847 transitions. [2022-01-19 02:41:19,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4847 transitions. [2022-01-19 02:41:19,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:19,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4847 transitions. [2022-01-19 02:41:19,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 242.35) internal successors, (4847), 20 states have internal predecessors, (4847), 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 02:41:19,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 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 02:41:19,313 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 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 02:41:19,314 INFO L186 Difference]: Start difference. First operand has 307 places, 322 transitions, 974 flow. Second operand 20 states and 4847 transitions. [2022-01-19 02:41:19,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 408 transitions, 1642 flow [2022-01-19 02:41:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 408 transitions, 1605 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-01-19 02:41:19,331 INFO L242 Difference]: Finished difference. Result has 327 places, 297 transitions, 872 flow [2022-01-19 02:41:19,332 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=872, PETRI_PLACES=327, PETRI_TRANSITIONS=297} [2022-01-19 02:41:19,334 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 43 predicate places. [2022-01-19 02:41:19,334 INFO L470 AbstractCegarLoop]: Abstraction has has 327 places, 297 transitions, 872 flow [2022-01-19 02:41:19,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 237.31578947368422) internal successors, (4509), 19 states have internal predecessors, (4509), 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 02:41:19,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:19,336 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:19,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 02:41:19,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:19,555 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 02:41:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 257040978, now seen corresponding path program 2 times [2022-01-19 02:41:19,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:19,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992627813] [2022-01-19 02:41:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:19,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 02:41:19,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992627813] [2022-01-19 02:41:19,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992627813] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332505621] [2022-01-19 02:41:19,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:41:19,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:19,716 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 02:41:19,717 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 02:41:19,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:41:19,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:41:19,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 02:41:19,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 02:41:20,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:41:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 02:41:20,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332505621] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:20,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:41:20,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 02:41:20,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737629742] [2022-01-19 02:41:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:20,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 02:41:20,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:20,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 02:41:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 02:41:20,818 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2022-01-19 02:41:20,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 297 transitions, 872 flow. Second operand has 9 states, 9 states have (on average 243.55555555555554) internal successors, (2192), 9 states have internal predecessors, (2192), 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 02:41:20,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:20,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2022-01-19 02:41:20,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:21,238 INFO L129 PetriNetUnfolder]: 826/1975 cut-off events. [2022-01-19 02:41:21,238 INFO L130 PetriNetUnfolder]: For 1591/1642 co-relation queries the response was YES. [2022-01-19 02:41:21,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4626 conditions, 1975 events. 826/1975 cut-off events. For 1591/1642 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11644 event pairs, 220 based on Foata normal form. 2/1706 useless extension candidates. Maximal degree in co-relation 4604. Up to 701 conditions per place. [2022-01-19 02:41:21,257 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 78 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 02:41:21,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1100 flow [2022-01-19 02:41:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:41:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:41:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2444 transitions. [2022-01-19 02:41:21,262 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7758730158730158 [2022-01-19 02:41:21,262 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2444 transitions. [2022-01-19 02:41:21,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2444 transitions. [2022-01-19 02:41:21,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:21,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2444 transitions. [2022-01-19 02:41:21,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 244.4) internal successors, (2444), 10 states have internal predecessors, (2444), 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 02:41:21,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:21,273 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:21,273 INFO L186 Difference]: Start difference. First operand has 327 places, 297 transitions, 872 flow. Second operand 10 states and 2444 transitions. [2022-01-19 02:41:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1100 flow [2022-01-19 02:41:21,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 309 transitions, 1019 flow, removed 17 selfloop flow, removed 18 redundant places. [2022-01-19 02:41:21,282 INFO L242 Difference]: Finished difference. Result has 303 places, 299 transitions, 840 flow [2022-01-19 02:41:21,283 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-01-19 02:41:21,283 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 19 predicate places. [2022-01-19 02:41:21,283 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 840 flow [2022-01-19 02:41:21,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 243.55555555555554) internal successors, (2192), 9 states have internal predecessors, (2192), 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 02:41:21,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:21,285 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:21,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 02:41:21,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:21,508 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 02:41:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1172583244, now seen corresponding path program 1 times [2022-01-19 02:41:21,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636244696] [2022-01-19 02:41:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:21,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:21,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636244696] [2022-01-19 02:41:21,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636244696] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:21,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890735154] [2022-01-19 02:41:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:21,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:21,619 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 02:41:21,620 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 02:41:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:21,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 02:41:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:22,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:41:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:22,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890735154] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:22,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:41:22,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 02:41:22,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822437169] [2022-01-19 02:41:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:22,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 02:41:22,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 02:41:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 02:41:22,853 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 02:41:22,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 239.77777777777777) internal successors, (2158), 9 states have internal predecessors, (2158), 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 02:41:22,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:22,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 02:41:22,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:23,448 INFO L129 PetriNetUnfolder]: 1352/3191 cut-off events. [2022-01-19 02:41:23,448 INFO L130 PetriNetUnfolder]: For 1676/2026 co-relation queries the response was YES. [2022-01-19 02:41:23,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 3191 events. 1352/3191 cut-off events. For 1676/2026 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 21732 event pairs, 315 based on Foata normal form. 379/3354 useless extension candidates. Maximal degree in co-relation 6959. Up to 1235 conditions per place. [2022-01-19 02:41:23,478 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 85 selfloop transitions, 10 changer transitions 0/312 dead transitions. [2022-01-19 02:41:23,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 312 transitions, 1080 flow [2022-01-19 02:41:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:41:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:41:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2409 transitions. [2022-01-19 02:41:23,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7647619047619048 [2022-01-19 02:41:23,484 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2409 transitions. [2022-01-19 02:41:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2409 transitions. [2022-01-19 02:41:23,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:23,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2409 transitions. [2022-01-19 02:41:23,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 240.9) internal successors, (2409), 10 states have internal predecessors, (2409), 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 02:41:23,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:23,494 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:23,494 INFO L186 Difference]: Start difference. First operand has 303 places, 299 transitions, 840 flow. Second operand 10 states and 2409 transitions. [2022-01-19 02:41:23,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 312 transitions, 1080 flow [2022-01-19 02:41:23,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 312 transitions, 1069 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-01-19 02:41:23,507 INFO L242 Difference]: Finished difference. Result has 310 places, 300 transitions, 863 flow [2022-01-19 02:41:23,507 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=863, PETRI_PLACES=310, PETRI_TRANSITIONS=300} [2022-01-19 02:41:23,508 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 26 predicate places. [2022-01-19 02:41:23,508 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 300 transitions, 863 flow [2022-01-19 02:41:23,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 239.77777777777777) internal successors, (2158), 9 states have internal predecessors, (2158), 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 02:41:23,509 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:23,509 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:23,536 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 02:41:23,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:23,723 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 02:41:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2099191554, now seen corresponding path program 1 times [2022-01-19 02:41:23,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376146172] [2022-01-19 02:41:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:23,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:23,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376146172] [2022-01-19 02:41:23,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376146172] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327912716] [2022-01-19 02:41:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:23,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:23,860 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 02:41:23,863 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 02:41:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:23,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 02:41:23,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:24,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:41:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 02:41:24,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327912716] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:24,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:41:24,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 02:41:24,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090314610] [2022-01-19 02:41:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:41:24,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 02:41:24,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:41:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 02:41:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 02:41:24,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 02:41:24,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 300 transitions, 863 flow. Second operand has 9 states, 9 states have (on average 242.66666666666666) internal successors, (2184), 9 states have internal predecessors, (2184), 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 02:41:24,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:41:24,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 02:41:24,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:41:25,343 INFO L129 PetriNetUnfolder]: 778/1843 cut-off events. [2022-01-19 02:41:25,343 INFO L130 PetriNetUnfolder]: For 1532/1946 co-relation queries the response was YES. [2022-01-19 02:41:25,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 1843 events. 778/1843 cut-off events. For 1532/1946 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10240 event pairs, 159 based on Foata normal form. 439/2097 useless extension candidates. Maximal degree in co-relation 4115. Up to 756 conditions per place. [2022-01-19 02:41:25,361 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 81 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 02:41:25,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1077 flow [2022-01-19 02:41:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:41:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:41:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2435 transitions. [2022-01-19 02:41:25,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.773015873015873 [2022-01-19 02:41:25,368 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2435 transitions. [2022-01-19 02:41:25,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2435 transitions. [2022-01-19 02:41:25,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:41:25,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2435 transitions. [2022-01-19 02:41:25,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 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 02:41:25,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:25,376 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 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 02:41:25,376 INFO L186 Difference]: Start difference. First operand has 310 places, 300 transitions, 863 flow. Second operand 10 states and 2435 transitions. [2022-01-19 02:41:25,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1077 flow [2022-01-19 02:41:25,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 309 transitions, 1060 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 02:41:25,385 INFO L242 Difference]: Finished difference. Result has 312 places, 299 transitions, 871 flow [2022-01-19 02:41:25,385 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=871, PETRI_PLACES=312, PETRI_TRANSITIONS=299} [2022-01-19 02:41:25,386 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 28 predicate places. [2022-01-19 02:41:25,386 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 299 transitions, 871 flow [2022-01-19 02:41:25,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 242.66666666666666) internal successors, (2184), 9 states have internal predecessors, (2184), 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 02:41:25,387 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:41:25,387 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:25,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 02:41:25,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:25,601 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:41:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:41:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -817599591, now seen corresponding path program 1 times [2022-01-19 02:41:25,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:41:25,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556208581] [2022-01-19 02:41:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:25,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:41:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 02:41:27,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:41:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556208581] [2022-01-19 02:41:27,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556208581] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:41:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431280090] [2022-01-19 02:41:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:41:27,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:41:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:41:27,080 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 02:41:27,081 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 02:41:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:41:27,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-19 02:41:27,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:41:27,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:41:27,621 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 29 treesize of output 25 [2022-01-19 02:41:29,068 INFO L353 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2022-01-19 02:41:29,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2022-01-19 02:41:45,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:41:45,586 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 164 treesize of output 129 [2022-01-19 02:41:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 02:41:46,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:42:02,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:42:02,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 116 [2022-01-19 02:42:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 02:42:03,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431280090] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:42:03,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:42:03,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 32, 29] total 90 [2022-01-19 02:42:03,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540069980] [2022-01-19 02:42:03,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:42:03,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-19 02:42:03,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:42:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-19 02:42:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=7586, Unknown=11, NotChecked=0, Total=8010 [2022-01-19 02:42:03,171 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 315 [2022-01-19 02:42:03,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 299 transitions, 871 flow. Second operand has 90 states, 90 states have (on average 110.07777777777778) internal successors, (9907), 90 states have internal predecessors, (9907), 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 02:42:03,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:42:03,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 315 [2022-01-19 02:42:03,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:42:29,718 INFO L129 PetriNetUnfolder]: 36729/57747 cut-off events. [2022-01-19 02:42:29,718 INFO L130 PetriNetUnfolder]: For 43536/43536 co-relation queries the response was YES. [2022-01-19 02:42:30,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143128 conditions, 57747 events. 36729/57747 cut-off events. For 43536/43536 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 455318 event pairs, 2937 based on Foata normal form. 1/53760 useless extension candidates. Maximal degree in co-relation 143108. Up to 8985 conditions per place. [2022-01-19 02:42:30,306 INFO L132 encePairwiseOnDemand]: 226/315 looper letters, 885 selfloop transitions, 349 changer transitions 20/1347 dead transitions. [2022-01-19 02:42:30,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1347 transitions, 6881 flow [2022-01-19 02:42:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-01-19 02:42:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2022-01-19 02:42:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 12428 transitions. [2022-01-19 02:42:30,326 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3722072476789458 [2022-01-19 02:42:30,326 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 12428 transitions. [2022-01-19 02:42:30,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 12428 transitions. [2022-01-19 02:42:30,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:42:30,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 12428 transitions. [2022-01-19 02:42:30,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 117.24528301886792) internal successors, (12428), 106 states have internal predecessors, (12428), 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 02:42:30,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 315.0) internal successors, (33705), 107 states have internal predecessors, (33705), 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 02:42:30,397 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 315.0) internal successors, (33705), 107 states have internal predecessors, (33705), 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 02:42:30,398 INFO L186 Difference]: Start difference. First operand has 312 places, 299 transitions, 871 flow. Second operand 106 states and 12428 transitions. [2022-01-19 02:42:30,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1347 transitions, 6881 flow [2022-01-19 02:42:31,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1347 transitions, 6815 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 02:42:31,204 INFO L242 Difference]: Finished difference. Result has 458 places, 611 transitions, 3215 flow [2022-01-19 02:42:31,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=3215, PETRI_PLACES=458, PETRI_TRANSITIONS=611} [2022-01-19 02:42:31,205 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 174 predicate places. [2022-01-19 02:42:31,205 INFO L470 AbstractCegarLoop]: Abstraction has has 458 places, 611 transitions, 3215 flow [2022-01-19 02:42:31,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 110.07777777777778) internal successors, (9907), 90 states have internal predecessors, (9907), 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 02:42:31,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:42:31,207 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:42:31,234 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 02:42:31,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:42:31,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:42:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:42:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1130145813, now seen corresponding path program 2 times [2022-01-19 02:42:31,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:42:31,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138510741] [2022-01-19 02:42:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:42:31,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:42:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:42:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 02:42:33,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:42:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138510741] [2022-01-19 02:42:33,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138510741] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:42:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270812649] [2022-01-19 02:42:33,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:42:33,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:42:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:42:33,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 02:42:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 02:42:33,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:42:33,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:42:33,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-19 02:42:33,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:42:35,189 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:42:35,189 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 29 treesize of output 25 [2022-01-19 02:42:37,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:42:37,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:42:37,062 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 02:42:37,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-01-19 02:42:37,304 INFO L353 Elim1Store]: treesize reduction 48, result has 48.4 percent of original size [2022-01-19 02:42:37,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2022-01-19 02:43:06,783 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:43:06,783 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 159 treesize of output 125 [2022-01-19 02:43:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 02:43:07,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:43:08,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int)) (or (and (forall ((~C~0.offset Int) (~C~0.base Int)) (<= (select (store (select |c_#memory_int| ~C~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~C~0.offset) v_ArrVal_476) (+ ~C~0.offset 4)) (+ c_~maxa~0 c_~maxb~0))) (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0))) (< (let ((.cse0 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)))) v_ArrVal_476))) is different from false [2022-01-19 02:43:08,344 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0)))) is different from false [2022-01-19 02:43:08,377 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~maxb~0 |c_thread1Thread1of1ForFork2_#t~mem4|) (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0))))) is different from false [2022-01-19 02:43:08,388 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0)))) (<= c_~maxb~0 (select (select |c_#memory_int| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)))) is different from false [2022-01-19 02:43:08,410 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0)))) (<= c_~maxb~0 (select (select |c_#memory_int| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (<= c_~maxa~0 |c_thread1Thread1of1ForFork2_#t~mem2|)) is different from false [2022-01-19 02:43:08,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:43:08,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 183 [2022-01-19 02:43:08,469 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:43:08,469 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 80 treesize of output 77 [2022-01-19 02:43:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 2 not checked. [2022-01-19 02:43:11,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270812649] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:43:11,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:43:11,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 46, 42] total 118 [2022-01-19 02:43:11,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604522362] [2022-01-19 02:43:11,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:43:11,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-01-19 02:43:11,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:43:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-01-19 02:43:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=12132, Unknown=5, NotChecked=1130, Total=13806 [2022-01-19 02:43:11,515 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 315 [2022-01-19 02:43:11,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 611 transitions, 3215 flow. Second operand has 118 states, 118 states have (on average 103.78813559322033) internal successors, (12247), 118 states have internal predecessors, (12247), 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 02:43:11,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:43:11,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 315 [2022-01-19 02:43:11,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:44:04,978 INFO L129 PetriNetUnfolder]: 59079/92626 cut-off events. [2022-01-19 02:44:04,978 INFO L130 PetriNetUnfolder]: For 512721/512950 co-relation queries the response was YES. [2022-01-19 02:44:06,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350079 conditions, 92626 events. 59079/92626 cut-off events. For 512721/512950 co-relation queries the response was YES. Maximal size of possible extension queue 2830. Compared 771361 event pairs, 5812 based on Foata normal form. 19/88440 useless extension candidates. Maximal degree in co-relation 350010. Up to 14722 conditions per place. [2022-01-19 02:44:06,884 INFO L132 encePairwiseOnDemand]: 224/315 looper letters, 925 selfloop transitions, 516 changer transitions 20/1550 dead transitions. [2022-01-19 02:44:06,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 1550 transitions, 12504 flow [2022-01-19 02:44:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-19 02:44:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-01-19 02:44:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 11140 transitions. [2022-01-19 02:44:06,899 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3467164643635232 [2022-01-19 02:44:06,899 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 11140 transitions. [2022-01-19 02:44:06,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 11140 transitions. [2022-01-19 02:44:06,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:44:06,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 11140 transitions. [2022-01-19 02:44:06,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 109.2156862745098) internal successors, (11140), 102 states have internal predecessors, (11140), 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 02:44:06,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 315.0) internal successors, (32445), 103 states have internal predecessors, (32445), 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 02:44:06,945 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 315.0) internal successors, (32445), 103 states have internal predecessors, (32445), 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 02:44:06,945 INFO L186 Difference]: Start difference. First operand has 458 places, 611 transitions, 3215 flow. Second operand 102 states and 11140 transitions. [2022-01-19 02:44:06,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 1550 transitions, 12504 flow [2022-01-19 02:44:16,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 1550 transitions, 12200 flow, removed 50 selfloop flow, removed 35 redundant places. [2022-01-19 02:44:16,111 INFO L242 Difference]: Finished difference. Result has 556 places, 895 transitions, 7203 flow [2022-01-19 02:44:16,111 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=7203, PETRI_PLACES=556, PETRI_TRANSITIONS=895} [2022-01-19 02:44:16,112 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 272 predicate places. [2022-01-19 02:44:16,112 INFO L470 AbstractCegarLoop]: Abstraction has has 556 places, 895 transitions, 7203 flow [2022-01-19 02:44:16,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 103.78813559322033) internal successors, (12247), 118 states have internal predecessors, (12247), 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 02:44:16,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:44:16,114 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:16,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 02:44:16,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:44:16,340 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:44:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:44:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 546647699, now seen corresponding path program 3 times [2022-01-19 02:44:16,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:44:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348397004] [2022-01-19 02:44:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:44:16,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:44:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:44:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 02:44:18,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:44:18,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348397004] [2022-01-19 02:44:18,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348397004] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:44:18,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892646994] [2022-01-19 02:44:18,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 02:44:18,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:44:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:44:18,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 02:44:18,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 02:44:18,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 02:44:18,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:44:18,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 112 conjunts are in the unsatisfiable core [2022-01-19 02:44:18,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:44:18,593 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 02:44:18,879 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 02:44:18,880 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 02:44:19,418 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 02:44:19,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 02:44:20,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-19 02:44:20,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-01-19 02:44:23,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 34 [2022-01-19 02:44:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 02:44:23,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:44:24,323 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:44:24,324 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 128 treesize of output 142 [2022-01-19 02:44:24,998 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 36 treesize of output 32 [2022-01-19 02:44:26,693 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:44:26,694 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 25 treesize of output 29 [2022-01-19 02:44:26,841 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:44:26,841 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 67 treesize of output 93 [2022-01-19 02:44:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:44:27,823 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 29 treesize of output 23 [2022-01-19 02:44:28,382 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:44:28,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 291 treesize of output 387 [2022-01-19 02:44:59,465 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:44:59,465 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 68 treesize of output 59 [2022-01-19 02:45:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 02:45:01,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892646994] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:45:01,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:45:01,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 48, 48] total 137 [2022-01-19 02:45:01,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813788179] [2022-01-19 02:45:01,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:45:01,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2022-01-19 02:45:01,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:45:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2022-01-19 02:45:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=18021, Unknown=0, NotChecked=0, Total=18632 [2022-01-19 02:45:01,225 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 315 [2022-01-19 02:45:01,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 895 transitions, 7203 flow. Second operand has 137 states, 137 states have (on average 97.34306569343066) internal successors, (13336), 137 states have internal predecessors, (13336), 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 02:45:01,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:45:01,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 315 [2022-01-19 02:45:01,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:47:17,979 INFO L129 PetriNetUnfolder]: 141149/217087 cut-off events. [2022-01-19 02:47:17,979 INFO L130 PetriNetUnfolder]: For 2228742/2229759 co-relation queries the response was YES. [2022-01-19 02:47:22,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1045792 conditions, 217087 events. 141149/217087 cut-off events. For 2228742/2229759 co-relation queries the response was YES. Maximal size of possible extension queue 5625. Compared 1952765 event pairs, 4718 based on Foata normal form. 195/210260 useless extension candidates. Maximal degree in co-relation 1045689. Up to 34072 conditions per place. [2022-01-19 02:47:23,674 INFO L132 encePairwiseOnDemand]: 197/315 looper letters, 2183 selfloop transitions, 1794 changer transitions 181/4242 dead transitions. [2022-01-19 02:47:23,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 4242 transitions, 44421 flow [2022-01-19 02:47:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2022-01-19 02:47:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2022-01-19 02:47:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 33368 transitions. [2022-01-19 02:47:23,714 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.32493913720907586 [2022-01-19 02:47:23,714 INFO L72 ComplementDD]: Start complementDD. Operand 326 states and 33368 transitions. [2022-01-19 02:47:23,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 33368 transitions. [2022-01-19 02:47:23,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:47:23,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 326 states and 33368 transitions. [2022-01-19 02:47:23,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 327 states, 326 states have (on average 102.3558282208589) internal successors, (33368), 326 states have internal predecessors, (33368), 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 02:47:23,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 327 states, 327 states have (on average 315.0) internal successors, (103005), 327 states have internal predecessors, (103005), 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 02:47:23,866 INFO L81 ComplementDD]: Finished complementDD. Result has 327 states, 327 states have (on average 315.0) internal successors, (103005), 327 states have internal predecessors, (103005), 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 02:47:23,867 INFO L186 Difference]: Start difference. First operand has 556 places, 895 transitions, 7203 flow. Second operand 326 states and 33368 transitions. [2022-01-19 02:47:23,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 4242 transitions, 44421 flow [2022-01-19 02:48:57,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 4242 transitions, 43794 flow, removed 207 selfloop flow, removed 52 redundant places. [2022-01-19 02:48:57,272 INFO L242 Difference]: Finished difference. Result has 959 places, 2302 transitions, 27654 flow [2022-01-19 02:48:57,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=6854, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=326, PETRI_FLOW=27654, PETRI_PLACES=959, PETRI_TRANSITIONS=2302} [2022-01-19 02:48:57,273 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 675 predicate places. [2022-01-19 02:48:57,273 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 2302 transitions, 27654 flow [2022-01-19 02:48:57,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 137 states have (on average 97.34306569343066) internal successors, (13336), 137 states have internal predecessors, (13336), 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 02:48:57,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:48:57,275 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:48:57,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 02:48:57,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 02:48:57,476 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:48:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:48:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 248834347, now seen corresponding path program 4 times [2022-01-19 02:48:57,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:48:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745559184] [2022-01-19 02:48:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:48:57,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:48:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:49:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 02:49:01,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:49:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745559184] [2022-01-19 02:49:01,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745559184] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:49:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114001273] [2022-01-19 02:49:01,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 02:49:01,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:49:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:49:01,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 02:49:01,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 02:49:01,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 02:49:01,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:49:01,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 135 conjunts are in the unsatisfiable core [2022-01-19 02:49:01,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:49:01,542 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 02:49:01,608 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 02:49:01,608 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 02:49:01,694 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-19 02:49:01,694 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 22 [2022-01-19 02:49:02,417 INFO L353 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-01-19 02:49:02,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 45 [2022-01-19 02:49:03,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-19 02:49:04,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:04,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:04,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:04,178 INFO L353 Elim1Store]: treesize reduction 42, result has 19.2 percent of original size [2022-01-19 02:49:04,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 45 [2022-01-19 02:49:04,782 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 02:49:05,319 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 13 treesize of output 9 [2022-01-19 02:49:07,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:07,219 INFO L353 Elim1Store]: treesize reduction 32, result has 22.0 percent of original size [2022-01-19 02:49:07,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 27 [2022-01-19 02:49:07,642 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 6 treesize of output 5 [2022-01-19 02:49:07,940 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 6 treesize of output 5 [2022-01-19 02:49:13,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:13,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2022-01-19 02:49:14,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:14,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2022-01-19 02:49:14,729 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 02:49:14,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2022-01-19 02:49:15,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:15,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:49:15,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2022-01-19 02:49:23,625 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 02:49:23,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 42 [2022-01-19 02:49:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 02:49:23,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:49:24,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4))) (let ((.cse1 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse1) (<= (select (select .cse0 c_~C~0.base) (+ c_~C~0.offset 4)) .cse1))) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)))))) is different from false [2022-01-19 02:49:25,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse1 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ .cse2 ~C~0.offset) v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (let ((.cse0 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse0) (<= (select (select .cse1 c_~C~0.base) (+ ~C~0.offset 4)) .cse0))) (<= c_~maxa~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset 4))) (<= c_~maxb~0 (select (select .cse1 c_~B~0.base) (+ 4 c_~B~0.offset))) (< (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse2 c_~B~0.offset))) v_ArrVal_625))))) is different from false [2022-01-19 02:49:25,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse4 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset)) (.cse0 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) .cse1)) (< (+ (select (select |c_#memory_int| c_~A~0.base) .cse1) (select (select |c_#memory_int| c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) .cse2)) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (<= (select (select .cse0 c_~C~0.base) .cse4) .cse3))))))) is different from false [2022-01-19 02:49:26,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse4 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ 4 c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2)) v_ArrVal_625) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (<= (select (select .cse4 c_~C~0.base) .cse5) .cse3))) (<= c_~maxa~0 (select (select .cse4 c_~A~0.base) .cse2)) (<= c_~maxb~0 (select (select .cse4 c_~B~0.base) .cse1)))))) is different from false [2022-01-19 02:49:28,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))))))) is different from false [2022-01-19 02:49:29,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= |c_ULTIMATE.start_main_#t~ret21#1| .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))))))) is different from false [2022-01-19 02:49:30,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= |c_ULTIMATE.start_plus_#res#1| .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:30,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_~b#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:35,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_#in~b#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:36,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_#in~b#1| |c_ULTIMATE.start_plus_#in~a#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:37,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse1 (+ ~C~0.offset 4))) (let ((.cse5 (+ 4 c_~B~0.offset)) (.cse0 (store (store .cse3 c_~C~0.base (store (select .cse3 c_~C~0.base) .cse1 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ c_~A~0.offset 4))) (or (let ((.cse2 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse0 c_~C~0.base) .cse1) .cse2) (<= (+ |c_ULTIMATE.start_main_#t~mem19#1| |c_ULTIMATE.start_main_#t~mem20#1|) .cse2))) (< (+ (select (select .cse3 c_~A~0.base) .cse4) (select (select .cse3 c_~B~0.base) .cse5)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) .cse5)) (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) .cse4)))))) is different from false [2022-01-19 02:49:38,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_main_#t~mem19#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:38,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) .cse5))))))) is different from false [2022-01-19 02:49:38,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse7 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse7 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse2 (+ 4 c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem18#1| c_~maxa~0)) (.cse5 (+ c_~maxa~0 (select (select .cse3 c_~B~0.base) .cse2) 1))) (and (let ((.cse4 (select (select .cse3 c_~C~0.base) .cse7))) (or (<= .cse4 .cse5) (<= .cse4 .cse6))) (let ((.cse8 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) (or (<= .cse8 .cse6) (<= .cse8 .cse5))))))))) is different from false [2022-01-19 02:49:38,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse8 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse7 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse8 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 (select (select .cse7 c_~B~0.base) .cse2) 1)) (.cse4 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (and (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (or (<= .cse3 c_~maxa~0) (<= (+ .cse3 .cse4) .cse5))) (let ((.cse6 (select (select .cse7 c_~C~0.base) .cse8))) (or (<= .cse6 .cse5) (<= .cse6 (+ .cse4 c_~maxa~0)))))) (<= c_~maxa~0 (select (select .cse7 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 02:49:39,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_625 Int)) (or (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)) (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)))) v_ArrVal_625) (and (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) |c_ULTIMATE.start_main_#t~mem17#1|) (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int))) (let ((.cse5 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623))) (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_625))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (.cse4 (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse2 (select (select .cse5 c_~B~0.base) (+ 4 c_~B~0.offset)))) (or (<= .cse1 (+ |c_ULTIMATE.start_main_#t~mem17#1| .cse2 1)) (<= .cse3 (+ .cse4 1)) (<= .cse1 (+ .cse4 2 .cse2))))))) (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int))) (let ((.cse12 (+ ~C~0.offset 4))) (let ((.cse11 (store (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623))) (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) .cse12 v_ArrVal_625))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (let ((.cse8 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse7 (select (select .cse11 c_~C~0.base) .cse12)) (.cse10 (select (select .cse11 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse9 (select (select .cse11 c_~B~0.base) (+ 4 c_~B~0.offset)))) (or (<= .cse7 (+ |c_ULTIMATE.start_main_#t~mem17#1| .cse8)) (<= .cse7 (+ |c_ULTIMATE.start_main_#t~mem17#1| .cse9 1)) (<= .cse7 (+ .cse10 .cse8 1)) (<= .cse7 (+ .cse10 2 .cse9)))))))))) is different from false [2022-01-19 02:49:39,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse9 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse8 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse9 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (let ((.cse4 (select (select .cse8 c_~A~0.base) .cse1)) (.cse5 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse8 c_~C~0.base) .cse9)) (.cse7 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select .cse8 c_~B~0.base) .cse2))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (+ .cse4 .cse5 1)) (<= .cse3 (+ .cse4 2 .cse6)) (<= .cse3 (+ .cse7 .cse5)) (<= .cse3 (+ .cse7 .cse6 1))))))) is different from false [2022-01-19 02:49:39,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse9 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse8 (store (store .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse9 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse9)) (.cse7 (select (select .cse8 c_~A~0.base) .cse1)) (.cse5 (select (select .cse8 c_~B~0.base) .cse2))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (+ .cse4 .cse5 1)) (<= .cse3 (+ .cse4 .cse6)) (<= .cse3 (+ .cse7 .cse6 1)) (<= .cse3 (+ .cse7 .cse5 2))))))) is different from false [2022-01-19 02:49:39,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse9 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse8 (store (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse9 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse9)) (.cse7 (select (select .cse8 c_~A~0.base) .cse1)) (.cse5 (select (select .cse8 c_~B~0.base) .cse2))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (+ .cse4 .cse5 1)) (<= .cse3 (+ .cse4 .cse6)) (<= .cse3 (+ .cse7 .cse6 1)) (<= .cse3 (+ .cse7 .cse5 2))))))) is different from false [2022-01-19 02:49:39,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse9 (+ ~C~0.offset 4))) (let ((.cse5 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4)) (.cse8 (store (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9)) (.cse6 (select (select .cse8 c_~A~0.base) .cse4)) (.cse7 (select (select .cse8 c_~B~0.base) .cse5))) (or (<= .cse0 (+ .cse1 .cse2)) (< (+ (select (select .cse3 c_~A~0.base) .cse4) (select (select .cse3 c_~B~0.base) .cse5)) v_ArrVal_625) (<= .cse0 (+ .cse6 .cse2 1)) (<= .cse0 (+ .cse1 .cse7 1)) (<= .cse0 (+ .cse6 2 .cse7))))))) is different from false [2022-01-19 02:49:40,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_621))) (let ((.cse3 (store (store .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse9 (+ ~C~0.offset 4))) (let ((.cse4 (+ 4 c_~B~0.offset)) (.cse5 (+ c_~A~0.offset 4)) (.cse8 (store (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (let ((.cse6 (select (select .cse10 c_~A~0.base) c_~A~0.offset)) (.cse2 (select (select .cse10 c_~B~0.base) c_~B~0.offset)) (.cse0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9)) (.cse1 (select (select .cse8 c_~A~0.base) .cse5)) (.cse7 (select (select .cse8 c_~B~0.base) .cse4))) (or (<= .cse0 (+ .cse1 1 .cse2)) (< (+ (select (select .cse3 c_~B~0.base) .cse4) (select (select .cse3 c_~A~0.base) .cse5)) v_ArrVal_625) (<= .cse0 (+ .cse6 .cse7 1)) (<= .cse0 (+ .cse6 .cse2)) (<= .cse0 (+ .cse1 2 .cse7)))))))) is different from false [2022-01-19 02:49:40,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base| v_ArrVal_621))) (let ((.cse5 (store (store .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse10 (+ ~C~0.offset 4))) (let ((.cse7 (+ 4 c_~B~0.offset)) (.cse8 (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse10 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse6 (+ c_~A~0.offset 4))) (let ((.cse3 (select (select .cse8 c_~A~0.base) .cse6)) (.cse2 (select (select .cse9 c_~B~0.base) c_~B~0.offset)) (.cse0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse10)) (.cse1 (select (select .cse9 c_~A~0.base) c_~A~0.offset)) (.cse4 (select (select .cse8 c_~B~0.base) .cse7))) (or (<= .cse0 (+ .cse1 .cse2)) (<= .cse0 (+ 2 .cse3 .cse4)) (<= .cse0 (+ .cse3 .cse2 1)) (< (+ (select (select .cse5 c_~A~0.base) .cse6) (select (select .cse5 c_~B~0.base) .cse7)) v_ArrVal_625) (<= .cse0 (+ .cse1 .cse4 1)))))))) is different from false [2022-01-19 02:49:48,237 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:49:48,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 625 treesize of output 460 [2022-01-19 02:50:19,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:50:19,212 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 713 treesize of output 461 [2022-01-19 02:50:19,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 02:50:19,397 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-19 02:50:19,401 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 2813978 treesize of output 2802314 [2022-01-19 02:50:24,844 WARN L228 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 2611 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:50:24,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:50:24,999 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 2904245 treesize of output 2809537 [2022-01-19 02:50:30,399 WARN L228 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 2649 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:50:30,512 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:50:30,514 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 3214261 treesize of output 2974657 [2022-01-19 02:50:36,814 WARN L228 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 2654 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:50:36,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 02:50:36,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3073034 treesize of output 3041290 [2022-01-19 02:50:43,400 WARN L228 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 2656 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:50:43,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 02:50:43,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 02:50:43,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:50:43,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3041290 treesize of output 2963506 [2022-01-19 02:50:50,077 WARN L228 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 2670 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:50:50,198 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:50:50,200 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 2961557 treesize of output 2251321 [2022-01-19 02:50:56,768 WARN L228 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 2679 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:51:27,941 WARN L228 SmtUtils]: Spent 24.96s on a formula simplification. DAG size of input: 2228 DAG size of output: 2228 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:51:49,335 WARN L228 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 2039 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:53:29,628 WARN L228 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 2033 DAG size of output: 2033 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 02:54:02,286 WARN L228 SmtUtils]: Spent 24.58s on a formula simplification. DAG size of input: 2031 DAG size of output: 2031 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-01-19 02:54:11,433 WARN L244 SmtUtils]: Removed 1 from assertion stack [2022-01-19 02:54:11,434 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 02:54:11,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 02:54:11,473 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 02:54:11,473 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 02:54:11,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:54:11,635 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-01-19 02:54:11,637 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 02:54:11,637 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 02:54:11,637 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 02:54:11,640 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 02:54:11,641 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 02:54:11,641 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 02:54:11,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 02:54:11 BasicIcfg [2022-01-19 02:54:11,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 02:54:11,644 INFO L158 Benchmark]: Toolchain (without parser) took 782353.78ms. Allocated memory was 369.1MB in the beginning and 14.8GB in the end (delta: 14.4GB). Free memory was 313.2MB in the beginning and 7.8GB in the end (delta: -7.4GB). Peak memory consumption was 13.3GB. Max. memory is 16.0GB. [2022-01-19 02:54:11,645 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 369.1MB. Free memory was 330.4MB in the beginning and 330.2MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 02:54:11,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.90ms. Allocated memory was 369.1MB in the beginning and 539.0MB in the end (delta: 169.9MB). Free memory was 312.9MB in the beginning and 507.9MB in the end (delta: -195.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.0GB. [2022-01-19 02:54:11,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.40ms. Allocated memory is still 539.0MB. Free memory was 507.9MB in the beginning and 505.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 02:54:11,648 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 539.0MB. Free memory was 505.8MB in the beginning and 503.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 02:54:11,649 INFO L158 Benchmark]: RCFGBuilder took 609.06ms. Allocated memory is still 539.0MB. Free memory was 503.7MB in the beginning and 476.3MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2022-01-19 02:54:11,649 INFO L158 Benchmark]: TraceAbstraction took 781371.21ms. Allocated memory was 539.0MB in the beginning and 14.8GB in the end (delta: 14.3GB). Free memory was 475.8MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 13.3GB. Max. memory is 16.0GB. [2022-01-19 02:54:11,651 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.15ms. Allocated memory is still 369.1MB. Free memory was 330.4MB in the beginning and 330.2MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 289.90ms. Allocated memory was 369.1MB in the beginning and 539.0MB in the end (delta: 169.9MB). Free memory was 312.9MB in the beginning and 507.9MB in the end (delta: -195.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.40ms. Allocated memory is still 539.0MB. Free memory was 507.9MB in the beginning and 505.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 539.0MB. Free memory was 505.8MB in the beginning and 503.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 609.06ms. Allocated memory is still 539.0MB. Free memory was 503.7MB in the beginning and 476.3MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 781371.21ms. Allocated memory was 539.0MB in the beginning and 14.8GB in the end (delta: 14.3GB). Free memory was 475.8MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 13.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 334 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 781.2s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 334.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23691 SdHoareTripleChecker+Valid, 20.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23691 mSDsluCounter, 40368 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20009 IncrementalHoareTripleChecker+Unchecked, 44464 mSDsCounter, 1298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42214 IncrementalHoareTripleChecker+Invalid, 63521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1298 mSolverCounterUnsat, 1128 mSDtfsCounter, 42214 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5185 GetRequests, 4090 SyntacticMatches, 53 SemanticMatches, 1042 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 91029 ImplicationChecksByTransitivity, 146.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27654occurred in iteration=11, InterpolantAutomatonStates: 646, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 128.3s InterpolantComputationTime, 4978 NumberOfCodeBlocks, 4957 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7104 ConstructedInterpolants, 117 QuantifiedInterpolants, 49988 SizeOfPredicates, 224 NumberOfNonLiveVariables, 4525 ConjunctsInSsa, 328 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 443/555 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown