./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:24:55,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:24:55,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:24:55,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:24:55,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:24:55,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:24:55,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:24:55,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:24:55,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:24:55,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:24:55,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:24:55,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:24:55,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:24:55,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:24:55,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:24:55,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:24:55,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:24:55,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:24:55,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:24:55,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:24:55,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:24:55,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:24:55,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:24:55,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:24:55,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:24:55,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:24:55,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:24:55,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:24:55,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:24:55,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:24:55,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:24:55,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:24:55,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:24:55,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:24:55,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:24:55,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:24:55,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:24:55,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:24:55,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:24:55,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:24:55,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:24:55,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:24:55,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:24:55,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:24:55,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:24:55,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:24:55,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:24:55,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:24:55,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:24:55,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:24:55,783 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:24:55,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:24:55,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:24:55,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:24:55,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:24:55,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:24:55,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:24:55,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:24:55,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:24:55,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:24:55,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:24:55,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:24:55,787 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2022-12-13 20:24:55,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:24:55,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:24:55,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:24:55,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:24:55,980 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:24:55,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-12-13 20:24:58,652 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:24:58,852 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:24:58,852 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-12-13 20:24:58,866 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/data/94545f282/c4c2532d88b642afab2898415dd34317/FLAG239b17f8f [2022-12-13 20:24:58,876 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/data/94545f282/c4c2532d88b642afab2898415dd34317 [2022-12-13 20:24:58,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:24:58,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:24:58,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:24:58,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:24:58,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:24:58,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:24:58" (1/1) ... [2022-12-13 20:24:58,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4778201d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:58, skipping insertion in model container [2022-12-13 20:24:58,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:24:58" (1/1) ... [2022-12-13 20:24:58,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:24:58,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:24:59,414 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-12-13 20:24:59,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:24:59,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:24:59,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:24:59,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:24:59,440 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-12-13 20:24:59,443 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-12-13 20:24:59,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:24:59,463 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:24:59,494 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-12-13 20:24:59,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:24:59,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:24:59,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:24:59,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:24:59,507 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-12-13 20:24:59,510 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-12-13 20:24:59,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:24:59,616 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:24:59,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59 WrapperNode [2022-12-13 20:24:59,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:24:59,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:24:59,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:24:59,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:24:59,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,689 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1719 [2022-12-13 20:24:59,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:24:59,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:24:59,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:24:59,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:24:59,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,746 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:24:59,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:24:59,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:24:59,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:24:59,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (1/1) ... [2022-12-13 20:24:59,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:24:59,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:24:59,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:24:59,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2022-12-13 20:24:59,820 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:24:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:24:59,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:24:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:24:59,823 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 20:25:00,060 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:25:00,062 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:25:01,327 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:25:01,573 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:25:01,573 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-12-13 20:25:01,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:25:01 BoogieIcfgContainer [2022-12-13 20:25:01,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:25:01,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:25:01,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:25:01,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:25:01,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:24:58" (1/3) ... [2022-12-13 20:25:01,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60385185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:25:01, skipping insertion in model container [2022-12-13 20:25:01,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:24:59" (2/3) ... [2022-12-13 20:25:01,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60385185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:25:01, skipping insertion in model container [2022-12-13 20:25:01,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:25:01" (3/3) ... [2022-12-13 20:25:01,581 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2022-12-13 20:25:01,589 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:25:01,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:25:01,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-12-13 20:25:01,597 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:25:01,722 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 20:25:01,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:02,553 INFO L130 PetriNetUnfolder]: 89/3097 cut-off events. [2022-12-13 20:25:02,554 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:25:02,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 3097 events. 89/3097 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 14326 event pairs, 0 based on Foata normal form. 0/2995 useless extension candidates. Maximal degree in co-relation 1580. Up to 6 conditions per place. [2022-12-13 20:25:02,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:02,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:02,603 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:25:02,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:02,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:02,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1625 places, 1670 transitions, 3348 flow [2022-12-13 20:25:03,206 INFO L130 PetriNetUnfolder]: 89/3097 cut-off events. [2022-12-13 20:25:03,207 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:25:03,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 3097 events. 89/3097 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 14326 event pairs, 0 based on Foata normal form. 0/2995 useless extension candidates. Maximal degree in co-relation 1580. Up to 6 conditions per place. [2022-12-13 20:25:03,338 INFO L119 LiptonReduction]: Number of co-enabled transitions 424168 [2022-12-13 20:26:22,043 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 227 DAG size of output: 218 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:26:33,801 WARN L233 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 227 DAG size of output: 218 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:26:38,573 INFO L134 LiptonReduction]: Checked pairs total: 468640 [2022-12-13 20:26:38,574 INFO L136 LiptonReduction]: Total number of compositions: 1529 [2022-12-13 20:26:38,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:26:38,587 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c01a2cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:26:38,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 20:26:38,590 INFO L130 PetriNetUnfolder]: 2/23 cut-off events. [2022-12-13 20:26:38,591 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:26:38,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:26:38,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:26:38,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:26:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:26:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 251640133, now seen corresponding path program 1 times [2022-12-13 20:26:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:26:38,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348818792] [2022-12-13 20:26:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:26:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:26:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:26:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:26:38,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:26:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348818792] [2022-12-13 20:26:38,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348818792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:26:38,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:26:38,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:26:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538906482] [2022-12-13 20:26:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:26:38,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:26:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:26:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:26:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:26:38,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1577 out of 3199 [2022-12-13 20:26:38,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 272 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 1579.3333333333333) internal successors, (4738), 3 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:38,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:26:38,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1577 of 3199 [2022-12-13 20:26:38,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:26:42,443 INFO L130 PetriNetUnfolder]: 11367/21082 cut-off events. [2022-12-13 20:26:42,443 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:26:42,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42035 conditions, 21082 events. 11367/21082 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 130548 event pairs, 4554 based on Foata normal form. 46/18611 useless extension candidates. Maximal degree in co-relation 41953. Up to 10520 conditions per place. [2022-12-13 20:26:42,499 INFO L137 encePairwiseOnDemand]: 3183/3199 looper letters, 505 selfloop transitions, 14 changer transitions 4/527 dead transitions. [2022-12-13 20:26:42,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 527 transitions, 2108 flow [2022-12-13 20:26:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:26:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:26:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5262 transitions. [2022-12-13 20:26:42,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5482963426070647 [2022-12-13 20:26:42,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5262 transitions. [2022-12-13 20:26:42,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5262 transitions. [2022-12-13 20:26:42,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:26:42,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5262 transitions. [2022-12-13 20:26:42,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1754.0) internal successors, (5262), 3 states have internal predecessors, (5262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:42,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 3199.0) internal successors, (12796), 4 states have internal predecessors, (12796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:42,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 3199.0) internal successors, (12796), 4 states have internal predecessors, (12796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:42,566 INFO L175 Difference]: Start difference. First operand has 245 places, 272 transitions, 552 flow. Second operand 3 states and 5262 transitions. [2022-12-13 20:26:42,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 527 transitions, 2108 flow [2022-12-13 20:26:42,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 527 transitions, 2108 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:26:42,580 INFO L231 Difference]: Finished difference. Result has 248 places, 275 transitions, 612 flow [2022-12-13 20:26:42,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3199, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=248, PETRI_TRANSITIONS=275} [2022-12-13 20:26:42,586 INFO L288 CegarLoopForPetriNet]: 245 programPoint places, 3 predicate places. [2022-12-13 20:26:42,586 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 275 transitions, 612 flow [2022-12-13 20:26:42,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1579.3333333333333) internal successors, (4738), 3 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:42,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:26:42,588 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:26:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:26:42,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:26:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:26:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1536693370, now seen corresponding path program 1 times [2022-12-13 20:26:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:26:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124936041] [2022-12-13 20:26:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:26:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:26:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:26:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:26:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:26:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124936041] [2022-12-13 20:26:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124936041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:26:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516572401] [2022-12-13 20:26:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:26:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:26:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:26:42,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:26:42,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:26:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:26:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:26:42,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:26:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:26:42,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:26:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:26:42,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516572401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:26:42,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:26:42,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 20:26:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249963912] [2022-12-13 20:26:42,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:26:42,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:26:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:26:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:26:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:26:42,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1571 out of 3199 [2022-12-13 20:26:43,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 275 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 1572.5714285714287) internal successors, (11008), 7 states have internal predecessors, (11008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:43,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:26:43,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1571 of 3199 [2022-12-13 20:26:43,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:26:43,206 INFO L130 PetriNetUnfolder]: 54/153 cut-off events. [2022-12-13 20:26:43,206 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 20:26:43,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 153 events. 54/153 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs, 0 based on Foata normal form. 26/170 useless extension candidates. Maximal degree in co-relation 288. Up to 97 conditions per place. [2022-12-13 20:26:43,207 INFO L137 encePairwiseOnDemand]: 3194/3199 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 20:26:43,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 271 flow [2022-12-13 20:26:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:26:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:26:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9491 transitions. [2022-12-13 20:26:43,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49447744086693757 [2022-12-13 20:26:43,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 9491 transitions. [2022-12-13 20:26:43,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 9491 transitions. [2022-12-13 20:26:43,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:26:43,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 9491 transitions. [2022-12-13 20:26:43,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1581.8333333333333) internal successors, (9491), 6 states have internal predecessors, (9491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:43,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 3199.0) internal successors, (22393), 7 states have internal predecessors, (22393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:43,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 3199.0) internal successors, (22393), 7 states have internal predecessors, (22393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:43,261 INFO L175 Difference]: Start difference. First operand has 248 places, 275 transitions, 612 flow. Second operand 6 states and 9491 transitions. [2022-12-13 20:26:43,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 271 flow [2022-12-13 20:26:43,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:26:43,262 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 109 flow [2022-12-13 20:26:43,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3199, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-13 20:26:43,263 INFO L288 CegarLoopForPetriNet]: 245 programPoint places, -207 predicate places. [2022-12-13 20:26:43,263 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 109 flow [2022-12-13 20:26:43,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1572.5714285714287) internal successors, (11008), 7 states have internal predecessors, (11008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:26:43,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:26:43,266 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2022-12-13 20:26:43,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:26:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-13 20:26:43,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:26:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:26:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 459890716, now seen corresponding path program 2 times [2022-12-13 20:26:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:26:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539694392] [2022-12-13 20:26:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:26:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:26:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:26:43,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:26:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:26:43,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:26:43,651 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:26:43,652 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-12-13 20:26:43,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 20:26:43,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-12-13 20:26:43,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-13 20:26:43,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-13 20:26:43,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 20:26:43,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:26:43,654 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2022-12-13 20:26:43,656 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 20:26:43,656 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 20:26:43,726 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 20:26:43,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:44,940 INFO L130 PetriNetUnfolder]: 140/4719 cut-off events. [2022-12-13 20:26:44,940 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 20:26:44,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 4719 events. 140/4719 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 27289 event pairs, 0 based on Foata normal form. 0/4559 useless extension candidates. Maximal degree in co-relation 3099. Up to 9 conditions per place. [2022-12-13 20:26:44,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:44,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:44,999 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:26:44,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:45,000 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:45,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1772 places, 1820 transitions, 3658 flow [2022-12-13 20:26:46,373 INFO L130 PetriNetUnfolder]: 140/4719 cut-off events. [2022-12-13 20:26:46,373 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 20:26:46,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 4719 events. 140/4719 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 27289 event pairs, 0 based on Foata normal form. 0/4559 useless extension candidates. Maximal degree in co-relation 3099. Up to 9 conditions per place. [2022-12-13 20:26:46,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 895400 [2022-12-13 20:28:03,074 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 220 DAG size of output: 211 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:28:15,320 WARN L233 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 220 DAG size of output: 211 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:28:20,736 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 207 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:28:20,745 INFO L134 LiptonReduction]: Checked pairs total: 954571 [2022-12-13 20:28:20,745 INFO L136 LiptonReduction]: Total number of compositions: 1656 [2022-12-13 20:28:20,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:28:20,748 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c01a2cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:28:20,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 20:28:20,751 INFO L130 PetriNetUnfolder]: 2/22 cut-off events. [2022-12-13 20:28:20,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:28:20,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:28:20,751 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:20,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:28:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -511840707, now seen corresponding path program 1 times [2022-12-13 20:28:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:20,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128626244] [2022-12-13 20:28:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:20,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128626244] [2022-12-13 20:28:20,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128626244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:20,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:20,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:28:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092304713] [2022-12-13 20:28:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:20,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:28:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:20,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:20,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1720 out of 3476 [2022-12-13 20:28:20,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 299 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:20,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:28:20,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1720 of 3476 [2022-12-13 20:28:20,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:29:33,173 INFO L130 PetriNetUnfolder]: 464911/676927 cut-off events. [2022-12-13 20:29:33,173 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 20:29:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350513 conditions, 676927 events. 464911/676927 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 3259. Compared 4988425 event pairs, 194222 based on Foata normal form. 2016/596150 useless extension candidates. Maximal degree in co-relation 1302567. Up to 338869 conditions per place. [2022-12-13 20:29:35,512 INFO L137 encePairwiseOnDemand]: 3459/3476 looper letters, 550 selfloop transitions, 14 changer transitions 5/577 dead transitions. [2022-12-13 20:29:35,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 577 transitions, 2316 flow [2022-12-13 20:29:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:29:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:29:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5739 transitions. [2022-12-13 20:29:35,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5503452243958573 [2022-12-13 20:29:35,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5739 transitions. [2022-12-13 20:29:35,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5739 transitions. [2022-12-13 20:29:35,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:29:35,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5739 transitions. [2022-12-13 20:29:35,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1913.0) internal successors, (5739), 3 states have internal predecessors, (5739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:29:35,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 3476.0) internal successors, (13904), 4 states have internal predecessors, (13904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:29:35,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 3476.0) internal successors, (13904), 4 states have internal predecessors, (13904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:29:35,576 INFO L175 Difference]: Start difference. First operand has 271 places, 299 transitions, 616 flow. Second operand 3 states and 5739 transitions. [2022-12-13 20:29:35,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 577 transitions, 2316 flow [2022-12-13 20:29:35,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 577 transitions, 2316 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:29:35,582 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 680 flow [2022-12-13 20:29:35,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3476, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2022-12-13 20:29:35,583 INFO L288 CegarLoopForPetriNet]: 271 programPoint places, 3 predicate places. [2022-12-13 20:29:35,583 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 680 flow [2022-12-13 20:29:35,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:29:35,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:29:35,584 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:29:35,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:29:35,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:29:35,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:29:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 900554242, now seen corresponding path program 1 times [2022-12-13 20:29:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:29:35,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150692270] [2022-12-13 20:29:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:29:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:29:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:29:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:29:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:29:35,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150692270] [2022-12-13 20:29:35,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150692270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:29:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428062883] [2022-12-13 20:29:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:29:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:29:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:29:35,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:29:35,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:29:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:29:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:29:35,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:29:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:29:35,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:29:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:29:35,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428062883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:29:35,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:29:35,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 20:29:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932171729] [2022-12-13 20:29:35,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:29:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:29:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:29:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:29:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:29:35,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1714 out of 3476 [2022-12-13 20:29:35,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 680 flow. Second operand has 7 states, 7 states have (on average 1715.7142857142858) internal successors, (12010), 7 states have internal predecessors, (12010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:29:35,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:29:35,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1714 of 3476 [2022-12-13 20:29:35,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:30:54,780 INFO L130 PetriNetUnfolder]: 452249/654171 cut-off events. [2022-12-13 20:30:54,781 INFO L131 PetriNetUnfolder]: For 2023/2023 co-relation queries the response was YES. [2022-12-13 20:30:55,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313180 conditions, 654171 events. 452249/654171 cut-off events. For 2023/2023 co-relation queries the response was YES. Maximal size of possible extension queue 2082. Compared 4550514 event pairs, 187690 based on Foata normal form. 1034/580593 useless extension candidates. Maximal degree in co-relation 1302586. Up to 323507 conditions per place. [2022-12-13 20:30:57,057 INFO L137 encePairwiseOnDemand]: 3457/3476 looper letters, 594 selfloop transitions, 30 changer transitions 1/633 dead transitions. [2022-12-13 20:30:57,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 633 transitions, 2610 flow [2022-12-13 20:30:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:30:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:30:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10916 transitions. [2022-12-13 20:30:57,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233985423858841 [2022-12-13 20:30:57,071 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10916 transitions. [2022-12-13 20:30:57,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10916 transitions. [2022-12-13 20:30:57,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:30:57,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10916 transitions. [2022-12-13 20:30:57,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1819.3333333333333) internal successors, (10916), 6 states have internal predecessors, (10916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:30:57,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 3476.0) internal successors, (24332), 7 states have internal predecessors, (24332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:30:57,108 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 3476.0) internal successors, (24332), 7 states have internal predecessors, (24332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:30:57,108 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 680 flow. Second operand 6 states and 10916 transitions. [2022-12-13 20:30:57,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 633 transitions, 2610 flow [2022-12-13 20:30:57,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 633 transitions, 2596 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:30:57,125 INFO L231 Difference]: Finished difference. Result has 277 places, 312 transitions, 794 flow [2022-12-13 20:30:57,125 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3476, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=794, PETRI_PLACES=277, PETRI_TRANSITIONS=312} [2022-12-13 20:30:57,126 INFO L288 CegarLoopForPetriNet]: 271 programPoint places, 6 predicate places. [2022-12-13 20:30:57,126 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 312 transitions, 794 flow [2022-12-13 20:30:57,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1715.7142857142858) internal successors, (12010), 7 states have internal predecessors, (12010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:30:57,127 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:30:57,128 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 20:30:57,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:30:57,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:30:57,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:30:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:30:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2117877184, now seen corresponding path program 2 times [2022-12-13 20:30:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:30:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896371751] [2022-12-13 20:30:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:30:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:30:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:30:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:30:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:30:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896371751] [2022-12-13 20:30:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896371751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:30:57,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762193561] [2022-12-13 20:30:57,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:30:57,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:30:57,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:30:57,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:30:57,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:30:57,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:30:57,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:30:57,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:30:57,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:30:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:30:57,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:30:57,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762193561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:30:57,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:30:57,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-13 20:30:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537477427] [2022-12-13 20:30:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:30:57,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:30:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:30:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:30:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:30:57,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1716 out of 3476 [2022-12-13 20:30:57,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 312 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 1718.0) internal successors, (8590), 5 states have internal predecessors, (8590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:30:57,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:30:57,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1716 of 3476 [2022-12-13 20:30:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:17,309 INFO L130 PetriNetUnfolder]: 450229/651646 cut-off events. [2022-12-13 20:32:17,309 INFO L131 PetriNetUnfolder]: For 11816/11816 co-relation queries the response was YES. [2022-12-13 20:32:18,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315927 conditions, 651646 events. 450229/651646 cut-off events. For 11816/11816 co-relation queries the response was YES. Maximal size of possible extension queue 2082. Compared 4538981 event pairs, 187228 based on Foata normal form. 1449/578614 useless extension candidates. Maximal degree in co-relation 1315865. Up to 321880 conditions per place. [2022-12-13 20:32:19,905 INFO L137 encePairwiseOnDemand]: 3459/3476 looper letters, 598 selfloop transitions, 22 changer transitions 0/627 dead transitions. [2022-12-13 20:32:19,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 627 transitions, 2669 flow [2022-12-13 20:32:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9198 transitions. [2022-12-13 20:32:19,915 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.529228998849252 [2022-12-13 20:32:19,915 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 9198 transitions. [2022-12-13 20:32:19,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 9198 transitions. [2022-12-13 20:32:19,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:19,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 9198 transitions. [2022-12-13 20:32:19,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1839.6) internal successors, (9198), 5 states have internal predecessors, (9198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:19,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 3476.0) internal successors, (20856), 6 states have internal predecessors, (20856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:19,938 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 3476.0) internal successors, (20856), 6 states have internal predecessors, (20856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:19,938 INFO L175 Difference]: Start difference. First operand has 277 places, 312 transitions, 794 flow. Second operand 5 states and 9198 transitions. [2022-12-13 20:32:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 627 transitions, 2669 flow [2022-12-13 20:32:19,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 627 transitions, 2607 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 20:32:19,970 INFO L231 Difference]: Finished difference. Result has 276 places, 308 transitions, 757 flow [2022-12-13 20:32:19,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3476, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=757, PETRI_PLACES=276, PETRI_TRANSITIONS=308} [2022-12-13 20:32:19,972 INFO L288 CegarLoopForPetriNet]: 271 programPoint places, 5 predicate places. [2022-12-13 20:32:19,972 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 308 transitions, 757 flow [2022-12-13 20:32:19,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1718.0) internal successors, (8590), 5 states have internal predecessors, (8590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:19,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:19,973 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 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] [2022-12-13 20:32:19,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:32:20,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:20,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:32:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1796059212, now seen corresponding path program 1 times [2022-12-13 20:32:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373222168] [2022-12-13 20:32:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:32:20,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373222168] [2022-12-13 20:32:20,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373222168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:20,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:20,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632419762] [2022-12-13 20:32:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:20,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:32:20,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:32:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:32:20,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1701 out of 3476 [2022-12-13 20:32:20,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 308 transitions, 757 flow. Second operand has 4 states, 4 states have (on average 1710.0) internal successors, (6840), 4 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:20,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:20,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1701 of 3476 [2022-12-13 20:32:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:33:45,274 INFO L130 PetriNetUnfolder]: 492790/713726 cut-off events. [2022-12-13 20:33:45,274 INFO L131 PetriNetUnfolder]: For 13382/13382 co-relation queries the response was YES. [2022-12-13 20:33:46,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440810 conditions, 713726 events. 492790/713726 cut-off events. For 13382/13382 co-relation queries the response was YES. Maximal size of possible extension queue 2397. Compared 5046936 event pairs, 389226 based on Foata normal form. 0/634341 useless extension candidates. Maximal degree in co-relation 1440754. Up to 683694 conditions per place. [2022-12-13 20:33:47,804 INFO L137 encePairwiseOnDemand]: 3454/3476 looper letters, 425 selfloop transitions, 34 changer transitions 0/465 dead transitions. [2022-12-13 20:33:47,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 465 transitions, 1989 flow [2022-12-13 20:33:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:33:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:33:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8953 transitions. [2022-12-13 20:33:47,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515132336018412 [2022-12-13 20:33:47,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 8953 transitions. [2022-12-13 20:33:47,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 8953 transitions. [2022-12-13 20:33:47,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:33:47,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 8953 transitions. [2022-12-13 20:33:47,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1790.6) internal successors, (8953), 5 states have internal predecessors, (8953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:47,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 3476.0) internal successors, (20856), 6 states have internal predecessors, (20856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:47,840 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 3476.0) internal successors, (20856), 6 states have internal predecessors, (20856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:47,840 INFO L175 Difference]: Start difference. First operand has 276 places, 308 transitions, 757 flow. Second operand 5 states and 8953 transitions. [2022-12-13 20:33:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 465 transitions, 1989 flow [2022-12-13 20:33:47,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 465 transitions, 1958 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:33:47,889 INFO L231 Difference]: Finished difference. Result has 280 places, 340 transitions, 976 flow [2022-12-13 20:33:47,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=3476, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=976, PETRI_PLACES=280, PETRI_TRANSITIONS=340} [2022-12-13 20:33:47,889 INFO L288 CegarLoopForPetriNet]: 271 programPoint places, 9 predicate places. [2022-12-13 20:33:47,889 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 340 transitions, 976 flow [2022-12-13 20:33:47,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1710.0) internal successors, (6840), 4 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:47,890 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:33:47,890 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 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] [2022-12-13 20:33:47,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:33:47,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 20:33:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -156135414, now seen corresponding path program 1 times [2022-12-13 20:33:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131686833] [2022-12-13 20:33:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:33:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131686833] [2022-12-13 20:33:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131686833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:33:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632883618] [2022-12-13 20:33:51,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:33:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:33:51,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:33:51,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9044e7e0-56fb-45c1-b596-148bcb6edff6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:33:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:51,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 232 conjunts are in the unsatisfiable core [2022-12-13 20:33:51,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:33:51,338 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:33:51,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 20:33:51,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-12-13 20:33:51,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-12-13 20:33:51,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 100 [2022-12-13 20:33:51,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 94 [2022-12-13 20:33:51,940 INFO L321 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2022-12-13 20:33:51,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 126 [2022-12-13 20:33:52,020 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:33:52,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2022-12-13 20:33:52,519 INFO L321 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2022-12-13 20:33:52,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 138 [2022-12-13 20:33:52,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2022-12-13 20:33:52,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2022-12-13 20:33:52,590 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:33:52,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2022-12-13 20:33:52,598 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:33:52,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2022-12-13 20:33:52,907 INFO L321 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2022-12-13 20:33:52,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 150 [2022-12-13 20:33:52,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2022-12-13 20:33:52,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2022-12-13 20:33:53,008 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:33:53,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2022-12-13 20:33:53,411 INFO L321 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2022-12-13 20:33:53,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 155 [2022-12-13 20:33:53,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2022-12-13 20:33:53,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2022-12-13 20:33:53,504 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:33:53,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-12-13 20:33:53,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2022-12-13 20:33:53,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2022-12-13 20:33:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:33:53,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:34:03,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:34:03,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2022-12-13 20:34:03,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:34:03,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2022-12-13 20:34:14,343 WARN L233 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 288 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:34:34,799 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 257 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:34:35,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 32 |c_~#q~0.offset|)) (.cse5 (+ 104 |c_~#q~0.offset|)) (.cse1 (+ |c_~#q~0.offset| 36))) (and (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse0 (select .cse11 |c_~#q~0.base|)) (.cse2 (select (select .cse11 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse0 .cse1) .cse2)) (forall ((v_subst_18 Int)) (let ((.cse10 (store .cse11 |c_~#q~0.base| (store .cse0 .cse1 0)))) (let ((.cse3 (select (select .cse10 v_subst_18) 0))) (or (not (= .cse3 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse7 (store .cse10 v_subst_18 v_ArrVal_1064))) (let ((.cse8 (select (select .cse7 v_subst_10) 0))) (or (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse4 (store .cse7 v_subst_10 v_ArrVal_1072))) (let ((.cse6 (select (select .cse4 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse4 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= (select (select .cse4 |c_~#q~0.base|) .cse1) .cse6) (not (= 0 .cse6)))))) (not (= .cse8 0)) (= (select (select .cse7 |c_~#q~0.base|) .cse9) .cse8))))) (= (select .cse0 .cse9) .cse3))))) (not (= .cse2 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse12 (select .cse21 |c_~#q~0.base|)) (.cse13 (select (select .cse21 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse1) .cse13)) (forall ((v_subst_16 Int)) (let ((.cse19 (store .cse21 |c_~#q~0.base| (store .cse12 .cse1 0)))) (let ((.cse20 (select (select .cse19 v_subst_16) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse15 (store .cse19 v_subst_16 v_ArrVal_1064))) (let ((.cse14 (select (select .cse15 v_subst_8) 0))) (or (= .cse14 (select (select .cse15 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse18 (store .cse15 v_subst_8 v_ArrVal_1072))) (let ((.cse17 (select .cse18 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse16 (select (select .cse18 v_subst_2) 0))) (or (not (= .cse16 0)) (not (= .cse16 (select .cse17 .cse1)))))) (not (= 0 (select .cse17 .cse5))))))) (not (= .cse14 0)))))) (not (= .cse20 0)) (= (select .cse12 .cse9) .cse20))))) (not (= .cse13 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse23 (select (select .cse22 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse22 |c_~#q~0.base|) .cse1) .cse23) (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse26 (store .cse22 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse24 (select .cse26 |c_~#q~0.base|)) (.cse25 (select (select .cse26 v_subst_15) 0))) (or (not (= (select .cse24 .cse5) 0)) (not (= (select .cse24 .cse9) .cse25)) (not (= .cse25 0)))))) (not (= .cse23 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse28 (select (select .cse27 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse27 |c_~#q~0.base|) .cse1) .cse28) (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse30 (store .cse27 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse29 (select (select .cse30 v_subst_13) 0))) (or (not (= 0 .cse29)) (= (select (select .cse30 |c_~#q~0.base|) .cse9) .cse29) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse35 (store .cse30 v_subst_13 v_ArrVal_1064))) (let ((.cse31 (select (select .cse35 v_subst_8) 0))) (or (not (= .cse31 0)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse34 (store .cse35 v_subst_8 v_ArrVal_1072))) (let ((.cse33 (select .cse34 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse32 (select (select .cse34 v_subst_2) 0))) (or (not (= .cse32 0)) (not (= .cse32 (select .cse33 .cse1)))))) (not (= (select .cse33 .cse5) 0)))))) (= (select (select .cse35 |c_~#q~0.base|) .cse9) .cse31))))))))) (not (= .cse28 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse36 (select .cse39 |c_~#q~0.base|)) (.cse37 (select (select .cse39 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse36 .cse1) .cse37)) (not (= (select .cse36 .cse5) 0)) (forall ((v_subst_19 Int)) (let ((.cse38 (select (select (store .cse39 |c_~#q~0.base| (store .cse36 .cse1 0)) v_subst_19) 0))) (or (not (= (select .cse36 .cse9) .cse38)) (not (= .cse38 0))))) (not (= .cse37 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse41 (select (select .cse40 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse40 |c_~#q~0.base|) .cse1) .cse41) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse42 (store .cse40 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse43 (select (select .cse42 v_subst_12) 0))) (or (= (select (select .cse42 |c_~#q~0.base|) .cse9) .cse43) (not (= .cse43 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse45 (store .cse42 v_subst_12 v_ArrVal_1064))) (let ((.cse44 (select (select .cse45 v_subst_10) 0))) (or (not (= .cse44 0)) (= .cse44 (select (select .cse45 |c_~#q~0.base|) .cse9)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse46 (store .cse45 v_subst_10 v_ArrVal_1072))) (let ((.cse47 (select (select .cse46 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse46 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= .cse47 (select (select .cse46 |c_~#q~0.base|) .cse1)) (not (= .cse47 0)))))))))))))) (not (= .cse41 0)))))))) is different from false [2022-12-13 20:34:37,403 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 104 |c_~#q~0.offset|)) (.cse2 (+ 32 |c_~#q~0.offset|)) (.cse5 (+ |c_~#q~0.offset| 36))) (and (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse0 (select .cse4 |c_~#q~0.base|)) (.cse6 (select (select .cse4 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_subst_19 Int)) (let ((.cse3 (select (select (store .cse4 |c_~#q~0.base| (store .cse0 .cse5 0)) v_subst_19) 0))) (or (not (= (select .cse0 .cse2) .cse3)) (not (= .cse3 0))))) (not (= .cse6 (select .cse0 .cse5))) (not (= .cse6 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse7 (select (select .cse8 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse7 (select (select .cse8 |c_~#q~0.base|) .cse5)) (not (= .cse7 0)) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse10 (store .cse8 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse9 (select (select .cse10 v_subst_12) 0))) (or (not (= .cse9 0)) (= .cse9 (select (select .cse10 |c_~#q~0.base|) .cse2)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse12 (store .cse10 v_subst_12 v_ArrVal_1064))) (let ((.cse11 (select (select .cse12 v_subst_10) 0))) (or (not (= .cse11 0)) (= (select (select .cse12 |c_~#q~0.base|) .cse2) .cse11) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse13 (store .cse12 v_subst_10 v_ArrVal_1072))) (let ((.cse14 (select (select .cse13 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse13 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse1) 0))) (= .cse14 (select (select .cse13 |c_~#q~0.base|) .cse5)) (not (= .cse14 0)))))))))))))))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse21 (select .cse22 |c_~#q~0.base|)) (.cse23 (select (select .cse22 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_18 Int)) (let ((.cse19 (store .cse22 |c_~#q~0.base| (store .cse21 .cse5 0)))) (let ((.cse20 (select (select .cse19 v_subst_18) 0))) (or (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse16 (store .cse19 v_subst_18 v_ArrVal_1064))) (let ((.cse15 (select (select .cse16 v_subst_10) 0))) (or (= .cse15 (select (select .cse16 |c_~#q~0.base|) .cse2)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse17 (store .cse16 v_subst_10 v_ArrVal_1072))) (let ((.cse18 (select (select .cse17 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse17 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse1) 0))) (not (= .cse18 0)) (= (select (select .cse17 |c_~#q~0.base|) .cse5) .cse18))))) (not (= .cse15 0)))))) (not (= .cse20 0)) (= (select .cse21 .cse2) .cse20))))) (not (= .cse23 (select .cse21 .cse5))) (not (= .cse23 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse28 (select (select .cse27 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse26 (store .cse27 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse24 (select .cse26 |c_~#q~0.base|)) (.cse25 (select (select .cse26 v_subst_15) 0))) (or (not (= (select .cse24 .cse1) 0)) (not (= .cse25 (select .cse24 .cse2))) (not (= .cse25 0)))))) (= .cse28 (select (select .cse27 |c_~#q~0.base|) .cse5)) (not (= .cse28 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse30 (select .cse37 |c_~#q~0.base|)) (.cse38 (select (select .cse37 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_16 Int)) (let ((.cse36 (store .cse37 |c_~#q~0.base| (store .cse30 .cse5 0)))) (let ((.cse29 (select (select .cse36 v_subst_16) 0))) (or (= .cse29 (select .cse30 .cse2)) (not (= .cse29 0)) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse32 (store .cse36 v_subst_16 v_ArrVal_1064))) (let ((.cse31 (select (select .cse32 v_subst_8) 0))) (or (not (= .cse31 0)) (= .cse31 (select (select .cse32 |c_~#q~0.base|) .cse2)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse35 (store .cse32 v_subst_8 v_ArrVal_1072))) (let ((.cse33 (select .cse35 |c_~#q~0.base|))) (or (not (= (select .cse33 .cse1) 0)) (forall ((v_subst_2 Int)) (let ((.cse34 (select (select .cse35 v_subst_2) 0))) (or (not (= .cse34 (select .cse33 .cse5))) (not (= .cse34 0))))))))))))))))) (not (= .cse38 (select .cse30 .cse5))) (not (= .cse38 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse47 (select (select .cse46 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse44 (store .cse46 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse45 (select (select .cse44 v_subst_13) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse40 (store .cse44 v_subst_13 v_ArrVal_1064))) (let ((.cse39 (select (select .cse40 v_subst_8) 0))) (or (not (= .cse39 0)) (= .cse39 (select (select .cse40 |c_~#q~0.base|) .cse2)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse43 (store .cse40 v_subst_8 v_ArrVal_1072))) (let ((.cse41 (select .cse43 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse42 (select (select .cse43 v_subst_2) 0))) (or (not (= (select .cse41 .cse5) .cse42)) (not (= 0 .cse42))))) (not (= (select .cse41 .cse1) 0)))))))))) (= .cse45 (select (select .cse44 |c_~#q~0.base|) .cse2)) (not (= .cse45 0)))))) (= .cse47 (select (select .cse46 |c_~#q~0.base|) .cse5)) (not (= .cse47 0)))))))) is different from false [2022-12-13 20:34:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 9 not checked. [2022-12-13 20:34:38,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632883618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:34:38,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:34:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 21] total 53 [2022-12-13 20:34:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814640979] [2022-12-13 20:34:38,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:34:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 20:34:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 20:34:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2243, Unknown=53, NotChecked=202, Total=2862 [2022-12-13 20:35:01,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:17,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 1280 out of 3476 [2022-12-13 20:35:17,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 340 transitions, 976 flow. Second operand has 54 states, 54 states have (on average 1282.1296296296296) internal successors, (69235), 54 states have internal predecessors, (69235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:17,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:35:17,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1280 of 3476 [2022-12-13 20:35:17,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:35:24,972 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse48 ((as const (Array Int Int)) 0)) (.cse49 (+ |c_~#q~0.offset| 24)) (.cse50 (+ |c_~#q~0.offset| 28)) (.cse51 (select |c_#memory_int| |c_~#q~0.base|)) (.cse5 (+ 104 |c_~#q~0.offset|)) (.cse9 (+ 32 |c_~#q~0.offset|)) (.cse1 (+ |c_~#q~0.offset| 36))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse0 (select .cse11 |c_~#q~0.base|)) (.cse2 (select (select .cse11 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse0 .cse1) .cse2)) (forall ((v_subst_18 Int)) (let ((.cse10 (store .cse11 |c_~#q~0.base| (store .cse0 .cse1 0)))) (let ((.cse3 (select (select .cse10 v_subst_18) 0))) (or (not (= .cse3 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse7 (store .cse10 v_subst_18 v_ArrVal_1064))) (let ((.cse8 (select (select .cse7 v_subst_10) 0))) (or (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse4 (store .cse7 v_subst_10 v_ArrVal_1072))) (let ((.cse6 (select (select .cse4 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse4 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= (select (select .cse4 |c_~#q~0.base|) .cse1) .cse6) (not (= 0 .cse6)))))) (not (= .cse8 0)) (= (select (select .cse7 |c_~#q~0.base|) .cse9) .cse8))))) (= (select .cse0 .cse9) .cse3))))) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_writeV_#in~v#1.base| |c_~#q~0.base|) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse15 (select (select .cse14 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse5) 0)) (forall ((v_subst_19 Int)) (let ((.cse13 (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse1 0)) v_subst_19) 0))) (or (not (= (select .cse12 .cse9) .cse13)) (not (= .cse13 0))))) (not (= .cse15 (select .cse12 .cse1))) (not (= .cse15 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse16 (select (select .cse17 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse16 (select (select .cse17 |c_~#q~0.base|) .cse1)) (not (= .cse16 0)) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse19 (store .cse17 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse18 (select (select .cse19 v_subst_12) 0))) (or (not (= .cse18 0)) (= .cse18 (select (select .cse19 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse21 (store .cse19 v_subst_12 v_ArrVal_1064))) (let ((.cse20 (select (select .cse21 v_subst_10) 0))) (or (not (= .cse20 0)) (= (select (select .cse21 |c_~#q~0.base|) .cse9) .cse20) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse22 (store .cse21 v_subst_10 v_ArrVal_1072))) (let ((.cse23 (select (select .cse22 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse22 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= .cse23 (select (select .cse22 |c_~#q~0.base|) .cse1)) (not (= .cse23 0)))))))))))))))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse24 (select .cse33 |c_~#q~0.base|)) (.cse25 (select (select .cse33 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse24 .cse1) .cse25)) (forall ((v_subst_16 Int)) (let ((.cse31 (store .cse33 |c_~#q~0.base| (store .cse24 .cse1 0)))) (let ((.cse32 (select (select .cse31 v_subst_16) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse27 (store .cse31 v_subst_16 v_ArrVal_1064))) (let ((.cse26 (select (select .cse27 v_subst_8) 0))) (or (= .cse26 (select (select .cse27 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse30 (store .cse27 v_subst_8 v_ArrVal_1072))) (let ((.cse29 (select .cse30 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse28 (select (select .cse30 v_subst_2) 0))) (or (not (= .cse28 0)) (not (= .cse28 (select .cse29 .cse1)))))) (not (= 0 (select .cse29 .cse5))))))) (not (= .cse26 0)))))) (not (= .cse32 0)) (= (select .cse24 .cse9) .cse32))))) (not (= .cse25 0)))))) (= |c_~#q~0.offset| 0) (forall ((v_ArrVal_1082 Int)) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| v_ArrVal_1082)) |c_~#q~0.base|) .cse5) 0))) (= 3 |c_~#q~0.base|) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse35 (select (select .cse34 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse34 |c_~#q~0.base|) .cse1) .cse35) (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse38 (store .cse34 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse36 (select .cse38 |c_~#q~0.base|)) (.cse37 (select (select .cse38 v_subst_15) 0))) (or (not (= (select .cse36 .cse5) 0)) (not (= (select .cse36 .cse9) .cse37)) (not (= .cse37 0)))))) (not (= .cse35 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse40 (select (select .cse39 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse39 |c_~#q~0.base|) .cse1) .cse40) (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse42 (store .cse39 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse41 (select (select .cse42 v_subst_13) 0))) (or (not (= 0 .cse41)) (= (select (select .cse42 |c_~#q~0.base|) .cse9) .cse41) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse47 (store .cse42 v_subst_13 v_ArrVal_1064))) (let ((.cse43 (select (select .cse47 v_subst_8) 0))) (or (not (= .cse43 0)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse46 (store .cse47 v_subst_8 v_ArrVal_1072))) (let ((.cse45 (select .cse46 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse44 (select (select .cse46 v_subst_2) 0))) (or (not (= .cse44 0)) (not (= .cse44 (select .cse45 .cse1)))))) (not (= (select .cse45 .cse5) 0)))))) (= (select (select .cse47 |c_~#q~0.base|) .cse9) .cse43))))))))) (not (= .cse40 0)))))) (exists ((v_ArrVal_1073 Int) (v_ArrVal_1046 Int) (v_ArrVal_1079 Int) (v_ArrVal_1045 Int) (v_ArrVal_1082 Int)) (= (store (store (store (store (store (store (store (store .cse48 .cse49 v_ArrVal_1046) .cse50 v_ArrVal_1045) .cse9 0) .cse5 1) .cse1 0) .cse9 v_ArrVal_1073) .cse1 v_ArrVal_1079) .cse9 v_ArrVal_1082) .cse51)) (exists ((v_ArrVal_1046 Int) (v_ArrVal_1045 Int)) (= (store (store (store (store (store .cse48 .cse49 v_ArrVal_1046) .cse50 v_ArrVal_1045) .cse9 0) .cse5 1) .cse1 0) .cse51)) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse59 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse58 (select .cse59 |c_~#q~0.base|)) (.cse60 (select (select .cse59 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_18 Int)) (let ((.cse56 (store .cse59 |c_~#q~0.base| (store .cse58 .cse1 0)))) (let ((.cse57 (select (select .cse56 v_subst_18) 0))) (or (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse53 (store .cse56 v_subst_18 v_ArrVal_1064))) (let ((.cse52 (select (select .cse53 v_subst_10) 0))) (or (= .cse52 (select (select .cse53 |c_~#q~0.base|) .cse9)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse54 (store .cse53 v_subst_10 v_ArrVal_1072))) (let ((.cse55 (select (select .cse54 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse54 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (not (= .cse55 0)) (= (select (select .cse54 |c_~#q~0.base|) .cse1) .cse55))))) (not (= .cse52 0)))))) (not (= .cse57 0)) (= (select .cse58 .cse9) .cse57))))) (not (= .cse60 (select .cse58 .cse1))) (not (= .cse60 0)))))) (= |c_~#items~0.base| 4) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse65 (select (select .cse64 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse63 (store .cse64 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse61 (select .cse63 |c_~#q~0.base|)) (.cse62 (select (select .cse63 v_subst_15) 0))) (or (not (= (select .cse61 .cse5) 0)) (not (= .cse62 (select .cse61 .cse9))) (not (= .cse62 0)))))) (= .cse65 (select (select .cse64 |c_~#q~0.base|) .cse1)) (not (= .cse65 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse66 (select .cse69 |c_~#q~0.base|)) (.cse67 (select (select .cse69 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse66 .cse1) .cse67)) (not (= (select .cse66 .cse5) 0)) (forall ((v_subst_19 Int)) (let ((.cse68 (select (select (store .cse69 |c_~#q~0.base| (store .cse66 .cse1 0)) v_subst_19) 0))) (or (not (= (select .cse66 .cse9) .cse68)) (not (= .cse68 0))))) (not (= .cse67 0)))))) (= .cse1 |c_ULTIMATE.start_writeV_#in~v#1.offset|) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse78 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse71 (select .cse78 |c_~#q~0.base|)) (.cse79 (select (select .cse78 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_16 Int)) (let ((.cse77 (store .cse78 |c_~#q~0.base| (store .cse71 .cse1 0)))) (let ((.cse70 (select (select .cse77 v_subst_16) 0))) (or (= .cse70 (select .cse71 .cse9)) (not (= .cse70 0)) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse73 (store .cse77 v_subst_16 v_ArrVal_1064))) (let ((.cse72 (select (select .cse73 v_subst_8) 0))) (or (not (= .cse72 0)) (= .cse72 (select (select .cse73 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse76 (store .cse73 v_subst_8 v_ArrVal_1072))) (let ((.cse74 (select .cse76 |c_~#q~0.base|))) (or (not (= (select .cse74 .cse5) 0)) (forall ((v_subst_2 Int)) (let ((.cse75 (select (select .cse76 v_subst_2) 0))) (or (not (= .cse75 (select .cse74 .cse1))) (not (= .cse75 0))))))))))))))))) (not (= .cse79 (select .cse71 .cse1))) (not (= .cse79 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse81 (select (select .cse80 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse80 |c_~#q~0.base|) .cse1) .cse81) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse82 (store .cse80 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse83 (select (select .cse82 v_subst_12) 0))) (or (= (select (select .cse82 |c_~#q~0.base|) .cse9) .cse83) (not (= .cse83 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse85 (store .cse82 v_subst_12 v_ArrVal_1064))) (let ((.cse84 (select (select .cse85 v_subst_10) 0))) (or (not (= .cse84 0)) (= .cse84 (select (select .cse85 |c_~#q~0.base|) .cse9)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse86 (store .cse85 v_subst_10 v_ArrVal_1072))) (let ((.cse87 (select (select .cse86 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse86 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= .cse87 (select (select .cse86 |c_~#q~0.base|) .cse1)) (not (= .cse87 0)))))))))))))) (not (= .cse81 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse95 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse96 (select (select .cse95 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse93 (store .cse95 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse94 (select (select .cse93 v_subst_13) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse89 (store .cse93 v_subst_13 v_ArrVal_1064))) (let ((.cse88 (select (select .cse89 v_subst_8) 0))) (or (not (= .cse88 0)) (= .cse88 (select (select .cse89 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse92 (store .cse89 v_subst_8 v_ArrVal_1072))) (let ((.cse90 (select .cse92 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse91 (select (select .cse92 v_subst_2) 0))) (or (not (= (select .cse90 .cse1) .cse91)) (not (= 0 .cse91))))) (not (= (select .cse90 .cse5) 0)))))))))) (= .cse94 (select (select .cse93 |c_~#q~0.base|) .cse9)) (not (= .cse94 0)))))) (= .cse96 (select (select .cse95 |c_~#q~0.base|) .cse1)) (not (= .cse96 0)))))))) is different from true [2022-12-13 20:35:27,267 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 104 |c_~#q~0.offset|)) (.cse9 (+ 32 |c_~#q~0.offset|)) (.cse1 (+ |c_~#q~0.offset| 36))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse0 (select .cse11 |c_~#q~0.base|)) (.cse2 (select (select .cse11 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse0 .cse1) .cse2)) (forall ((v_subst_18 Int)) (let ((.cse10 (store .cse11 |c_~#q~0.base| (store .cse0 .cse1 0)))) (let ((.cse3 (select (select .cse10 v_subst_18) 0))) (or (not (= .cse3 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse7 (store .cse10 v_subst_18 v_ArrVal_1064))) (let ((.cse8 (select (select .cse7 v_subst_10) 0))) (or (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse4 (store .cse7 v_subst_10 v_ArrVal_1072))) (let ((.cse6 (select (select .cse4 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse4 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= (select (select .cse4 |c_~#q~0.base|) .cse1) .cse6) (not (= 0 .cse6)))))) (not (= .cse8 0)) (= (select (select .cse7 |c_~#q~0.base|) .cse9) .cse8))))) (= (select .cse0 .cse9) .cse3))))) (not (= .cse2 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse15 (select (select .cse14 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse5) 0)) (forall ((v_subst_19 Int)) (let ((.cse13 (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse1 0)) v_subst_19) 0))) (or (not (= (select .cse12 .cse9) .cse13)) (not (= .cse13 0))))) (not (= .cse15 (select .cse12 .cse1))) (not (= .cse15 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse16 (select (select .cse17 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse16 (select (select .cse17 |c_~#q~0.base|) .cse1)) (not (= .cse16 0)) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse19 (store .cse17 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse18 (select (select .cse19 v_subst_12) 0))) (or (not (= .cse18 0)) (= .cse18 (select (select .cse19 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse21 (store .cse19 v_subst_12 v_ArrVal_1064))) (let ((.cse20 (select (select .cse21 v_subst_10) 0))) (or (not (= .cse20 0)) (= (select (select .cse21 |c_~#q~0.base|) .cse9) .cse20) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse22 (store .cse21 v_subst_10 v_ArrVal_1072))) (let ((.cse23 (select (select .cse22 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse22 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= .cse23 (select (select .cse22 |c_~#q~0.base|) .cse1)) (not (= .cse23 0)))))))))))))))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse24 (select .cse33 |c_~#q~0.base|)) (.cse25 (select (select .cse33 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse24 .cse1) .cse25)) (forall ((v_subst_16 Int)) (let ((.cse31 (store .cse33 |c_~#q~0.base| (store .cse24 .cse1 0)))) (let ((.cse32 (select (select .cse31 v_subst_16) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse27 (store .cse31 v_subst_16 v_ArrVal_1064))) (let ((.cse26 (select (select .cse27 v_subst_8) 0))) (or (= .cse26 (select (select .cse27 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse30 (store .cse27 v_subst_8 v_ArrVal_1072))) (let ((.cse29 (select .cse30 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse28 (select (select .cse30 v_subst_2) 0))) (or (not (= .cse28 0)) (not (= .cse28 (select .cse29 .cse1)))))) (not (= 0 (select .cse29 .cse5))))))) (not (= .cse26 0)))))) (not (= .cse32 0)) (= (select .cse24 .cse9) .cse32))))) (not (= .cse25 0)))))) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse35 (select (select .cse34 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse34 |c_~#q~0.base|) .cse1) .cse35) (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse38 (store .cse34 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse36 (select .cse38 |c_~#q~0.base|)) (.cse37 (select (select .cse38 v_subst_15) 0))) (or (not (= (select .cse36 .cse5) 0)) (not (= (select .cse36 .cse9) .cse37)) (not (= .cse37 0)))))) (not (= .cse35 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse40 (select (select .cse39 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse39 |c_~#q~0.base|) .cse1) .cse40) (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse42 (store .cse39 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse41 (select (select .cse42 v_subst_13) 0))) (or (not (= 0 .cse41)) (= (select (select .cse42 |c_~#q~0.base|) .cse9) .cse41) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse47 (store .cse42 v_subst_13 v_ArrVal_1064))) (let ((.cse43 (select (select .cse47 v_subst_8) 0))) (or (not (= .cse43 0)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse46 (store .cse47 v_subst_8 v_ArrVal_1072))) (let ((.cse45 (select .cse46 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse44 (select (select .cse46 v_subst_2) 0))) (or (not (= .cse44 0)) (not (= .cse44 (select .cse45 .cse1)))))) (not (= (select .cse45 .cse5) 0)))))) (= (select (select .cse47 |c_~#q~0.base|) .cse9) .cse43))))))))) (not (= .cse40 0)))))) (exists ((v_ArrVal_1046 Int) (v_ArrVal_1045 Int)) (= (store (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_~#q~0.offset| 24) v_ArrVal_1046) (+ |c_~#q~0.offset| 28) v_ArrVal_1045) .cse9 0) .cse5 1) .cse1 0) (select |c_#memory_int| |c_~#q~0.base|))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse54 (select .cse55 |c_~#q~0.base|)) (.cse56 (select (select .cse55 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_18 Int)) (let ((.cse52 (store .cse55 |c_~#q~0.base| (store .cse54 .cse1 0)))) (let ((.cse53 (select (select .cse52 v_subst_18) 0))) (or (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse49 (store .cse52 v_subst_18 v_ArrVal_1064))) (let ((.cse48 (select (select .cse49 v_subst_10) 0))) (or (= .cse48 (select (select .cse49 |c_~#q~0.base|) .cse9)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse50 (store .cse49 v_subst_10 v_ArrVal_1072))) (let ((.cse51 (select (select .cse50 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse50 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (not (= .cse51 0)) (= (select (select .cse50 |c_~#q~0.base|) .cse1) .cse51))))) (not (= .cse48 0)))))) (not (= .cse53 0)) (= (select .cse54 .cse9) .cse53))))) (not (= .cse56 (select .cse54 .cse1))) (not (= .cse56 0)))))) (= |c_~#items~0.base| 4) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse61 (select (select .cse60 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_15 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse59 (store .cse60 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse57 (select .cse59 |c_~#q~0.base|)) (.cse58 (select (select .cse59 v_subst_15) 0))) (or (not (= (select .cse57 .cse5) 0)) (not (= .cse58 (select .cse57 .cse9))) (not (= .cse58 0)))))) (= .cse61 (select (select .cse60 |c_~#q~0.base|) .cse1)) (not (= .cse61 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse62 (select .cse65 |c_~#q~0.base|)) (.cse63 (select (select .cse65 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse62 .cse1) .cse63)) (not (= (select .cse62 .cse5) 0)) (forall ((v_subst_19 Int)) (let ((.cse64 (select (select (store .cse65 |c_~#q~0.base| (store .cse62 .cse1 0)) v_subst_19) 0))) (or (not (= (select .cse62 .cse9) .cse64)) (not (= .cse64 0))))) (not (= .cse63 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse74 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse67 (select .cse74 |c_~#q~0.base|)) (.cse75 (select (select .cse74 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_16 Int)) (let ((.cse73 (store .cse74 |c_~#q~0.base| (store .cse67 .cse1 0)))) (let ((.cse66 (select (select .cse73 v_subst_16) 0))) (or (= .cse66 (select .cse67 .cse9)) (not (= .cse66 0)) (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse69 (store .cse73 v_subst_16 v_ArrVal_1064))) (let ((.cse68 (select (select .cse69 v_subst_8) 0))) (or (not (= .cse68 0)) (= .cse68 (select (select .cse69 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse72 (store .cse69 v_subst_8 v_ArrVal_1072))) (let ((.cse70 (select .cse72 |c_~#q~0.base|))) (or (not (= (select .cse70 .cse5) 0)) (forall ((v_subst_2 Int)) (let ((.cse71 (select (select .cse72 v_subst_2) 0))) (or (not (= .cse71 (select .cse70 .cse1))) (not (= .cse71 0))))))))))))))))) (not (= .cse75 (select .cse67 .cse1))) (not (= .cse75 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse77 (select (select .cse76 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse76 |c_~#q~0.base|) .cse1) .cse77) (forall ((v_subst_12 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse78 (store .cse76 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse79 (select (select .cse78 v_subst_12) 0))) (or (= (select (select .cse78 |c_~#q~0.base|) .cse9) .cse79) (not (= .cse79 0)) (forall ((v_ArrVal_1064 (Array Int Int)) (v_subst_10 Int)) (let ((.cse81 (store .cse78 v_subst_12 v_ArrVal_1064))) (let ((.cse80 (select (select .cse81 v_subst_10) 0))) (or (not (= .cse80 0)) (= .cse80 (select (select .cse81 |c_~#q~0.base|) .cse9)) (forall ((v_subst_1 Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse82 (store .cse81 v_subst_10 v_ArrVal_1072))) (let ((.cse83 (select (select .cse82 v_subst_1) 0))) (or (forall ((v_ArrVal_1076 (Array Int Int))) (not (= (select (select (store .cse82 v_subst_1 v_ArrVal_1076) |c_~#q~0.base|) .cse5) 0))) (= .cse83 (select (select .cse82 |c_~#q~0.base|) .cse1)) (not (= .cse83 0)))))))))))))) (not (= .cse77 0)))))) (forall ((|ULTIMATE.start_readV_~#expected~0#1.base| Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse91 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1052))) (let ((.cse92 (select (select .cse91 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (forall ((v_subst_13 Int) (v_ArrVal_1059 (Array Int Int))) (let ((.cse89 (store .cse91 |ULTIMATE.start_readV_~#expected~0#1.base| v_ArrVal_1059))) (let ((.cse90 (select (select .cse89 v_subst_13) 0))) (or (forall ((v_subst_8 Int) (v_ArrVal_1064 (Array Int Int))) (let ((.cse85 (store .cse89 v_subst_13 v_ArrVal_1064))) (let ((.cse84 (select (select .cse85 v_subst_8) 0))) (or (not (= .cse84 0)) (= .cse84 (select (select .cse85 |c_~#q~0.base|) .cse9)) (forall ((v_ArrVal_1072 (Array Int Int))) (let ((.cse88 (store .cse85 v_subst_8 v_ArrVal_1072))) (let ((.cse86 (select .cse88 |c_~#q~0.base|))) (or (forall ((v_subst_2 Int)) (let ((.cse87 (select (select .cse88 v_subst_2) 0))) (or (not (= (select .cse86 .cse1) .cse87)) (not (= 0 .cse87))))) (not (= (select .cse86 .cse5) 0)))))))))) (= .cse90 (select (select .cse89 |c_~#q~0.base|) .cse9)) (not (= .cse90 0)))))) (= .cse92 (select (select .cse91 |c_~#q~0.base|) .cse1)) (not (= .cse92 0)))))))) is different from true