./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF --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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:19:36,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:19:36,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:19:36,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:19:36,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:19:36,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:19:36,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:19:36,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:19:36,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:19:36,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:19:36,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:19:36,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:19:36,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:19:36,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:19:36,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:19:36,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:19:36,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:19:36,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:19:36,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:19:36,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:19:36,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:19:36,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:19:36,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:19:36,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:19:36,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:19:36,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:19:36,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:19:36,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:19:36,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:19:36,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:19:36,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:19:36,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:19:36,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:19:36,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:19:36,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:19:36,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:19:36,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:19:36,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:19:36,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:19:36,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:19:36,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:19:36,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:19:36,370 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:19:36,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:19:36,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:19:36,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:19:36,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:19:36,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:19:36,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:19:36,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:19:36,385 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:19:36,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:19:36,387 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:19:36,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:19:36,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:19:36,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:19:36,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:19:36,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:19:36,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:19:36,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:19:36,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:19:36,390 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:19:36,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:19:36,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:19:36,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:19:36,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:19:36,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:19:36,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:19:36,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:19:36,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:19:36,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:19:36,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:19:36,395 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:19:36,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:19:36,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:19:36,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:19:36,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/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_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2021-11-20 07:19:36,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:19:36,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:19:36,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:19:36,804 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:19:36,805 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:19:36,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/pthread/stack-1.i [2021-11-20 07:19:36,904 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/data/5900e7d70/2c79ef98c316409891ac4f3d1d62ba74/FLAG8ec95ac1b [2021-11-20 07:19:37,632 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:19:37,632 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/sv-benchmarks/c/pthread/stack-1.i [2021-11-20 07:19:37,653 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/data/5900e7d70/2c79ef98c316409891ac4f3d1d62ba74/FLAG8ec95ac1b [2021-11-20 07:19:37,857 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/data/5900e7d70/2c79ef98c316409891ac4f3d1d62ba74 [2021-11-20 07:19:37,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:19:37,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:19:37,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:19:37,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:19:37,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:19:37,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:37" (1/1) ... [2021-11-20 07:19:37,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ae1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:37, skipping insertion in model container [2021-11-20 07:19:37,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:37" (1/1) ... [2021-11-20 07:19:37,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:19:37,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:19:38,536 WARN L230 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_71af4d0a-ef4c-4bde-9665-c055d261f569/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-20 07:19:38,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:19:38,592 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:19:38,664 WARN L230 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_71af4d0a-ef4c-4bde-9665-c055d261f569/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-20 07:19:38,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:19:38,758 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:19:38,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38 WrapperNode [2021-11-20 07:19:38,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:19:38,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:19:38,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:19:38,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:19:38,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,831 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2021-11-20 07:19:38,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:19:38,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:19:38,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:19:38,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:19:38,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:19:38,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:19:38,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:19:38,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:19:38,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (1/1) ... [2021-11-20 07:19:38,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:19:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:19:38,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:19:38,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:19:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-20 07:19:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-20 07:19:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-20 07:19:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-20 07:19:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:19:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:19:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 07:19:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:19:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-20 07:19:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:19:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:19:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:19:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:19:39,014 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 07:19:39,198 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:19:39,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:19:39,627 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:19:39,640 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:19:39,644 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 07:19:39,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:39 BoogieIcfgContainer [2021-11-20 07:19:39,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:19:39,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:19:39,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:19:39,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:19:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:19:37" (1/3) ... [2021-11-20 07:19:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@886befa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:39, skipping insertion in model container [2021-11-20 07:19:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:38" (2/3) ... [2021-11-20 07:19:39,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@886befa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:39, skipping insertion in model container [2021-11-20 07:19:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:39" (3/3) ... [2021-11-20 07:19:39,662 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2021-11-20 07:19:39,669 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 07:19:39,669 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:19:39,669 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 07:19:39,670 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 07:19:39,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,774 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,774 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,774 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,825 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,825 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,825 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,825 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,843 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,843 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,843 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,843 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,844 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,844 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,844 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,844 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,844 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:39,848 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-20 07:19:39,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:19:39,919 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:19:39,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-20 07:19:39,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2021-11-20 07:19:40,102 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2021-11-20 07:19:40,103 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-20 07:19:40,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 10/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2021-11-20 07:19:40,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 176 transitions, 368 flow [2021-11-20 07:19:40,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 164 transitions, 337 flow [2021-11-20 07:19:40,194 INFO L129 PetriNetUnfolder]: 5/130 cut-off events. [2021-11-20 07:19:40,194 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-20 07:19:40,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:40,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:40,196 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2021-11-20 07:19:40,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:40,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404485124] [2021-11-20 07:19:40,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:40,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:40,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:40,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404485124] [2021-11-20 07:19:40,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404485124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:40,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:40,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:19:40,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511933591] [2021-11-20 07:19:40,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:40,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:19:40,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:19:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:19:40,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2021-11-20 07:19:40,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2021-11-20 07:19:40,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:40,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2021-11-20 07:19:40,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:41,015 INFO L129 PetriNetUnfolder]: 88/703 cut-off events. [2021-11-20 07:19:41,015 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-11-20 07:19:41,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 703 events. 88/703 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3125 event pairs, 32 based on Foata normal form. 69/706 useless extension candidates. Maximal degree in co-relation 747. Up to 111 conditions per place. [2021-11-20 07:19:41,032 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2021-11-20 07:19:41,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 385 flow [2021-11-20 07:19:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:19:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:19:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2021-11-20 07:19:41,060 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9299242424242424 [2021-11-20 07:19:41,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2021-11-20 07:19:41,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2021-11-20 07:19:41,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:41,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2021-11-20 07:19:41,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) [2021-11-20 07:19:41,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:41,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:41,107 INFO L186 Difference]: Start difference. First operand has 161 places, 164 transitions, 337 flow. Second operand 3 states and 491 transitions. [2021-11-20 07:19:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 385 flow [2021-11-20 07:19:41,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 07:19:41,130 INFO L242 Difference]: Finished difference. Result has 157 places, 156 transitions, 331 flow [2021-11-20 07:19:41,133 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2021-11-20 07:19:41,144 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, -4 predicate places. [2021-11-20 07:19:41,145 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 331 flow [2021-11-20 07:19:41,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2021-11-20 07:19:41,146 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:41,146 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:41,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:19:41,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2021-11-20 07:19:41,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:41,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128380516] [2021-11-20 07:19:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:41,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:41,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128380516] [2021-11-20 07:19:41,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128380516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:41,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:41,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:19:41,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647336992] [2021-11-20 07:19:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:41,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:19:41,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:19:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:19:41,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 176 [2021-11-20 07:19:41,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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) [2021-11-20 07:19:41,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:41,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 176 [2021-11-20 07:19:41,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:41,576 INFO L129 PetriNetUnfolder]: 34/594 cut-off events. [2021-11-20 07:19:41,576 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-11-20 07:19:41,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 594 events. 34/594 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2041 event pairs, 11 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 411. Up to 45 conditions per place. [2021-11-20 07:19:41,585 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 16 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2021-11-20 07:19:41,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 392 flow [2021-11-20 07:19:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:19:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-11-20 07:19:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2021-11-20 07:19:41,589 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9161931818181818 [2021-11-20 07:19:41,589 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2021-11-20 07:19:41,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2021-11-20 07:19:41,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:41,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2021-11-20 07:19:41,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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) [2021-11-20 07:19:41,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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) [2021-11-20 07:19:41,599 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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) [2021-11-20 07:19:41,599 INFO L186 Difference]: Start difference. First operand has 157 places, 156 transitions, 331 flow. Second operand 4 states and 645 transitions. [2021-11-20 07:19:41,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 392 flow [2021-11-20 07:19:41,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 164 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-20 07:19:41,612 INFO L242 Difference]: Finished difference. Result has 161 places, 159 transitions, 356 flow [2021-11-20 07:19:41,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2021-11-20 07:19:41,614 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2021-11-20 07:19:41,614 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 356 flow [2021-11-20 07:19:41,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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) [2021-11-20 07:19:41,615 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:41,616 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:41,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:19:41,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1664854431, now seen corresponding path program 1 times [2021-11-20 07:19:41,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:41,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837302437] [2021-11-20 07:19:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:41,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:41,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837302437] [2021-11-20 07:19:41,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837302437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:41,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:41,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:19:41,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71711364] [2021-11-20 07:19:41,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:41,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:19:41,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:19:41,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:19:41,745 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2021-11-20 07:19:41,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2021-11-20 07:19:41,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:41,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2021-11-20 07:19:41,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:42,110 INFO L129 PetriNetUnfolder]: 127/1271 cut-off events. [2021-11-20 07:19:42,110 INFO L130 PetriNetUnfolder]: For 90/100 co-relation queries the response was YES. [2021-11-20 07:19:42,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1271 events. 127/1271 cut-off events. For 90/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6983 event pairs, 33 based on Foata normal form. 12/1209 useless extension candidates. Maximal degree in co-relation 1334. Up to 135 conditions per place. [2021-11-20 07:19:42,128 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 25 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2021-11-20 07:19:42,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 447 flow [2021-11-20 07:19:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:19:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:19:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2021-11-20 07:19:42,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9204545454545454 [2021-11-20 07:19:42,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2021-11-20 07:19:42,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2021-11-20 07:19:42,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:42,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2021-11-20 07:19:42,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) [2021-11-20 07:19:42,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:42,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:42,140 INFO L186 Difference]: Start difference. First operand has 161 places, 159 transitions, 356 flow. Second operand 3 states and 486 transitions. [2021-11-20 07:19:42,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 447 flow [2021-11-20 07:19:42,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 171 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-20 07:19:42,153 INFO L242 Difference]: Finished difference. Result has 164 places, 163 transitions, 396 flow [2021-11-20 07:19:42,153 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=164, PETRI_TRANSITIONS=163} [2021-11-20 07:19:42,156 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2021-11-20 07:19:42,157 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 396 flow [2021-11-20 07:19:42,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2021-11-20 07:19:42,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:42,159 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:42,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:19:42,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2021-11-20 07:19:42,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867560772] [2021-11-20 07:19:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:42,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:42,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:42,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867560772] [2021-11-20 07:19:42,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867560772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:19:42,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627877184] [2021-11-20 07:19:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:42,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:19:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:19:42,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:19:42,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:19:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:42,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 07:19:42,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:19:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:43,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:19:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:43,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627877184] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:19:43,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:19:43,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-20 07:19:43,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113486597] [2021-11-20 07:19:43,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:19:43,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:19:43,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:19:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:19:43,497 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2021-11-20 07:19:43,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 163 transitions, 396 flow. Second operand has 10 states, 10 states have (on average 152.5) internal successors, (1525), 10 states have internal predecessors, (1525), 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) [2021-11-20 07:19:43,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:43,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2021-11-20 07:19:43,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:44,314 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([472] L1009-->L1011: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][182], [34#L946-2true, Black: 190#true, Black: 178#(= ~top~0 0), 32#L1023-4true, 192#(<= 1 ~top~0), 117#L1011true, Black: 183#(= |t1Thread1of1ForFork0_push_#res#1| 0), 196#true, Black: 186#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), t2Thread1of1ForFork1InUse]) [2021-11-20 07:19:44,314 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2021-11-20 07:19:44,315 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2021-11-20 07:19:44,315 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2021-11-20 07:19:44,315 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2021-11-20 07:19:44,315 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1009-->L1009-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][183], [34#L946-2true, Black: 192#(<= 1 ~top~0), Black: 178#(= ~top~0 0), 32#L1023-4true, 190#true, 86#L1009-1true, 234#(<= ~top~0 0), Black: 183#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 186#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), t2Thread1of1ForFork1InUse]) [2021-11-20 07:19:44,316 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2021-11-20 07:19:44,316 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2021-11-20 07:19:44,316 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2021-11-20 07:19:44,316 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2021-11-20 07:19:44,436 INFO L129 PetriNetUnfolder]: 387/3002 cut-off events. [2021-11-20 07:19:44,437 INFO L130 PetriNetUnfolder]: For 1007/1065 co-relation queries the response was YES. [2021-11-20 07:19:44,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 3002 events. 387/3002 cut-off events. For 1007/1065 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 21704 event pairs, 43 based on Foata normal form. 40/2882 useless extension candidates. Maximal degree in co-relation 3942. Up to 300 conditions per place. [2021-11-20 07:19:44,471 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 86 selfloop transitions, 46 changer transitions 1/273 dead transitions. [2021-11-20 07:19:44,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 1078 flow [2021-11-20 07:19:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 07:19:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-20 07:19:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2831 transitions. [2021-11-20 07:19:44,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8936237373737373 [2021-11-20 07:19:44,482 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2831 transitions. [2021-11-20 07:19:44,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2831 transitions. [2021-11-20 07:19:44,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:44,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2831 transitions. [2021-11-20 07:19:44,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 157.27777777777777) internal successors, (2831), 18 states have internal predecessors, (2831), 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) [2021-11-20 07:19:44,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 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) [2021-11-20 07:19:44,513 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 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) [2021-11-20 07:19:44,513 INFO L186 Difference]: Start difference. First operand has 164 places, 163 transitions, 396 flow. Second operand 18 states and 2831 transitions. [2021-11-20 07:19:44,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 1078 flow [2021-11-20 07:19:44,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 273 transitions, 1016 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-11-20 07:19:44,532 INFO L242 Difference]: Finished difference. Result has 185 places, 218 transitions, 767 flow [2021-11-20 07:19:44,532 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=767, PETRI_PLACES=185, PETRI_TRANSITIONS=218} [2021-11-20 07:19:44,534 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 24 predicate places. [2021-11-20 07:19:44,534 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 218 transitions, 767 flow [2021-11-20 07:19:44,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 152.5) internal successors, (1525), 10 states have internal predecessors, (1525), 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) [2021-11-20 07:19:44,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:44,536 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:44,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:19:44,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:19:44,765 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 754166100, now seen corresponding path program 1 times [2021-11-20 07:19:44,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:44,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021269711] [2021-11-20 07:19:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:44,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:44,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:44,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021269711] [2021-11-20 07:19:44,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021269711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:44,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:44,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:19:44,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439368864] [2021-11-20 07:19:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:44,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:19:44,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:19:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:19:44,854 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2021-11-20 07:19:44,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 218 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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) [2021-11-20 07:19:44,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:44,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2021-11-20 07:19:44,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:45,105 INFO L129 PetriNetUnfolder]: 54/1111 cut-off events. [2021-11-20 07:19:45,105 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2021-11-20 07:19:45,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 1111 events. 54/1111 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4861 event pairs, 9 based on Foata normal form. 18/1086 useless extension candidates. Maximal degree in co-relation 1132. Up to 51 conditions per place. [2021-11-20 07:19:45,117 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 12 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2021-11-20 07:19:45,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 544 flow [2021-11-20 07:19:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:19:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:19:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2021-11-20 07:19:45,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2021-11-20 07:19:45,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2021-11-20 07:19:45,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2021-11-20 07:19:45,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:45,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2021-11-20 07:19:45,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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) [2021-11-20 07:19:45,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:45,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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) [2021-11-20 07:19:45,127 INFO L186 Difference]: Start difference. First operand has 185 places, 218 transitions, 767 flow. Second operand 3 states and 480 transitions. [2021-11-20 07:19:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 544 flow [2021-11-20 07:19:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 177 transitions, 522 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-11-20 07:19:45,137 INFO L242 Difference]: Finished difference. Result has 175 places, 175 transitions, 491 flow [2021-11-20 07:19:45,138 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=175, PETRI_TRANSITIONS=175} [2021-11-20 07:19:45,139 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 14 predicate places. [2021-11-20 07:19:45,140 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 491 flow [2021-11-20 07:19:45,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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) [2021-11-20 07:19:45,140 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:45,141 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:45,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:19:45,141 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 33999950, now seen corresponding path program 1 times [2021-11-20 07:19:45,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741318010] [2021-11-20 07:19:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:45,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:46,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:46,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741318010] [2021-11-20 07:19:46,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741318010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:46,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:46,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-20 07:19:46,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926890441] [2021-11-20 07:19:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:46,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 07:19:46,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 07:19:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-11-20 07:19:46,258 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2021-11-20 07:19:46,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 491 flow. Second operand has 24 states, 24 states have (on average 99.54166666666667) internal successors, (2389), 24 states have internal predecessors, (2389), 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) [2021-11-20 07:19:46,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:46,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2021-11-20 07:19:46,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:50,964 INFO L129 PetriNetUnfolder]: 1122/4498 cut-off events. [2021-11-20 07:19:50,964 INFO L130 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2021-11-20 07:19:50,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 4498 events. 1122/4498 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 31985 event pairs, 173 based on Foata normal form. 20/4368 useless extension candidates. Maximal degree in co-relation 5128. Up to 1458 conditions per place. [2021-11-20 07:19:51,023 INFO L132 encePairwiseOnDemand]: 139/176 looper letters, 249 selfloop transitions, 59 changer transitions 33/427 dead transitions. [2021-11-20 07:19:51,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 427 transitions, 1859 flow [2021-11-20 07:19:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-20 07:19:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-11-20 07:19:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4579 transitions. [2021-11-20 07:19:51,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5912964876033058 [2021-11-20 07:19:51,044 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4579 transitions. [2021-11-20 07:19:51,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4579 transitions. [2021-11-20 07:19:51,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:51,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4579 transitions. [2021-11-20 07:19:51,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 104.06818181818181) internal successors, (4579), 44 states have internal predecessors, (4579), 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) [2021-11-20 07:19:51,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 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) [2021-11-20 07:19:51,146 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 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) [2021-11-20 07:19:51,146 INFO L186 Difference]: Start difference. First operand has 175 places, 175 transitions, 491 flow. Second operand 44 states and 4579 transitions. [2021-11-20 07:19:51,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 427 transitions, 1859 flow [2021-11-20 07:19:51,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 427 transitions, 1855 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-20 07:19:51,169 INFO L242 Difference]: Finished difference. Result has 256 places, 230 transitions, 974 flow [2021-11-20 07:19:51,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=974, PETRI_PLACES=256, PETRI_TRANSITIONS=230} [2021-11-20 07:19:51,171 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 95 predicate places. [2021-11-20 07:19:51,184 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 230 transitions, 974 flow [2021-11-20 07:19:51,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 99.54166666666667) internal successors, (2389), 24 states have internal predecessors, (2389), 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) [2021-11-20 07:19:51,186 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:51,186 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:51,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:19:51,186 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1463024058, now seen corresponding path program 2 times [2021-11-20 07:19:51,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:51,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445522233] [2021-11-20 07:19:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:51,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:52,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:52,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445522233] [2021-11-20 07:19:52,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445522233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:52,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:52,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-11-20 07:19:52,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410845595] [2021-11-20 07:19:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:52,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 07:19:52,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 07:19:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-11-20 07:19:52,722 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 176 [2021-11-20 07:19:52,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 230 transitions, 974 flow. Second operand has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:19:52,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:52,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 176 [2021-11-20 07:19:52,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:58,782 INFO L129 PetriNetUnfolder]: 2885/10508 cut-off events. [2021-11-20 07:19:58,782 INFO L130 PetriNetUnfolder]: For 6923/6927 co-relation queries the response was YES. [2021-11-20 07:19:58,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24003 conditions, 10508 events. 2885/10508 cut-off events. For 6923/6927 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 79985 event pairs, 579 based on Foata normal form. 19/10328 useless extension candidates. Maximal degree in co-relation 15902. Up to 3487 conditions per place. [2021-11-20 07:19:58,931 INFO L132 encePairwiseOnDemand]: 138/176 looper letters, 328 selfloop transitions, 60 changer transitions 26/488 dead transitions. [2021-11-20 07:19:58,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 488 transitions, 2907 flow [2021-11-20 07:19:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-20 07:19:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-11-20 07:19:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2983 transitions. [2021-11-20 07:19:58,945 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5136019283746557 [2021-11-20 07:19:58,946 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2983 transitions. [2021-11-20 07:19:58,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2983 transitions. [2021-11-20 07:19:58,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:58,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2983 transitions. [2021-11-20 07:19:58,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 90.39393939393939) internal successors, (2983), 33 states have internal predecessors, (2983), 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) [2021-11-20 07:19:58,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 176.0) internal successors, (5984), 34 states have internal predecessors, (5984), 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) [2021-11-20 07:19:58,975 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 176.0) internal successors, (5984), 34 states have internal predecessors, (5984), 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) [2021-11-20 07:19:58,976 INFO L186 Difference]: Start difference. First operand has 256 places, 230 transitions, 974 flow. Second operand 33 states and 2983 transitions. [2021-11-20 07:19:58,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 488 transitions, 2907 flow [2021-11-20 07:19:59,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 488 transitions, 2895 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-11-20 07:19:59,029 INFO L242 Difference]: Finished difference. Result has 302 places, 265 transitions, 1447 flow [2021-11-20 07:19:59,030 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1447, PETRI_PLACES=302, PETRI_TRANSITIONS=265} [2021-11-20 07:19:59,031 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 141 predicate places. [2021-11-20 07:19:59,031 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 265 transitions, 1447 flow [2021-11-20 07:19:59,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:19:59,033 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:59,033 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:59,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:19:59,033 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:19:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1784091104, now seen corresponding path program 3 times [2021-11-20 07:19:59,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947557841] [2021-11-20 07:19:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:59,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:20:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:20:00,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:20:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947557841] [2021-11-20 07:20:00,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947557841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:20:00,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:20:00,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-11-20 07:20:00,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193771970] [2021-11-20 07:20:00,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:20:00,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 07:20:00,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:20:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 07:20:00,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-11-20 07:20:00,098 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 176 [2021-11-20 07:20:00,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 265 transitions, 1447 flow. Second operand has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:20:00,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:20:00,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 176 [2021-11-20 07:20:00,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:20:08,316 INFO L129 PetriNetUnfolder]: 3681/13432 cut-off events. [2021-11-20 07:20:08,316 INFO L130 PetriNetUnfolder]: For 12763/12778 co-relation queries the response was YES. [2021-11-20 07:20:08,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32405 conditions, 13432 events. 3681/13432 cut-off events. For 12763/12778 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 112580 event pairs, 636 based on Foata normal form. 23/13198 useless extension candidates. Maximal degree in co-relation 22934. Up to 3518 conditions per place. [2021-11-20 07:20:08,533 INFO L132 encePairwiseOnDemand]: 137/176 looper letters, 388 selfloop transitions, 139 changer transitions 51/652 dead transitions. [2021-11-20 07:20:08,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 652 transitions, 4428 flow [2021-11-20 07:20:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-20 07:20:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-11-20 07:20:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4227 transitions. [2021-11-20 07:20:08,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5110009671179884 [2021-11-20 07:20:08,544 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4227 transitions. [2021-11-20 07:20:08,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4227 transitions. [2021-11-20 07:20:08,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:20:08,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4227 transitions. [2021-11-20 07:20:08,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 89.93617021276596) internal successors, (4227), 47 states have internal predecessors, (4227), 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) [2021-11-20 07:20:08,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 176.0) internal successors, (8448), 48 states have internal predecessors, (8448), 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) [2021-11-20 07:20:08,580 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 176.0) internal successors, (8448), 48 states have internal predecessors, (8448), 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) [2021-11-20 07:20:08,580 INFO L186 Difference]: Start difference. First operand has 302 places, 265 transitions, 1447 flow. Second operand 47 states and 4227 transitions. [2021-11-20 07:20:08,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 652 transitions, 4428 flow [2021-11-20 07:20:08,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 652 transitions, 4363 flow, removed 12 selfloop flow, removed 14 redundant places. [2021-11-20 07:20:08,686 INFO L242 Difference]: Finished difference. Result has 353 places, 349 transitions, 2530 flow [2021-11-20 07:20:08,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2530, PETRI_PLACES=353, PETRI_TRANSITIONS=349} [2021-11-20 07:20:08,688 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 192 predicate places. [2021-11-20 07:20:08,688 INFO L470 AbstractCegarLoop]: Abstraction has has 353 places, 349 transitions, 2530 flow [2021-11-20 07:20:08,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:20:08,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:20:08,691 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:20:08,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:20:08,691 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:20:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:20:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash 842431566, now seen corresponding path program 4 times [2021-11-20 07:20:08,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:20:08,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378847596] [2021-11-20 07:20:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:20:08,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:20:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:20:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:20:10,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:20:10,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378847596] [2021-11-20 07:20:10,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378847596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:20:10,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:20:10,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-11-20 07:20:10,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796323206] [2021-11-20 07:20:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:20:10,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 07:20:10,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:20:10,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 07:20:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2021-11-20 07:20:10,274 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 176 [2021-11-20 07:20:10,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 349 transitions, 2530 flow. Second operand has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:20:10,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:20:10,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 176 [2021-11-20 07:20:10,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:20:20,999 INFO L129 PetriNetUnfolder]: 4445/16277 cut-off events. [2021-11-20 07:20:20,999 INFO L130 PetriNetUnfolder]: For 151110/151144 co-relation queries the response was YES. [2021-11-20 07:20:21,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58791 conditions, 16277 events. 4445/16277 cut-off events. For 151110/151144 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 142395 event pairs, 512 based on Foata normal form. 57/16036 useless extension candidates. Maximal degree in co-relation 54151. Up to 3145 conditions per place. [2021-11-20 07:20:21,352 INFO L132 encePairwiseOnDemand]: 139/176 looper letters, 346 selfloop transitions, 191 changer transitions 33/644 dead transitions. [2021-11-20 07:20:21,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 644 transitions, 6154 flow [2021-11-20 07:20:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 07:20:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-11-20 07:20:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4099 transitions. [2021-11-20 07:20:21,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5062994071146245 [2021-11-20 07:20:21,363 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4099 transitions. [2021-11-20 07:20:21,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4099 transitions. [2021-11-20 07:20:21,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:20:21,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4099 transitions. [2021-11-20 07:20:21,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 89.1086956521739) internal successors, (4099), 46 states have internal predecessors, (4099), 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) [2021-11-20 07:20:21,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 176.0) internal successors, (8272), 47 states have internal predecessors, (8272), 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) [2021-11-20 07:20:21,394 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 176.0) internal successors, (8272), 47 states have internal predecessors, (8272), 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) [2021-11-20 07:20:21,394 INFO L186 Difference]: Start difference. First operand has 353 places, 349 transitions, 2530 flow. Second operand 46 states and 4099 transitions. [2021-11-20 07:20:21,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 644 transitions, 6154 flow [2021-11-20 07:20:21,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 644 transitions, 6076 flow, removed 21 selfloop flow, removed 14 redundant places. [2021-11-20 07:20:21,657 INFO L242 Difference]: Finished difference. Result has 411 places, 387 transitions, 3571 flow [2021-11-20 07:20:21,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3571, PETRI_PLACES=411, PETRI_TRANSITIONS=387} [2021-11-20 07:20:21,659 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 250 predicate places. [2021-11-20 07:20:21,660 INFO L470 AbstractCegarLoop]: Abstraction has has 411 places, 387 transitions, 3571 flow [2021-11-20 07:20:21,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 83.48275862068965) internal successors, (2421), 29 states have internal predecessors, (2421), 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) [2021-11-20 07:20:21,661 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:20:21,662 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:20:21,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:20:21,662 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:20:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:20:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2102484045, now seen corresponding path program 1 times [2021-11-20 07:20:21,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:20:21,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246046701] [2021-11-20 07:20:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:20:21,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:20:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:20:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:20:22,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:20:22,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246046701] [2021-11-20 07:20:22,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246046701] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:20:22,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328431052] [2021-11-20 07:20:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:20:22,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:20:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:20:22,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:20:22,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:20:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:20:22,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 07:20:22,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:20:25,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-11-20 07:20:27,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2021-11-20 07:20:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:20:27,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:20:28,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-20 07:20:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:20:29,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328431052] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 07:20:29,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:20:29,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2021-11-20 07:20:29,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533376761] [2021-11-20 07:20:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:20:29,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 07:20:29,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:20:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 07:20:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4315, Unknown=0, NotChecked=0, Total=4556 [2021-11-20 07:20:29,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2021-11-20 07:20:29,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 387 transitions, 3571 flow. Second operand has 22 states, 22 states have (on average 100.63636363636364) internal successors, (2214), 22 states have internal predecessors, (2214), 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) [2021-11-20 07:20:29,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:20:29,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2021-11-20 07:20:29,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:20:44,023 INFO L129 PetriNetUnfolder]: 4691/18575 cut-off events. [2021-11-20 07:20:44,023 INFO L130 PetriNetUnfolder]: For 60428/60457 co-relation queries the response was YES. [2021-11-20 07:20:44,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54914 conditions, 18575 events. 4691/18575 cut-off events. For 60428/60457 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 170787 event pairs, 709 based on Foata normal form. 29/18131 useless extension candidates. Maximal degree in co-relation 52771. Up to 2814 conditions per place. [2021-11-20 07:20:44,418 INFO L132 encePairwiseOnDemand]: 143/176 looper letters, 328 selfloop transitions, 294 changer transitions 1/725 dead transitions. [2021-11-20 07:20:44,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 725 transitions, 7030 flow [2021-11-20 07:20:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-20 07:20:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-11-20 07:20:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 6634 transitions. [2021-11-20 07:20:44,432 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5798951048951049 [2021-11-20 07:20:44,433 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 6634 transitions. [2021-11-20 07:20:44,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 6634 transitions. [2021-11-20 07:20:44,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:20:44,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 6634 transitions. [2021-11-20 07:20:44,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 102.06153846153846) internal successors, (6634), 65 states have internal predecessors, (6634), 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) [2021-11-20 07:20:44,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 176.0) internal successors, (11616), 66 states have internal predecessors, (11616), 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) [2021-11-20 07:20:44,477 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 176.0) internal successors, (11616), 66 states have internal predecessors, (11616), 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) [2021-11-20 07:20:44,477 INFO L186 Difference]: Start difference. First operand has 411 places, 387 transitions, 3571 flow. Second operand 65 states and 6634 transitions. [2021-11-20 07:20:44,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 725 transitions, 7030 flow [2021-11-20 07:20:44,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 725 transitions, 6648 flow, removed 158 selfloop flow, removed 19 redundant places. [2021-11-20 07:20:44,787 INFO L242 Difference]: Finished difference. Result has 473 places, 546 transitions, 5651 flow [2021-11-20 07:20:44,788 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=3368, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=5651, PETRI_PLACES=473, PETRI_TRANSITIONS=546} [2021-11-20 07:20:44,790 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 312 predicate places. [2021-11-20 07:20:44,790 INFO L470 AbstractCegarLoop]: Abstraction has has 473 places, 546 transitions, 5651 flow [2021-11-20 07:20:44,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 100.63636363636364) internal successors, (2214), 22 states have internal predecessors, (2214), 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) [2021-11-20 07:20:44,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:20:44,791 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:20:44,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:20:44,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 07:20:44,992 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:20:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:20:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash -852325321, now seen corresponding path program 2 times [2021-11-20 07:20:44,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:20:44,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20951815] [2021-11-20 07:20:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:20:44,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:20:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:20:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:20:46,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:20:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20951815] [2021-11-20 07:20:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20951815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:20:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571917673] [2021-11-20 07:20:46,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 07:20:46,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:20:46,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:20:46,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:20:46,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:20:46,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 07:20:46,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 07:20:46,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 07:20:46,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:20:46,974 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 07:20:46,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 07:20:47,073 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 07:20:47,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-20 07:20:48,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-11-20 07:20:48,901 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 07:20:48,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 42 [2021-11-20 07:20:50,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2021-11-20 07:21:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:21:57,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:22:12,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2021-11-20 07:22:15,556 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-11-20 07:22:15,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2021-11-20 07:22:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 16 refuted. 1 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:22:15,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571917673] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:22:15,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:22:15,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 81 [2021-11-20 07:22:15,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777096849] [2021-11-20 07:22:15,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:22:15,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2021-11-20 07:22:15,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:22:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-11-20 07:22:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=6127, Unknown=38, NotChecked=0, Total=6480 [2021-11-20 07:22:15,603 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 176 [2021-11-20 07:22:15,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 546 transitions, 5651 flow. Second operand has 81 states, 81 states have (on average 84.1604938271605) internal successors, (6817), 81 states have internal predecessors, (6817), 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) [2021-11-20 07:22:15,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:22:15,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 176 [2021-11-20 07:22:15,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:23:28,797 INFO L129 PetriNetUnfolder]: 7018/25221 cut-off events. [2021-11-20 07:23:28,797 INFO L130 PetriNetUnfolder]: For 280411/280474 co-relation queries the response was YES. [2021-11-20 07:23:29,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104202 conditions, 25221 events. 7018/25221 cut-off events. For 280411/280474 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 244131 event pairs, 716 based on Foata normal form. 19/24778 useless extension candidates. Maximal degree in co-relation 85406. Up to 10076 conditions per place. [2021-11-20 07:23:29,588 INFO L132 encePairwiseOnDemand]: 136/176 looper letters, 705 selfloop transitions, 291 changer transitions 16/1086 dead transitions. [2021-11-20 07:23:29,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 1086 transitions, 12774 flow [2021-11-20 07:23:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-20 07:23:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-11-20 07:23:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 7385 transitions. [2021-11-20 07:23:29,603 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49952651515151514 [2021-11-20 07:23:29,603 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 7385 transitions. [2021-11-20 07:23:29,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 7385 transitions. [2021-11-20 07:23:29,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:23:29,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 7385 transitions. [2021-11-20 07:23:29,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 87.91666666666667) internal successors, (7385), 84 states have internal predecessors, (7385), 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) [2021-11-20 07:23:29,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 176.0) internal successors, (14960), 85 states have internal predecessors, (14960), 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) [2021-11-20 07:23:29,655 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 176.0) internal successors, (14960), 85 states have internal predecessors, (14960), 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) [2021-11-20 07:23:29,655 INFO L186 Difference]: Start difference. First operand has 473 places, 546 transitions, 5651 flow. Second operand 84 states and 7385 transitions. [2021-11-20 07:23:29,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 1086 transitions, 12774 flow [2021-11-20 07:23:30,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 1086 transitions, 11962 flow, removed 382 selfloop flow, removed 9 redundant places. [2021-11-20 07:23:30,490 INFO L242 Difference]: Finished difference. Result has 558 places, 704 transitions, 7302 flow [2021-11-20 07:23:30,491 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=5163, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=7302, PETRI_PLACES=558, PETRI_TRANSITIONS=704} [2021-11-20 07:23:30,492 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 397 predicate places. [2021-11-20 07:23:30,492 INFO L470 AbstractCegarLoop]: Abstraction has has 558 places, 704 transitions, 7302 flow [2021-11-20 07:23:30,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 84.1604938271605) internal successors, (6817), 81 states have internal predecessors, (6817), 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) [2021-11-20 07:23:30,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:23:30,496 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:23:30,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:23:30,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 07:23:30,715 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:23:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:23:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1088043544, now seen corresponding path program 1 times [2021-11-20 07:23:30,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:23:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994694815] [2021-11-20 07:23:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:23:30,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:23:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:23:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:23:32,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:23:32,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994694815] [2021-11-20 07:23:32,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994694815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:23:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816779524] [2021-11-20 07:23:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:23:32,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:23:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:23:32,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:23:32,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:23:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:23:32,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-20 07:23:32,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:23:33,362 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 07:23:33,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-20 07:23:33,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 07:23:33,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 07:23:35,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-11-20 07:23:36,779 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 07:23:36,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 40 [2021-11-20 07:23:38,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2021-11-20 07:23:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:23:38,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:24:37,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2021-11-20 07:24:41,833 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 07:24:41,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-11-20 07:24:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 11 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:24:43,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816779524] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:24:43,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:24:43,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 26] total 77 [2021-11-20 07:24:43,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661740487] [2021-11-20 07:24:43,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:24:43,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-20 07:24:43,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:24:43,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-20 07:24:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=5513, Unknown=29, NotChecked=0, Total=5852 [2021-11-20 07:24:43,950 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 176 [2021-11-20 07:24:43,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 704 transitions, 7302 flow. Second operand has 77 states, 77 states have (on average 84.24675324675324) internal successors, (6487), 77 states have internal predecessors, (6487), 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) [2021-11-20 07:24:43,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:24:43,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 176 [2021-11-20 07:24:43,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:26:02,950 INFO L129 PetriNetUnfolder]: 9337/34168 cut-off events. [2021-11-20 07:26:02,950 INFO L130 PetriNetUnfolder]: For 375950/376078 co-relation queries the response was YES. [2021-11-20 07:26:03,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148642 conditions, 34168 events. 9337/34168 cut-off events. For 375950/376078 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 355236 event pairs, 2537 based on Foata normal form. 47/33588 useless extension candidates. Maximal degree in co-relation 139040. Up to 13694 conditions per place. [2021-11-20 07:26:04,161 INFO L132 encePairwiseOnDemand]: 134/176 looper letters, 1168 selfloop transitions, 359 changer transitions 13/1614 dead transitions. [2021-11-20 07:26:04,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 1614 transitions, 20031 flow [2021-11-20 07:26:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-11-20 07:26:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-11-20 07:26:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 9123 transitions. [2021-11-20 07:26:04,175 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5032546337157988 [2021-11-20 07:26:04,175 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 9123 transitions. [2021-11-20 07:26:04,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 9123 transitions. [2021-11-20 07:26:04,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:26:04,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 9123 transitions. [2021-11-20 07:26:04,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 88.57281553398059) internal successors, (9123), 103 states have internal predecessors, (9123), 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) [2021-11-20 07:26:04,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 176.0) internal successors, (18304), 104 states have internal predecessors, (18304), 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) [2021-11-20 07:26:04,217 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 176.0) internal successors, (18304), 104 states have internal predecessors, (18304), 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) [2021-11-20 07:26:04,217 INFO L186 Difference]: Start difference. First operand has 558 places, 704 transitions, 7302 flow. Second operand 103 states and 9123 transitions. [2021-11-20 07:26:04,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 1614 transitions, 20031 flow [2021-11-20 07:26:05,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 1614 transitions, 18943 flow, removed 327 selfloop flow, removed 25 redundant places. [2021-11-20 07:26:05,978 INFO L242 Difference]: Finished difference. Result has 695 places, 987 transitions, 11447 flow [2021-11-20 07:26:05,980 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=6685, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=11447, PETRI_PLACES=695, PETRI_TRANSITIONS=987} [2021-11-20 07:26:05,980 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 534 predicate places. [2021-11-20 07:26:05,981 INFO L470 AbstractCegarLoop]: Abstraction has has 695 places, 987 transitions, 11447 flow [2021-11-20 07:26:05,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 84.24675324675324) internal successors, (6487), 77 states have internal predecessors, (6487), 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) [2021-11-20 07:26:05,982 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:26:05,983 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:06,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-20 07:26:06,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 07:26:06,209 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:26:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -766994345, now seen corresponding path program 1 times [2021-11-20 07:26:06,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:06,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786116137] [2021-11-20 07:26:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:06,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:26:06,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:06,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786116137] [2021-11-20 07:26:06,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786116137] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:06,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404581877] [2021-11-20 07:26:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:06,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:06,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:06,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 07:26:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:06,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 07:26:06,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:26:07,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:26:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:26:08,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404581877] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:26:08,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:26:08,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2021-11-20 07:26:08,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124817413] [2021-11-20 07:26:08,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:26:08,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 07:26:08,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:08,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 07:26:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:26:08,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-11-20 07:26:08,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 987 transitions, 11447 flow. Second operand has 16 states, 16 states have (on average 151.3125) internal successors, (2421), 16 states have internal predecessors, (2421), 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) [2021-11-20 07:26:08,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:26:08,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-11-20 07:26:08,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:26:26,018 INFO L129 PetriNetUnfolder]: 1903/22257 cut-off events. [2021-11-20 07:26:26,018 INFO L130 PetriNetUnfolder]: For 114537/115017 co-relation queries the response was YES. [2021-11-20 07:26:26,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72893 conditions, 22257 events. 1903/22257 cut-off events. For 114537/115017 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 243923 event pairs, 577 based on Foata normal form. 100/21674 useless extension candidates. Maximal degree in co-relation 71966. Up to 1372 conditions per place. [2021-11-20 07:26:27,068 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 166 selfloop transitions, 235 changer transitions 1/1089 dead transitions. [2021-11-20 07:26:27,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 1089 transitions, 13345 flow [2021-11-20 07:26:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 07:26:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-11-20 07:26:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3346 transitions. [2021-11-20 07:26:27,072 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8641528925619835 [2021-11-20 07:26:27,073 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3346 transitions. [2021-11-20 07:26:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3346 transitions. [2021-11-20 07:26:27,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:26:27,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3346 transitions. [2021-11-20 07:26:27,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 152.0909090909091) internal successors, (3346), 22 states have internal predecessors, (3346), 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) [2021-11-20 07:26:27,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 176.0) internal successors, (4048), 23 states have internal predecessors, (4048), 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) [2021-11-20 07:26:27,087 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 176.0) internal successors, (4048), 23 states have internal predecessors, (4048), 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) [2021-11-20 07:26:27,088 INFO L186 Difference]: Start difference. First operand has 695 places, 987 transitions, 11447 flow. Second operand 22 states and 3346 transitions. [2021-11-20 07:26:27,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 1089 transitions, 13345 flow [2021-11-20 07:26:28,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 1089 transitions, 13021 flow, removed 145 selfloop flow, removed 17 redundant places. [2021-11-20 07:26:28,323 INFO L242 Difference]: Finished difference. Result has 700 places, 1016 transitions, 12160 flow [2021-11-20 07:26:28,324 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=11044, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12160, PETRI_PLACES=700, PETRI_TRANSITIONS=1016} [2021-11-20 07:26:28,325 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 539 predicate places. [2021-11-20 07:26:28,325 INFO L470 AbstractCegarLoop]: Abstraction has has 700 places, 1016 transitions, 12160 flow [2021-11-20 07:26:28,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 151.3125) internal successors, (2421), 16 states have internal predecessors, (2421), 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) [2021-11-20 07:26:28,325 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:26:28,326 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:28,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:28,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:28,527 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-20 07:26:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1174826860, now seen corresponding path program 1 times [2021-11-20 07:26:28,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:28,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44332039] [2021-11-20 07:26:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:28,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:30,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44332039] [2021-11-20 07:26:30,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44332039] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:30,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100785611] [2021-11-20 07:26:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:30,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:30,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:30,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71af4d0a-ef4c-4bde-9665-c055d261f569/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 07:26:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:30,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-20 07:26:30,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:31,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-11-20 07:26:33,433 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 07:26:33,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 49 [2021-11-20 07:26:35,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2021-11-20 07:26:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:35,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:26:39,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| |c_t1Thread1of1ForFork0_get_top_#res#1|))) is different from false [2021-11-20 07:26:59,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) is different from false [2021-11-20 07:27:22,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-20 07:27:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-20 07:27:23,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100785611] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:27:23,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:27:23,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 85 [2021-11-20 07:27:23,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719236097] [2021-11-20 07:27:23,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:27:23,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2021-11-20 07:27:23,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-11-20 07:27:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=6516, Unknown=9, NotChecked=326, Total=7140 [2021-11-20 07:27:23,595 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2021-11-20 07:27:23,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 1016 transitions, 12160 flow. Second operand has 85 states, 85 states have (on average 100.55294117647058) internal successors, (8547), 85 states have internal predecessors, (8547), 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) [2021-11-20 07:27:23,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:27:23,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2021-11-20 07:27:23,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:27:34,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select (store .cse7 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse5 (select .cse7 0)) (.cse2 (<= 5 .cse6)) (.cse1 (< .cse6 5))) (and (<= 0 .cse0) (<= 1 c_~top~0) .cse1 (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse4) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (<= .cse4 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse5 4) (<= 4 (* 4 c_~top~0)) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:27:36,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-20 07:27:41,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse1 (select (store .cse3 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse2 (select .cse3 0))) (and (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse1) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= .cse1 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (<= 4 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0)))) is different from false [2021-11-20 07:28:06,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse3 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 4)))) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8)))) (.cse4 (select .cse6 0)) (.cse2 (<= 5 .cse5)) (.cse1 (< .cse5 5))) (and (<= 0 .cse0) .cse1 (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (<= .cse4 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse4) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:28:14,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))))) is different from false [2021-11-20 07:28:17,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (<= 5 .cse3)) (.cse0 (< .cse3 5))) (and .cse0 (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse2 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse1) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:28:18,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (<= 5 .cse3)) (.cse0 (< .cse3 5))) (and .cse0 (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse2 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse1) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:28:27,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-20 07:28:49,546 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296) 4294967294)) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) is different from false [2021-11-20 07:30:09,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse12 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (select |c_#memory_int| 5)) (.cse13 (* c_~top~0 4)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse6 (select (store .cse11 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse2 (select .cse10 (+ .cse13 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse5 (select .cse12 (+ |c_~#arr~0.offset| .cse13 (- 4)))) (.cse7 (select .cse12 (+ |c_~#arr~0.offset| .cse13))) (.cse8 (select .cse11 0)) (.cse3 (select .cse10 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse4 (<= 5 .cse9)) (.cse1 (< .cse9 5))) (and (<= 0 .cse0) (<= 1 c_~top~0) .cse1 (< (div .cse2 (- 4294967296)) (+ (div (+ 4 (* .cse2 (- 1))) 4294967296) 1)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse4 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse3 4294967296) (< .cse5 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse6) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* .cse5 (- 1)) 4) 4294967296) 1)) (<= .cse6 4) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* |c_t2Thread1of1ForFork1_pop_#res#1| (- 1)) 4) 4294967296)) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< .cse2 4294967296) (< .cse7 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (<= 0 .cse8) (<= 0 .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse7) (< (div .cse7 (- 4294967296)) (+ (div (+ (* .cse7 (- 1)) 4) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse8 4) (<= 4 (* 4 c_~top~0)) (<= 0 .cse3) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:30:11,994 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse10 (select |c_#memory_int| 5)) (.cse11 (* c_~top~0 4)) (.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse6 (select (store .cse12 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse4 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse11 (- 4)))) (.cse5 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) 0)) (.cse8 (select .cse12 0)) (.cse7 (select .cse10 (+ .cse11 (- 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse2 (select .cse10 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse3 (<= 5 .cse9)) (.cse1 (< .cse9 5))) (and (<= 0 .cse0) (<= 1 c_~top~0) .cse1 (<= 0 |c_t2Thread1of1ForFork1_get_top_#res#1|) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse2 4294967296) (< .cse4 4294967296) (<= .cse5 4) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse6) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* .cse4 (- 1)) 4) 4294967296) 1)) (<= .cse6 4) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* |c_t2Thread1of1ForFork1_pop_#res#1| (- 1)) 4) 4294967296)) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t2Thread1of1ForFork1_pop_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_t2Thread1of1ForFork1_get_top_#res#1| 0) (<= 0 .cse7) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse8) (<= 0 .cse4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse5) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse8 4) (< (div .cse7 (- 4294967296)) (+ (div (+ (* .cse7 (- 1)) 4) 4294967296) 1)) (<= 4 (* 4 c_~top~0)) (< .cse7 4294967296) (<= 0 .cse2) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:30:13,829 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_#in~stack#1.base|) (+ |c_t2Thread1of1ForFork1_pop_#in~stack#1.offset| (* c_~top~0 4) (- 4))) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) is different from false [2021-11-20 07:30:15,675 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (or (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)))) is different from false [2021-11-20 07:30:20,927 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse3 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8)))) (.cse2 (<= 5 .cse4)) (.cse1 (< .cse4 5))) (and (<= 0 .cse0) .cse1 (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-20 07:30:32,110 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_33| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_44| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_33|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_44| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_33| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) is different from false [2021-11-20 07:31:33,327 WARN L227 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)