./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:50:02,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:50:02,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:50:02,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:50:02,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:50:02,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:50:02,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:50:02,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:50:02,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:50:02,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:50:02,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:50:02,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:50:02,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:50:02,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:50:02,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:50:02,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:50:02,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:50:02,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:50:02,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:50:02,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:50:02,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:50:02,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:50:02,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:50:02,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:50:02,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:50:02,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:50:02,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:50:02,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:50:02,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:50:02,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:50:02,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:50:02,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:50:02,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:50:02,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:50:02,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:50:02,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:50:02,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:50:02,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:50:02,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:50:02,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:50:02,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:50:02,453 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:50:02,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:50:02,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:50:02,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:50:02,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:50:02,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:50:02,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:50:02,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:50:02,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:50:02,499 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:50:02,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:50:02,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:50:02,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:50:02,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:50:02,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:50:02,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:50:02,502 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:50:02,502 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:50:02,502 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:50:02,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:50:02,503 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:50:02,503 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:50:02,503 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:50:02,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:50:02,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:50:02,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:50:02,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:50:02,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:50:02,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:50:02,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:50:02,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:50:02,506 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_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/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_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-20 11:50:02,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:50:02,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:50:02,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:50:02,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:50:02,833 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:50:02,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 11:50:06,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:50:06,512 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:50:06,513 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 11:50:06,529 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/data/022e0ca90/a8ca78f0c97748e4ad7ae0c08251114f/FLAGab58513cd [2022-11-20 11:50:06,546 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/data/022e0ca90/a8ca78f0c97748e4ad7ae0c08251114f [2022-11-20 11:50:06,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:50:06,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:50:06,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:06,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:50:06,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:50:06,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:06" (1/1) ... [2022-11-20 11:50:06,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181052fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:06, skipping insertion in model container [2022-11-20 11:50:06,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:06" (1/1) ... [2022-11-20 11:50:06,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:50:06,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:50:07,197 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 11:50:07,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 11:50:07,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:07,223 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:50:07,274 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 11:50:07,277 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 11:50:07,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:07,356 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:50:07,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07 WrapperNode [2022-11-20 11:50:07,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:07,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:07,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:50:07,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:50:07,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,425 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-20 11:50:07,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:07,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:50:07,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:50:07,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:50:07,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,460 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:50:07,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:50:07,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:50:07,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:50:07,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (1/1) ... [2022-11-20 11:50:07,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:50:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:07,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:50:07,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:50:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 11:50:07,546 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 11:50:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 11:50:07,546 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 11:50:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:50:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:50:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:50:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:50:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 11:50:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:50:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:50:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:50:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:50:07,550 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:50:07,831 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:50:07,834 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:50:08,559 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:50:08,571 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:50:08,572 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:50:08,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:08 BoogieIcfgContainer [2022-11-20 11:50:08,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:50:08,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:50:08,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:50:08,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:50:08,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:50:06" (1/3) ... [2022-11-20 11:50:08,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5632f7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:08, skipping insertion in model container [2022-11-20 11:50:08,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:07" (2/3) ... [2022-11-20 11:50:08,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5632f7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:08, skipping insertion in model container [2022-11-20 11:50:08,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:08" (3/3) ... [2022-11-20 11:50:08,586 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-20 11:50:08,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:50:08,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-20 11:50:08,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:50:08,799 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 11:50:08,842 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:50:08,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-20 11:50:08,861 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-20 11:50:08,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-20 11:50:09,042 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-20 11:50:09,042 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 11:50:09,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 675 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-20 11:50:09,072 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-20 11:50:32,936 INFO L134 LiptonReduction]: Checked pairs total: 59291 [2022-11-20 11:50:32,936 INFO L136 LiptonReduction]: Total number of compositions: 457 [2022-11-20 11:50:32,947 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-20 11:50:33,205 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:33,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:50:33,245 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25eddf24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:50:33,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-20 11:50:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 11:50:33,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:33,269 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 11:50:33,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2022-11-20 11:50:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:33,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801807351] [2022-11-20 11:50:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801807351] [2022-11-20 11:50:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801807351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:33,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 11:50:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723604472] [2022-11-20 11:50:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:33,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:50:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:50:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:50:33,521 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:33,746 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-20 11:50:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:50:33,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1 [2022-11-20 11:50:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:33,792 INFO L225 Difference]: With dead ends: 2668 [2022-11-20 11:50:33,793 INFO L226 Difference]: Without dead ends: 2668 [2022-11-20 11:50:33,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:50:33,797 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:33,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-20 11:50:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-20 11:50:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-20 11:50:33,977 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-20 11:50:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:33,978 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-20 11:50:33,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-20 11:50:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:50:33,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:33,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:50:33,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:50:33,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1279544, now seen corresponding path program 1 times [2022-11-20 11:50:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:33,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686037047] [2022-11-20 11:50:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686037047] [2022-11-20 11:50:34,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686037047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:34,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:34,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438654957] [2022-11-20 11:50:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:34,336 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:34,488 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-20 11:50:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-11-20 11:50:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:34,511 INFO L225 Difference]: With dead ends: 2618 [2022-11-20 11:50:34,511 INFO L226 Difference]: Without dead ends: 2618 [2022-11-20 11:50:34,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:34,513 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:34,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-20 11:50:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-20 11:50:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-20 11:50:34,691 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-20 11:50:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:34,693 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-20 11:50:34,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-20 11:50:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:50:34,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:34,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:50:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:50:34,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1279543, now seen corresponding path program 1 times [2022-11-20 11:50:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:34,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848655201] [2022-11-20 11:50:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:34,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848655201] [2022-11-20 11:50:34,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848655201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:34,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:34,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915412599] [2022-11-20 11:50:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:34,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:34,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:34,783 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:34,940 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-20 11:50:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-11-20 11:50:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:34,962 INFO L225 Difference]: With dead ends: 2568 [2022-11-20 11:50:34,963 INFO L226 Difference]: Without dead ends: 2568 [2022-11-20 11:50:34,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:34,964 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:34,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-20 11:50:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-20 11:50:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-20 11:50:35,065 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-20 11:50:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:35,066 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-20 11:50:35,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-20 11:50:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:50:35,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:35,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:35,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:50:35,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669010, now seen corresponding path program 1 times [2022-11-20 11:50:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:35,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433544675] [2022-11-20 11:50:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:35,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433544675] [2022-11-20 11:50:35,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433544675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:35,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:35,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545421962] [2022-11-20 11:50:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:50:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:50:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:35,222 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:35,362 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-11-20 11:50:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-11-20 11:50:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:35,376 INFO L225 Difference]: With dead ends: 1952 [2022-11-20 11:50:35,377 INFO L226 Difference]: Without dead ends: 1952 [2022-11-20 11:50:35,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:35,380 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:35,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-20 11:50:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-20 11:50:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1760 states have (on average 3.1295454545454544) internal successors, (5508), 1951 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-11-20 11:50:35,456 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-11-20 11:50:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:35,456 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-11-20 11:50:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-11-20 11:50:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:50:35,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:35,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:35,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:50:35,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669011, now seen corresponding path program 1 times [2022-11-20 11:50:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:35,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313490729] [2022-11-20 11:50:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:35,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313490729] [2022-11-20 11:50:35,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313490729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:35,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:35,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327129558] [2022-11-20 11:50:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:35,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:50:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:50:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:35,807 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:35,941 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-11-20 11:50:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-11-20 11:50:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:35,957 INFO L225 Difference]: With dead ends: 1336 [2022-11-20 11:50:35,957 INFO L226 Difference]: Without dead ends: 1336 [2022-11-20 11:50:35,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:35,959 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:35,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 4 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-20 11:50:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-11-20 11:50:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1240 states have (on average 2.8532258064516127) internal successors, (3538), 1335 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-11-20 11:50:36,000 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-11-20 11:50:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:36,001 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-11-20 11:50:36,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-11-20 11:50:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:50:36,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:36,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:36,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:50:36,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601986, now seen corresponding path program 1 times [2022-11-20 11:50:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:36,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534177512] [2022-11-20 11:50:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:36,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534177512] [2022-11-20 11:50:36,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534177512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:36,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:36,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:36,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185995730] [2022-11-20 11:50:36,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:36,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:36,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:36,197 INFO L87 Difference]: Start difference. First operand 1336 states and 3538 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:36,309 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-11-20 11:50:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2022-11-20 11:50:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:36,318 INFO L225 Difference]: With dead ends: 1190 [2022-11-20 11:50:36,318 INFO L226 Difference]: Without dead ends: 1190 [2022-11-20 11:50:36,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:36,319 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:36,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-20 11:50:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-20 11:50:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1120 states have (on average 2.8232142857142857) internal successors, (3162), 1189 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-11-20 11:50:36,358 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-11-20 11:50:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:36,359 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-11-20 11:50:36,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-11-20 11:50:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:50:36,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:36,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:36,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:50:36,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601987, now seen corresponding path program 1 times [2022-11-20 11:50:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:36,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997566926] [2022-11-20 11:50:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:36,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997566926] [2022-11-20 11:50:36,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997566926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:36,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:36,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:36,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755359816] [2022-11-20 11:50:36,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:36,600 INFO L87 Difference]: Start difference. First operand 1190 states and 3162 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:36,702 INFO L93 Difference]: Finished difference Result 1010 states and 2698 transitions. [2022-11-20 11:50:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:36,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2022-11-20 11:50:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:36,709 INFO L225 Difference]: With dead ends: 1010 [2022-11-20 11:50:36,709 INFO L226 Difference]: Without dead ends: 1010 [2022-11-20 11:50:36,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:36,711 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:36,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-20 11:50:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2022-11-20 11:50:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 968 states have (on average 2.7871900826446283) internal successors, (2698), 1009 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2698 transitions. [2022-11-20 11:50:36,758 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2698 transitions. Word has length 5 [2022-11-20 11:50:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:36,759 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2698 transitions. [2022-11-20 11:50:36,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2698 transitions. [2022-11-20 11:50:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:50:36,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:36,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:36,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:50:36,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1229602043, now seen corresponding path program 1 times [2022-11-20 11:50:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277092663] [2022-11-20 11:50:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:37,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:37,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277092663] [2022-11-20 11:50:37,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277092663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:37,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:37,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5036554] [2022-11-20 11:50:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:37,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:37,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:37,395 INFO L87 Difference]: Start difference. First operand 1010 states and 2698 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:37,525 INFO L93 Difference]: Finished difference Result 1016 states and 2711 transitions. [2022-11-20 11:50:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:37,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2022-11-20 11:50:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:37,538 INFO L225 Difference]: With dead ends: 1016 [2022-11-20 11:50:37,543 INFO L226 Difference]: Without dead ends: 1016 [2022-11-20 11:50:37,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:37,545 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:37,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-20 11:50:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2022-11-20 11:50:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-20 11:50:37,582 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-20 11:50:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:37,582 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-20 11:50:37,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-20 11:50:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:50:37,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:37,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:50:37,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:50:37,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash -534759366, now seen corresponding path program 1 times [2022-11-20 11:50:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:37,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809742590] [2022-11-20 11:50:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809742590] [2022-11-20 11:50:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809742590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:38,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:38,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634568887] [2022-11-20 11:50:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:50:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:50:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:38,334 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:38,537 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-20 11:50:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:50:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-11-20 11:50:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:38,545 INFO L225 Difference]: With dead ends: 1286 [2022-11-20 11:50:38,545 INFO L226 Difference]: Without dead ends: 1286 [2022-11-20 11:50:38,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:38,547 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:38,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-20 11:50:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-20 11:50:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-20 11:50:38,583 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-20 11:50:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:38,584 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-20 11:50:38,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-20 11:50:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:50:38,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:38,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:50:38,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:50:38,585 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -537040297, now seen corresponding path program 1 times [2022-11-20 11:50:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897797979] [2022-11-20 11:50:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897797979] [2022-11-20 11:50:38,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897797979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:38,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:38,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469061474] [2022-11-20 11:50:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:38,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:50:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:50:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:38,839 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:39,064 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-20 11:50:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:50:39,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-11-20 11:50:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:39,071 INFO L225 Difference]: With dead ends: 1280 [2022-11-20 11:50:39,071 INFO L226 Difference]: Without dead ends: 1280 [2022-11-20 11:50:39,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:50:39,072 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:39,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-20 11:50:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-20 11:50:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-20 11:50:39,106 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-20 11:50:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:39,106 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-20 11:50:39,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-20 11:50:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:50:39,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:39,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:39,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:50:39,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1494000732, now seen corresponding path program 1 times [2022-11-20 11:50:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:39,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210197483] [2022-11-20 11:50:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:39,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210197483] [2022-11-20 11:50:39,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210197483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:39,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:39,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843299573] [2022-11-20 11:50:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:39,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:39,183 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:39,311 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-20 11:50:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-11-20 11:50:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:39,314 INFO L225 Difference]: With dead ends: 434 [2022-11-20 11:50:39,314 INFO L226 Difference]: Without dead ends: 426 [2022-11-20 11:50:39,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:39,315 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:39,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-20 11:50:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-20 11:50:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-20 11:50:39,328 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-20 11:50:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:39,328 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-20 11:50:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-20 11:50:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:50:39,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:39,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:39,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:50:39,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 740251664, now seen corresponding path program 1 times [2022-11-20 11:50:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81887832] [2022-11-20 11:50:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:39,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81887832] [2022-11-20 11:50:39,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81887832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:39,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:39,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:50:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002966937] [2022-11-20 11:50:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:39,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:39,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:39,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:39,460 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:39,542 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-20 11:50:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:39,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2022-11-20 11:50:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:39,545 INFO L225 Difference]: With dead ends: 380 [2022-11-20 11:50:39,545 INFO L226 Difference]: Without dead ends: 380 [2022-11-20 11:50:39,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:39,546 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:39,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-20 11:50:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-20 11:50:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-20 11:50:39,558 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-20 11:50:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:39,558 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-20 11:50:39,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-20 11:50:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:50:39,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:39,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:39,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:50:39,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 740251665, now seen corresponding path program 1 times [2022-11-20 11:50:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:39,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135760002] [2022-11-20 11:50:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135760002] [2022-11-20 11:50:39,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135760002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:39,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:50:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759222932] [2022-11-20 11:50:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:39,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:50:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:50:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:50:39,905 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:40,097 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-20 11:50:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:50:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2022-11-20 11:50:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:40,099 INFO L225 Difference]: With dead ends: 390 [2022-11-20 11:50:40,100 INFO L226 Difference]: Without dead ends: 390 [2022-11-20 11:50:40,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:40,100 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:40,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-20 11:50:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-20 11:50:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 2.4010695187165774) internal successors, (898), 383 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-20 11:50:40,111 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-20 11:50:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:40,112 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-20 11:50:40,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-20 11:50:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:50:40,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:40,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:40,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:50:40,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1341499408, now seen corresponding path program 1 times [2022-11-20 11:50:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:40,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288331968] [2022-11-20 11:50:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288331968] [2022-11-20 11:50:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288331968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:40,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:40,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759235546] [2022-11-20 11:50:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:40,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:50:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:50:40,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:40,397 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:40,534 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-20 11:50:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:50:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-11-20 11:50:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:40,537 INFO L225 Difference]: With dead ends: 475 [2022-11-20 11:50:40,537 INFO L226 Difference]: Without dead ends: 475 [2022-11-20 11:50:40,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:50:40,538 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:40,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-20 11:50:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-20 11:50:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-20 11:50:40,554 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-20 11:50:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:40,554 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-20 11:50:40,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-20 11:50:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:50:40,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:40,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:40,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:50:40,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1363188893, now seen corresponding path program 1 times [2022-11-20 11:50:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:40,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648103412] [2022-11-20 11:50:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:41,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648103412] [2022-11-20 11:50:41,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648103412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:41,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:41,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:50:41,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43492870] [2022-11-20 11:50:41,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:41,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:41,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:41,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:41,482 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:41,860 INFO L93 Difference]: Finished difference Result 624 states and 1427 transitions. [2022-11-20 11:50:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-11-20 11:50:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:41,863 INFO L225 Difference]: With dead ends: 624 [2022-11-20 11:50:41,863 INFO L226 Difference]: Without dead ends: 624 [2022-11-20 11:50:41,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:41,864 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:41,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 30 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:50:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-20 11:50:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 519. [2022-11-20 11:50:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 509 states have (on average 2.3634577603143416) internal successors, (1203), 518 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1203 transitions. [2022-11-20 11:50:41,881 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1203 transitions. Word has length 13 [2022-11-20 11:50:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:41,881 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1203 transitions. [2022-11-20 11:50:41,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1203 transitions. [2022-11-20 11:50:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:50:41,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:41,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:50:41,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 949156331, now seen corresponding path program 2 times [2022-11-20 11:50:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521252432] [2022-11-20 11:50:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:42,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521252432] [2022-11-20 11:50:42,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521252432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:42,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:42,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:50:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265021492] [2022-11-20 11:50:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:42,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:42,633 INFO L87 Difference]: Start difference. First operand 519 states and 1203 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:42,943 INFO L93 Difference]: Finished difference Result 563 states and 1303 transitions. [2022-11-20 11:50:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:42,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-11-20 11:50:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:42,946 INFO L225 Difference]: With dead ends: 563 [2022-11-20 11:50:42,947 INFO L226 Difference]: Without dead ends: 563 [2022-11-20 11:50:42,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:42,948 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:42,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-20 11:50:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 497. [2022-11-20 11:50:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 487 states have (on average 2.3675564681724848) internal successors, (1153), 496 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1153 transitions. [2022-11-20 11:50:42,964 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1153 transitions. Word has length 13 [2022-11-20 11:50:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:42,964 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 1153 transitions. [2022-11-20 11:50:42,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1153 transitions. [2022-11-20 11:50:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:50:42,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:42,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:42,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:50:42,966 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1723774363, now seen corresponding path program 3 times [2022-11-20 11:50:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:42,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307630928] [2022-11-20 11:50:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:43,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:43,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307630928] [2022-11-20 11:50:43,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307630928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:43,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:43,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:50:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776463570] [2022-11-20 11:50:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:43,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:43,691 INFO L87 Difference]: Start difference. First operand 497 states and 1153 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:43,964 INFO L93 Difference]: Finished difference Result 552 states and 1267 transitions. [2022-11-20 11:50:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-11-20 11:50:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:43,967 INFO L225 Difference]: With dead ends: 552 [2022-11-20 11:50:43,967 INFO L226 Difference]: Without dead ends: 552 [2022-11-20 11:50:43,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:43,968 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:43,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-20 11:50:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 464. [2022-11-20 11:50:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 454 states have (on average 2.350220264317181) internal successors, (1067), 463 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-20 11:50:43,982 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 13 [2022-11-20 11:50:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:43,982 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-20 11:50:43,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-20 11:50:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:50:43,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:43,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:50:43,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342350, now seen corresponding path program 1 times [2022-11-20 11:50:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:43,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300667396] [2022-11-20 11:50:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300667396] [2022-11-20 11:50:44,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300667396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468035065] [2022-11-20 11:50:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:44,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:44,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:50:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:45,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 11:50:45,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:45,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:45,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:45,291 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:50:45,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:50:45,310 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:50:45,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:50:45,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:50:45,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:50:45,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:50:46,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:46,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:50:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:46,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:46,186 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:50:46,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:46,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-20 11:50:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:57,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468035065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:57,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:57,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-11-20 11:50:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525658258] [2022-11-20 11:50:57,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:57,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 11:50:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 11:50:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=413, Unknown=19, NotChecked=44, Total=600 [2022-11-20 11:50:57,537 INFO L87 Difference]: Start difference. First operand 464 states and 1067 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:58,369 INFO L93 Difference]: Finished difference Result 466 states and 1072 transitions. [2022-11-20 11:50:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:50:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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) Word has length 13 [2022-11-20 11:50:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:58,373 INFO L225 Difference]: With dead ends: 466 [2022-11-20 11:50:58,373 INFO L226 Difference]: Without dead ends: 466 [2022-11-20 11:50:58,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=160, Invalid=527, Unknown=19, NotChecked=50, Total=756 [2022-11-20 11:50:58,375 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:58,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 57 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 383 Unchecked, 0.4s Time] [2022-11-20 11:50:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-20 11:50:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2022-11-20 11:50:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 2.3516483516483517) internal successors, (1070), 464 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1070 transitions. [2022-11-20 11:50:58,393 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1070 transitions. Word has length 13 [2022-11-20 11:50:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:58,396 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1070 transitions. [2022-11-20 11:50:58,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1070 transitions. [2022-11-20 11:50:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:50:58,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:58,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:58,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:58,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 11:50:58,605 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:50:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash 648121009, now seen corresponding path program 1 times [2022-11-20 11:50:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:58,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598548889] [2022-11-20 11:50:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598548889] [2022-11-20 11:51:00,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598548889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007695273] [2022-11-20 11:51:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:00,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:00,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:51:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:00,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-20 11:51:00,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:00,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-20 11:51:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:00,308 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:51:00,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-20 11:51:00,347 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:51:00,347 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:51:00,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:51:00,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:51:00,628 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 11:51:00,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 11:51:00,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:00,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-20 11:51:01,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-20 11:51:01,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:01,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-20 11:51:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:01,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:01,237 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:51:01,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:51:01,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:01,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-20 11:51:15,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| Int) (v_ArrVal_660 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660))) (let ((.cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| 4) |c_~#queue~0.offset|)) (.cse5 (select .cse1 |c_~#queue~0.base|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_663 Int) (v_ArrVal_661 Int)) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_661))) (store (store .cse2 .cse3 v_ArrVal_663) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| (select .cse5 .cse4))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| Int) (v_ArrVal_660 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660))) (let ((.cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| 4) |c_~#queue~0.offset|)) (.cse9 (select .cse7 |c_~#queue~0.base|))) (or (not (<= 0 .cse6)) (forall ((v_prenex_4 Int) (v_ArrVal_661 Int) (v_prenex_3 (Array Int Int))) (< (* 4 (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse6 v_ArrVal_661))) (store (store .cse8 .cse3 v_prenex_4) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_prenex_3) |c_~#queue~0.base|) .cse4)) 89)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| (select .cse9 .cse4))))))))) is different from false [2022-11-20 11:51:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:15,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007695273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:15,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:15,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-11-20 11:51:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352058982] [2022-11-20 11:51:15,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:15,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:51:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:51:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=12, NotChecked=138, Total=702 [2022-11-20 11:51:15,779 INFO L87 Difference]: Start difference. First operand 465 states and 1070 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:25,474 INFO L93 Difference]: Finished difference Result 903 states and 2089 transitions. [2022-11-20 11:51:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:51:25,475 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 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) Word has length 14 [2022-11-20 11:51:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:25,478 INFO L225 Difference]: With dead ends: 903 [2022-11-20 11:51:25,478 INFO L226 Difference]: Without dead ends: 903 [2022-11-20 11:51:25,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=184, Invalid=740, Unknown=18, NotChecked=180, Total=1122 [2022-11-20 11:51:25,479 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 234 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:25,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 137 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 726 Invalid, 0 Unknown, 873 Unchecked, 1.2s Time] [2022-11-20 11:51:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-11-20 11:51:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 583. [2022-11-20 11:51:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 573 states have (on average 2.413612565445026) internal successors, (1383), 582 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1383 transitions. [2022-11-20 11:51:25,504 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1383 transitions. Word has length 14 [2022-11-20 11:51:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:25,504 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1383 transitions. [2022-11-20 11:51:25,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1383 transitions. [2022-11-20 11:51:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:51:25,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:25,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:25,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:25,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:25,712 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:51:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1154017767, now seen corresponding path program 2 times [2022-11-20 11:51:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:25,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788790315] [2022-11-20 11:51:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788790315] [2022-11-20 11:51:26,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788790315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719546085] [2022-11-20 11:51:26,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:51:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:26,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:26,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:51:27,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:51:27,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:51:27,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 11:51:27,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:27,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:27,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:27,152 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:51:27,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:51:27,183 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:51:27,183 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:51:27,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:51:27,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:51:27,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:51:27,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:51:28,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:28,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:51:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:28,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:28,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 11:51:28,298 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) 85)))) is different from false [2022-11-20 11:51:28,324 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse1) 4) 85)))) is different from false [2022-11-20 11:51:34,657 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_760 Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_760) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_760 Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_760) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse4) 4) 85))))) is different from false [2022-11-20 11:51:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:39,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719546085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:39,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:39,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-20 11:51:39,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769624651] [2022-11-20 11:51:39,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:39,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:51:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:51:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=399, Unknown=15, NotChecked=132, Total=650 [2022-11-20 11:51:39,475 INFO L87 Difference]: Start difference. First operand 583 states and 1383 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:51:41,022 INFO L93 Difference]: Finished difference Result 631 states and 1489 transitions. [2022-11-20 11:51:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:51:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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) Word has length 14 [2022-11-20 11:51:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:51:41,025 INFO L225 Difference]: With dead ends: 631 [2022-11-20 11:51:41,025 INFO L226 Difference]: Without dead ends: 631 [2022-11-20 11:51:41,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=190, Invalid=737, Unknown=15, NotChecked=180, Total=1122 [2022-11-20 11:51:41,027 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:51:41,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 53 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 393 Unchecked, 0.4s Time] [2022-11-20 11:51:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-11-20 11:51:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 583. [2022-11-20 11:51:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 573 states have (on average 2.413612565445026) internal successors, (1383), 582 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1383 transitions. [2022-11-20 11:51:41,045 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1383 transitions. Word has length 14 [2022-11-20 11:51:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:51:41,046 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1383 transitions. [2022-11-20 11:51:41,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:51:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1383 transitions. [2022-11-20 11:51:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:51:41,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:51:41,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:41,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:41,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:41,255 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:51:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1153993587, now seen corresponding path program 3 times [2022-11-20 11:51:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596057014] [2022-11-20 11:51:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596057014] [2022-11-20 11:51:42,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596057014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164527014] [2022-11-20 11:51:42,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:51:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:42,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:42,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:42,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:51:42,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 11:51:42,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:51:42,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 11:51:42,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:42,809 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:51:42,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:51:42,847 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:51:42,847 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:51:43,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:51:43,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:51:43,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:51:43,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:43,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:51:43,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:51:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:43,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:43,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 11:51:44,116 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse0) 4) 85)))) is different from false [2022-11-20 11:51:44,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse1) 4) 85)))) is different from false [2022-11-20 11:51:44,595 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_857 Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_854 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_854))) (store (store .cse0 .cse1 v_ArrVal_857) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_857 Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_854 Int)) (< (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_854))) (store (store .cse6 .cse1 v_ArrVal_857) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861) |c_~#queue~0.base|) .cse5) 4) 85)))) is different from false [2022-11-20 11:51:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:51,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164527014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:51,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:51,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-20 11:51:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134453664] [2022-11-20 11:51:51,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:51,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:51:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:51,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:51:51,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=401, Unknown=17, NotChecked=132, Total=650 [2022-11-20 11:51:51,905 INFO L87 Difference]: Start difference. First operand 583 states and 1383 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:05,704 INFO L93 Difference]: Finished difference Result 764 states and 1806 transitions. [2022-11-20 11:52:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:52:05,705 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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) Word has length 14 [2022-11-20 11:52:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:05,708 INFO L225 Difference]: With dead ends: 764 [2022-11-20 11:52:05,708 INFO L226 Difference]: Without dead ends: 764 [2022-11-20 11:52:05,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=240, Invalid=1082, Unknown=22, NotChecked=216, Total=1560 [2022-11-20 11:52:05,710 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 74 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 747 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:05,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 136 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 747 Unchecked, 1.0s Time] [2022-11-20 11:52:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-20 11:52:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 583. [2022-11-20 11:52:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 573 states have (on average 2.413612565445026) internal successors, (1383), 582 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1383 transitions. [2022-11-20 11:52:05,730 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1383 transitions. Word has length 14 [2022-11-20 11:52:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:05,731 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1383 transitions. [2022-11-20 11:52:05,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1383 transitions. [2022-11-20 11:52:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:52:05,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:05,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:52:05,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:52:05,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:05,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:52:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -551375410, now seen corresponding path program 1 times [2022-11-20 11:52:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:05,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800037166] [2022-11-20 11:52:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:06,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800037166] [2022-11-20 11:52:06,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800037166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:52:06,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:52:06,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:52:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746302742] [2022-11-20 11:52:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:52:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:52:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:52:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:52:06,027 INFO L87 Difference]: Start difference. First operand 583 states and 1383 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:06,274 INFO L93 Difference]: Finished difference Result 595 states and 1391 transitions. [2022-11-20 11:52:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:52:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) Word has length 15 [2022-11-20 11:52:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:06,277 INFO L225 Difference]: With dead ends: 595 [2022-11-20 11:52:06,277 INFO L226 Difference]: Without dead ends: 595 [2022-11-20 11:52:06,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:52:06,278 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:06,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:52:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-20 11:52:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 569. [2022-11-20 11:52:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 559 states have (on average 2.407871198568873) internal successors, (1346), 568 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1346 transitions. [2022-11-20 11:52:06,294 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1346 transitions. Word has length 15 [2022-11-20 11:52:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:06,295 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 1346 transitions. [2022-11-20 11:52:06,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1346 transitions. [2022-11-20 11:52:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:52:06,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:06,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:52:06,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:52:06,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:52:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1414555823, now seen corresponding path program 1 times [2022-11-20 11:52:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:06,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462877532] [2022-11-20 11:52:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462877532] [2022-11-20 11:52:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462877532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:08,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057885982] [2022-11-20 11:52:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:08,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:08,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:08,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:52:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:08,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 11:52:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:08,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:08,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:08,342 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:52:08,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:52:08,398 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:52:08,398 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:52:08,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:52:09,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:52:09,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:52:09,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:52:09,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:09,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:52:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:09,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:52:10,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_995 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_994) |c_~#stored_elements~0.base| v_ArrVal_995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_995 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_994) |c_~#stored_elements~0.base| v_ArrVal_995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:52:10,270 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_995 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_994) |c_~#stored_elements~0.base| v_ArrVal_995) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_995 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_994) |c_~#stored_elements~0.base| v_ArrVal_995) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:52:14,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:52:14,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-20 11:52:24,280 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:52:34,708 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:52:46,198 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:52:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:46,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057885982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:52:46,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:52:46,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-20 11:52:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663610709] [2022-11-20 11:52:46,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:52:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:52:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:52:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:52:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=493, Unknown=40, NotChecked=98, Total=756 [2022-11-20 11:52:46,324 INFO L87 Difference]: Start difference. First operand 569 states and 1346 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:52:50,512 INFO L93 Difference]: Finished difference Result 669 states and 1588 transitions. [2022-11-20 11:52:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 11:52:50,513 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 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) Word has length 15 [2022-11-20 11:52:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:52:50,515 INFO L225 Difference]: With dead ends: 669 [2022-11-20 11:52:50,515 INFO L226 Difference]: Without dead ends: 669 [2022-11-20 11:52:50,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=190, Invalid=834, Unknown=40, NotChecked=126, Total=1190 [2022-11-20 11:52:50,516 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:52:50,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 103 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 307 Unchecked, 0.8s Time] [2022-11-20 11:52:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-20 11:52:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 570. [2022-11-20 11:52:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 560 states have (on average 2.4125) internal successors, (1351), 569 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1351 transitions. [2022-11-20 11:52:50,534 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1351 transitions. Word has length 15 [2022-11-20 11:52:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:52:50,534 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1351 transitions. [2022-11-20 11:52:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:52:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1351 transitions. [2022-11-20 11:52:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:52:50,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:52:50,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:52:50,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:52:50,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 11:52:50,743 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:52:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:52:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 901508543, now seen corresponding path program 1 times [2022-11-20 11:52:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:52:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114740903] [2022-11-20 11:52:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:52:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:52:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114740903] [2022-11-20 11:52:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114740903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:52:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536869289] [2022-11-20 11:52:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:52:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:52:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:52:52,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:52:52,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:52:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:52:52,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 11:52:52,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:52:52,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:52,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:52,765 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:52:52,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:52:52,817 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:52:52,817 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:52:53,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:52:53,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:52:53,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:52:54,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:52:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:52:54,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:52:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:54,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:52:56,921 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1091) |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1091) |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-20 11:52:56,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1091) |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1091) |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:52:59,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:52:59,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-20 11:53:16,316 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:53:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:26,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536869289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:53:26,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:53:26,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-20 11:53:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29657569] [2022-11-20 11:53:26,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:53:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:53:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:53:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=505, Unknown=29, NotChecked=98, Total=756 [2022-11-20 11:53:26,362 INFO L87 Difference]: Start difference. First operand 570 states and 1351 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:53:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:32,796 INFO L93 Difference]: Finished difference Result 596 states and 1427 transitions. [2022-11-20 11:53:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:53:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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) Word has length 16 [2022-11-20 11:53:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:32,799 INFO L225 Difference]: With dead ends: 596 [2022-11-20 11:53:32,799 INFO L226 Difference]: Without dead ends: 596 [2022-11-20 11:53:32,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=192, Invalid=779, Unknown=29, NotChecked=122, Total=1122 [2022-11-20 11:53:32,800 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:32,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 60 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 230 Unchecked, 0.5s Time] [2022-11-20 11:53:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-20 11:53:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 571. [2022-11-20 11:53:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 561 states have (on average 2.415329768270945) internal successors, (1355), 570 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:53:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1355 transitions. [2022-11-20 11:53:32,817 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1355 transitions. Word has length 16 [2022-11-20 11:53:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:32,818 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1355 transitions. [2022-11-20 11:53:32,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:53:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1355 transitions. [2022-11-20 11:53:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:53:32,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:32,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:53:32,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 11:53:33,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:33,026 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:53:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 901554113, now seen corresponding path program 2 times [2022-11-20 11:53:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:33,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285851544] [2022-11-20 11:53:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:34,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285851544] [2022-11-20 11:53:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285851544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:34,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491971003] [2022-11-20 11:53:34,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:53:34,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:34,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:34,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:53:34,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:53:34,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:53:34,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:53:34,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 11:53:34,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:53:34,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:34,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:34,913 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:53:34,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:53:34,965 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:53:34,965 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:53:35,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:53:35,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:53:36,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:53:36,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:53:36,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:53:36,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:53:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:36,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:53:45,557 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1188) |c_~#stored_elements~0.base| v_ArrVal_1189) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1188) |c_~#stored_elements~0.base| v_ArrVal_1189) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:53:47,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1184 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1184) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1188) |c_~#stored_elements~0.base| v_ArrVal_1189) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1184 Int) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1184) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1188) |c_~#stored_elements~0.base| v_ArrVal_1189) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-20 11:53:47,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:53:47,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-20 11:53:53,884 WARN L233 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:53:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491971003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:53:55,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:53:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-20 11:53:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393315974] [2022-11-20 11:53:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:53:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:53:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:53:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=499, Unknown=38, NotChecked=98, Total=756 [2022-11-20 11:53:55,942 INFO L87 Difference]: Start difference. First operand 571 states and 1355 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:26,783 WARN L233 SmtUtils]: Spent 23.27s on a formula simplification. DAG size of input: 106 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:54:52,161 WARN L233 SmtUtils]: Spent 17.80s on a formula simplification. DAG size of input: 116 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:54:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:52,752 INFO L93 Difference]: Finished difference Result 725 states and 1716 transitions. [2022-11-20 11:54:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 11:54:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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) Word has length 16 [2022-11-20 11:54:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:52,756 INFO L225 Difference]: With dead ends: 725 [2022-11-20 11:54:52,756 INFO L226 Difference]: Without dead ends: 725 [2022-11-20 11:54:52,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 76.3s TimeCoverageRelationStatistics Valid=230, Invalid=850, Unknown=50, NotChecked=130, Total=1260 [2022-11-20 11:54:52,758 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 149 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 725 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:52,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 120 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 725 Unchecked, 0.8s Time] [2022-11-20 11:54:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-20 11:54:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 575. [2022-11-20 11:54:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 565 states have (on average 2.423008849557522) internal successors, (1369), 574 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1369 transitions. [2022-11-20 11:54:52,776 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1369 transitions. Word has length 16 [2022-11-20 11:54:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:52,776 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1369 transitions. [2022-11-20 11:54:52,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1369 transitions. [2022-11-20 11:54:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:54:52,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:52,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:52,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:52,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 11:54:52,985 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:54:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 901554826, now seen corresponding path program 1 times [2022-11-20 11:54:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405617996] [2022-11-20 11:54:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:53,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405617996] [2022-11-20 11:54:53,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405617996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:53,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:53,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:54:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223117698] [2022-11-20 11:54:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:54:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:53,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:54:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:54:53,092 INFO L87 Difference]: Start difference. First operand 575 states and 1369 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:53,300 INFO L93 Difference]: Finished difference Result 405 states and 838 transitions. [2022-11-20 11:54:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:54:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2022-11-20 11:54:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:53,302 INFO L225 Difference]: With dead ends: 405 [2022-11-20 11:54:53,302 INFO L226 Difference]: Without dead ends: 403 [2022-11-20 11:54:53,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:54:53,303 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:53,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:54:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-20 11:54:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-11-20 11:54:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 2.122762148337596) internal successors, (830), 400 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 830 transitions. [2022-11-20 11:54:53,314 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 830 transitions. Word has length 16 [2022-11-20 11:54:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:53,314 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 830 transitions. [2022-11-20 11:54:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 830 transitions. [2022-11-20 11:54:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:54:53,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:53,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:53,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:54:53,316 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:54:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1955257272, now seen corresponding path program 1 times [2022-11-20 11:54:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:53,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137952604] [2022-11-20 11:54:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137952604] [2022-11-20 11:54:54,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137952604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439123662] [2022-11-20 11:54:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:54,695 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:54,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:54:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:54,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:54:54,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:54,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:54,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:54:54,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-20 11:54:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:55,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:54:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:55,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439123662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:54:55,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:54:55,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2022-11-20 11:54:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902009716] [2022-11-20 11:54:55,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:54:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:54:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:54:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:54:55,891 INFO L87 Difference]: Start difference. First operand 401 states and 830 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:58,729 INFO L93 Difference]: Finished difference Result 1017 states and 2044 transitions. [2022-11-20 11:54:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:54:58,730 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 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) Word has length 19 [2022-11-20 11:54:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:58,733 INFO L225 Difference]: With dead ends: 1017 [2022-11-20 11:54:58,733 INFO L226 Difference]: Without dead ends: 1017 [2022-11-20 11:54:58,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=779, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 11:54:58,734 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 390 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:58,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 39 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 11:54:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-11-20 11:54:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 626. [2022-11-20 11:54:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 616 states have (on average 2.063311688311688) internal successors, (1271), 625 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1271 transitions. [2022-11-20 11:54:58,754 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1271 transitions. Word has length 19 [2022-11-20 11:54:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:58,754 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 1271 transitions. [2022-11-20 11:54:58,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1271 transitions. [2022-11-20 11:54:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:54:58,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:58,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:58,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 11:54:58,962 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:54:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1356223220, now seen corresponding path program 1 times [2022-11-20 11:54:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950707699] [2022-11-20 11:54:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:55:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950707699] [2022-11-20 11:55:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950707699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:55:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841567472] [2022-11-20 11:55:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:55:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:55:00,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:55:00,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:55:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:01,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 11:55:01,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:55:01,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:55:01,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:01,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:55:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:55:01,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:55:02,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:02,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 11:55:02,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:02,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 11:55:02,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:55:02,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:02,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-20 11:55:02,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:55:02,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:02,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-20 11:55:02,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:55:02,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-11-20 11:55:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:55:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841567472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:55:03,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:55:03,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-11-20 11:55:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620238783] [2022-11-20 11:55:03,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:55:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 11:55:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:55:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 11:55:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=453, Unknown=5, NotChecked=0, Total=552 [2022-11-20 11:55:03,115 INFO L87 Difference]: Start difference. First operand 626 states and 1271 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:05,957 INFO L93 Difference]: Finished difference Result 948 states and 1879 transitions. [2022-11-20 11:55:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:55:05,958 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 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) Word has length 21 [2022-11-20 11:55:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:05,963 INFO L225 Difference]: With dead ends: 948 [2022-11-20 11:55:05,963 INFO L226 Difference]: Without dead ends: 948 [2022-11-20 11:55:05,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=255, Invalid=796, Unknown=5, NotChecked=0, Total=1056 [2022-11-20 11:55:05,965 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 454 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:05,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 45 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 528 Invalid, 0 Unknown, 51 Unchecked, 1.5s Time] [2022-11-20 11:55:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-11-20 11:55:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 721. [2022-11-20 11:55:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 711 states have (on average 2.0562587904360057) internal successors, (1462), 720 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1462 transitions. [2022-11-20 11:55:06,000 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1462 transitions. Word has length 21 [2022-11-20 11:55:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:06,002 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 1462 transitions. [2022-11-20 11:55:06,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1462 transitions. [2022-11-20 11:55:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:55:06,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:06,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:55:06,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:55:06,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 11:55:06,213 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:55:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -431472802, now seen corresponding path program 4 times [2022-11-20 11:55:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:06,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084402199] [2022-11-20 11:55:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:55:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:08,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084402199] [2022-11-20 11:55:08,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084402199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:55:08,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770701320] [2022-11-20 11:55:08,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:55:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:55:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:55:08,963 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:55:08,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:55:09,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:55:09,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:55:09,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-20 11:55:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:55:09,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:09,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:09,305 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:55:09,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:55:09,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:09,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:09,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:09,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-20 11:55:09,399 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:55:09,399 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:55:09,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:55:10,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:55:10,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:55:10,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:55:11,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:11,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:55:11,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-20 11:55:11,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 11:55:12,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-20 11:55:12,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:55:12,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-20 11:55:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:55:12,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:55:12,986 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1529 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1529 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-20 11:55:13,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1529 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1529 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:55:13,679 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1523))) (store (store .cse0 .cse1 v_ArrVal_1525) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1523))) (store (store .cse6 .cse1 v_ArrVal_1525) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:55:15,717 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| .cse0)) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse1 .cse2 v_ArrVal_1525) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| .cse0)) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse5 .cse2 v_ArrVal_1525) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-11-20 11:55:15,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1522))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse1 .cse2 v_ArrVal_1525) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse3) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1522 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1522))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| (select .cse5 .cse3))) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse7 .cse2 v_ArrVal_1525) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2022-11-20 11:55:15,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1521) |c_~#stored_elements~0.base| v_ArrVal_1522))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| (select .cse0 .cse1))) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse3 .cse4 v_ArrVal_1525) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1521) |c_~#stored_elements~0.base| v_ArrVal_1522))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| (select .cse5 .cse1))) (forall ((v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1529 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1523))) (store (store .cse7 .cse4 v_ArrVal_1525) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1529) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2022-11-20 11:55:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:55:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770701320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:55:54,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:55:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2022-11-20 11:55:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992079862] [2022-11-20 11:55:54,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:55:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 11:55:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:55:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 11:55:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=928, Unknown=46, NotChecked=414, Total=1560 [2022-11-20 11:55:54,579 INFO L87 Difference]: Start difference. First operand 721 states and 1462 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:58,173 INFO L93 Difference]: Finished difference Result 848 states and 1695 transitions. [2022-11-20 11:55:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:55:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 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) Word has length 22 [2022-11-20 11:55:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:58,176 INFO L225 Difference]: With dead ends: 848 [2022-11-20 11:55:58,176 INFO L226 Difference]: Without dead ends: 848 [2022-11-20 11:55:58,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 5 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=274, Invalid=1426, Unknown=46, NotChecked=510, Total=2256 [2022-11-20 11:55:58,178 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 84 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:58,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 85 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 410 Invalid, 0 Unknown, 814 Unchecked, 1.1s Time] [2022-11-20 11:55:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-11-20 11:55:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 778. [2022-11-20 11:55:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 768 states have (on average 2.0559895833333335) internal successors, (1579), 777 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1579 transitions. [2022-11-20 11:55:58,197 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1579 transitions. Word has length 22 [2022-11-20 11:55:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:58,197 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1579 transitions. [2022-11-20 11:55:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:55:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1579 transitions. [2022-11-20 11:55:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:55:58,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:58,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:55:58,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:55:58,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:55:58,406 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:55:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1769761558, now seen corresponding path program 5 times [2022-11-20 11:55:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:58,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086247514] [2022-11-20 11:55:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:56:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:56:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086247514] [2022-11-20 11:56:00,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086247514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:56:00,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870310952] [2022-11-20 11:56:00,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:56:00,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:56:00,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:56:00,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:56:00,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:56:01,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-20 11:56:01,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:56:01,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 11:56:01,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:56:01,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:01,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:01,341 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:56:01,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:56:01,387 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:56:01,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-20 11:56:01,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:56:01,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:56:01,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-20 11:56:02,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-20 11:56:02,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-20 11:56:03,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:03,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-20 11:56:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:03,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-20 11:56:03,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-11-20 11:56:03,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 11:56:04,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-20 11:56:04,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:04,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2022-11-20 11:56:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:56:04,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:56:04,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-20 11:56:04,848 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:56:04,872 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:56:04,915 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1646) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1646) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-20 11:56:04,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1644))) (store (store .cse0 .cse1 v_ArrVal_1646) .cse2 (+ 1 (select .cse0 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1644))) (store (store .cse6 .cse1 v_ArrVal_1646) .cse2 (+ 1 (select .cse6 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:56:20,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse1 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse6 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:56:28,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse3))) v_ArrVal_1644)))) (store (store .cse1 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse3))) v_ArrVal_1644)))) (store (store .cse7 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:56:53,247 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:56:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 11:56:53,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870310952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:56:53,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:56:53,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 43 [2022-11-20 11:56:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468490952] [2022-11-20 11:56:53,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:56:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 11:56:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:56:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 11:56:53,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1181, Unknown=33, NotChecked=546, Total=1980 [2022-11-20 11:56:53,451 INFO L87 Difference]: Start difference. First operand 778 states and 1579 transitions. Second operand has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:56:57,327 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse35 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse36 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse35 .cse36)) (.cse13 (* (select .cse6 .cse5) 4))) (let ((.cse7 (+ .cse13 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse35 .cse36 (+ .cse2 1)))) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse32 (store (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse32 |c_~#queue~0.base| (let ((.cse33 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse33 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse33 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse8))) (.cse1 (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse28 (store (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse28 |c_~#queue~0.base| (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse29 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse29 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))) (.cse9 (<= 0 .cse7))) (and (or (and .cse0 .cse1) (= .cse2 20)) .cse0 (forall ((v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse7 v_ArrVal_1644))) (store (store .cse3 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse8)) .cse9 (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse10 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse5) 4)) v_ArrVal_1644)))) (store (store .cse11 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse11 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= (+ .cse13 |c_~#queue~0.offset| 4) .cse8) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse14 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse14 |c_~#queue~0.base| (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse5) 4)) v_ArrVal_1644)))) (store (store .cse15 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse15 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse8)) .cse1 (forall ((v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse17 (store .cse6 .cse7 v_ArrVal_1644))) (store (store .cse17 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse17 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (or (not .cse9) (and (forall ((v_ArrVal_1636 Int)) (let ((.cse22 (store .cse6 .cse7 v_ArrVal_1636))) (let ((.cse18 (select .cse22 .cse5))) (or (= .cse18 20) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1637 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse19 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_1637) .cse5 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse20 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse20 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1636 Int)) (let ((.cse26 (store .cse6 .cse7 v_ArrVal_1636))) (let ((.cse27 (select .cse26 .cse5))) (or (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1637 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse23 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_1637) .cse5 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse23 |c_~#queue~0.base| (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse24 .cse4 v_ArrVal_1646) .cse5 (+ (select .cse24 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse8)) (= .cse27 20)))))) (not (<= (+ 92 |c_~#queue~0.offset|) .cse8)))))))) is different from false [2022-11-20 11:57:37,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse0 .cse2))) (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ .cse13 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1646) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1646) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= (+ 92 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1637 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1637) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)) v_ArrVal_1644)))) (store (store .cse7 .cse8 v_ArrVal_1646) .cse4 (+ (select .cse7 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) 4) .cse5)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1637 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1637) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)) v_ArrVal_1644)))) (store (store .cse11 .cse8 v_ArrVal_1646) .cse4 (+ (select .cse11 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4)))))) (= .cse13 20)))))) is different from false [2022-11-20 11:58:20,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse3))) v_ArrVal_1644)))) (store (store .cse1 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse7 (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse3))) v_ArrVal_1644)))) (store (store .cse8 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse8 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:58:31,484 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1644)))) (store (store .cse1 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) 4) .cse5)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_1644)))) (store (store .cse7 .cse2 v_ArrVal_1646) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-20 11:58:37,575 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4) 4)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse2 .cse3 v_ArrVal_1646) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1646 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1642))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1644)))) (store (store .cse8 .cse3 v_ArrVal_1646) .cse4 (+ (select .cse8 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1649) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse6))))) is different from false [2022-11-20 11:58:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:58:38,502 INFO L93 Difference]: Finished difference Result 1318 states and 2642 transitions. [2022-11-20 11:58:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-20 11:58:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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) Word has length 22 [2022-11-20 11:58:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:58:38,507 INFO L225 Difference]: With dead ends: 1318 [2022-11-20 11:58:38,508 INFO L226 Difference]: Without dead ends: 1318 [2022-11-20 11:58:38,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 12 IntricatePredicates, 4 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 154.5s TimeCoverageRelationStatistics Valid=706, Invalid=5005, Unknown=343, NotChecked=1956, Total=8010 [2022-11-20 11:58:38,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 359 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4147 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:58:38,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 258 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 533 Invalid, 0 Unknown, 4147 Unchecked, 1.5s Time] [2022-11-20 11:58:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-20 11:58:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 860. [2022-11-20 11:58:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 850 states have (on average 2.050588235294118) internal successors, (1743), 859 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:58:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1743 transitions. [2022-11-20 11:58:38,538 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1743 transitions. Word has length 22 [2022-11-20 11:58:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:58:38,539 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 1743 transitions. [2022-11-20 11:58:38,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:58:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1743 transitions. [2022-11-20 11:58:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:58:38,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:58:38,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:58:38,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-20 11:58:38,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:58:38,753 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:58:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:58:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash 413170066, now seen corresponding path program 6 times [2022-11-20 11:58:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:58:38,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374135856] [2022-11-20 11:58:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:58:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:58:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:58:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:58:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374135856] [2022-11-20 11:58:41,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374135856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:58:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053228417] [2022-11-20 11:58:41,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:58:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:58:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:58:41,745 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:58:41,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:58:42,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 11:58:42,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:58:42,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 11:58:42,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:58:42,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-20 11:58:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:42,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:42,153 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:58:42,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-20 11:58:42,215 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:58:42,215 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:58:42,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:58:42,694 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 11:58:42,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 11:58:42,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:42,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 11:58:43,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 11:58:43,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:43,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:58:43,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:58:43,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:58:43,651 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 11:58:43,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 11:58:43,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:43,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 11:58:44,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 11:58:44,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:58:44,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:58:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:58:44,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:58:44,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 11:58:44,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1765 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1765 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse0) 4) 85)))) is different from false [2022-11-20 11:58:44,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1765 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1) 4) 85)) (forall ((v_ArrVal_1765 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:58:44,705 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1762 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1762) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1762 Int)) (< (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1762) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse4) 4) 85))))) is different from false [2022-11-20 11:58:45,126 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_1760))) (store (store .cse1 .cse2 v_ArrVal_1762) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (< (* (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_1760))) (store (store .cse7 .cse2 v_ArrVal_1762) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse5) 4) 85)))) is different from false [2022-11-20 11:58:45,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| .cse0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store (select .cse1 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse2 .cse3 v_ArrVal_1762) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| .cse0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (< (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse6 .cse3 v_ArrVal_1762) .cse4 (+ (select .cse6 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse4)) 85))))))) is different from false [2022-11-20 11:58:45,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse0 |c_~#queue~0.base|) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (select .cse2 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse3 .cse4 v_ArrVal_1762) .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (< (* 4 (select (select (store (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse6 .cse4 v_ArrVal_1762) .cse1 (+ (select .cse6 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1)) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse7 |c_~#queue~0.base|) .cse1)))))))) is different from false [2022-11-20 11:58:45,347 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse4 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (< (* (select (select (store (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store (select .cse0 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse1 .cse2 v_ArrVal_1762) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse3) 4) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse4 |c_~#queue~0.base|) .cse3)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse8 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (select .cse6 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse7 .cse2 v_ArrVal_1762) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse3) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse8 |c_~#queue~0.base|) .cse3)))))))) is different from false [2022-11-20 11:58:45,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse0 |c_~#queue~0.base|) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (< (* (select (select (store (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (select .cse2 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse3 .cse4 v_ArrVal_1762) .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1) 4) 85))))) (forall ((v_ArrVal_1757 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (let ((.cse8 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1757))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1762 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1758))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (select .cse6 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1760))) (store (store .cse7 .cse4 v_ArrVal_1762) .cse1 (+ (select .cse7 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1765) |c_~#queue~0.base|) .cse1) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| (select (select .cse8 |c_~#queue~0.base|) .cse1)))))))) is different from false [2022-11-20 11:58:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-20 11:58:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053228417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:58:55,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:58:55,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 38 [2022-11-20 11:58:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731386625] [2022-11-20 11:58:55,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:58:55,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 11:58:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:58:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 11:58:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=841, Unknown=23, NotChecked=536, Total=1560 [2022-11-20 11:58:55,450 INFO L87 Difference]: Start difference. First operand 860 states and 1743 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:59:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:59:05,782 INFO L93 Difference]: Finished difference Result 994 states and 1984 transitions. [2022-11-20 11:59:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:59:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 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) Word has length 22 [2022-11-20 11:59:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:59:05,786 INFO L225 Difference]: With dead ends: 994 [2022-11-20 11:59:05,786 INFO L226 Difference]: Without dead ends: 994 [2022-11-20 11:59:05,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 20 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=397, Invalid=2051, Unknown=34, NotChecked=824, Total=3306 [2022-11-20 11:59:05,788 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 190 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1400 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:59:05,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 94 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 993 Invalid, 0 Unknown, 1400 Unchecked, 2.8s Time] [2022-11-20 11:59:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-11-20 11:59:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 852. [2022-11-20 11:59:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 842 states have (on average 2.058194774346793) internal successors, (1733), 851 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:59:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1733 transitions. [2022-11-20 11:59:05,813 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1733 transitions. Word has length 22 [2022-11-20 11:59:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:59:05,813 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1733 transitions. [2022-11-20 11:59:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:59:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1733 transitions. [2022-11-20 11:59:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:59:05,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:59:05,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:59:05,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:59:06,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:59:06,023 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 11:59:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:59:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2044158384, now seen corresponding path program 7 times [2022-11-20 11:59:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:59:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065392010] [2022-11-20 11:59:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:59:06,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:59:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:59:08,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:59:08,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065392010] [2022-11-20 11:59:08,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065392010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:59:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810110013] [2022-11-20 11:59:08,572 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:59:08,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:59:08,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:59:08,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:59:08,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:59:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 11:59:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:59:08,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:59:08,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:59:08,880 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:59:08,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 11:59:08,936 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:59:08,936 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 11:59:09,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 11:59:09,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 11:59:10,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 11:59:10,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:59:10,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 11:59:10,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-20 11:59:11,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 11:59:11,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-20 11:59:12,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-20 11:59:12,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:59:12,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-20 11:59:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:59:12,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:59:12,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 11:59:20,109 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1878))) (store (store .cse0 .cse1 v_ArrVal_1880) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1878))) (store (store .cse6 .cse1 v_ArrVal_1880) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 11:59:22,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse0 .cse1 v_ArrVal_1880) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse2) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| .cse4)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse5 .cse1 v_ArrVal_1880) .cse2 (+ (select .cse5 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| .cse4))))))) is different from false [2022-11-20 11:59:22,190 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1877 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1877))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse1 .cse2 v_ArrVal_1880) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1877 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1877))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= (+ (* (select (select (store (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse6 .cse2 v_ArrVal_1880) .cse3 (+ (select .cse6 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| (select .cse7 .cse3))))))))) is different from false [2022-11-20 11:59:22,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1877 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1877))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse1 .cse2 v_ArrVal_1880) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1877 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1877))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1880 Int) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1878 Int)) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| 4) |c_~#queue~0.offset|) v_ArrVal_1878))) (store (store .cse7 .cse2 v_ArrVal_1880) .cse3 (+ (select .cse7 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1884) |c_~#stored_elements~0.base| v_ArrVal_1885) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1528| (select .cse8 .cse3))))))))) is different from false [2022-11-20 11:59:29,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:59:29,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 355 treesize of output 359 [2022-11-20 11:59:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 11:59:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810110013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:59:43,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:59:43,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 40 [2022-11-20 11:59:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219044802] [2022-11-20 11:59:43,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:59:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 11:59:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:59:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 11:59:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1075, Unknown=68, NotChecked=370, Total=1722 [2022-11-20 11:59:43,441 INFO L87 Difference]: Start difference. First operand 852 states and 1733 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:00:05,174 WARN L233 SmtUtils]: Spent 15.38s on a formula simplification. DAG size of input: 127 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:00:34,094 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:01:09,912 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:01:21,553 WARN L233 SmtUtils]: Spent 10.43s on a formula simplification. DAG size of input: 72 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:01:58,736 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:02:14,604 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 122 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:02:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:35,910 INFO L93 Difference]: Finished difference Result 1115 states and 2233 transitions. [2022-11-20 12:02:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 12:02:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 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) Word has length 22 [2022-11-20 12:02:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:35,913 INFO L225 Difference]: With dead ends: 1115 [2022-11-20 12:02:35,913 INFO L226 Difference]: Without dead ends: 1115 [2022-11-20 12:02:35,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 204.0s TimeCoverageRelationStatistics Valid=585, Invalid=3331, Unknown=136, NotChecked=640, Total=4692 [2022-11-20 12:02:35,915 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 194 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2476 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:35,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 240 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 617 Invalid, 0 Unknown, 2476 Unchecked, 1.6s Time] [2022-11-20 12:02:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-11-20 12:02:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 807. [2022-11-20 12:02:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 797 states have (on average 2.0602258469259724) internal successors, (1642), 806 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1642 transitions. [2022-11-20 12:02:35,934 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1642 transitions. Word has length 22 [2022-11-20 12:02:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1642 transitions. [2022-11-20 12:02:35,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1642 transitions. [2022-11-20 12:02:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:02:35,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:35,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:02:35,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:02:36,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:36,143 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 12:02:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 838492580, now seen corresponding path program 2 times [2022-11-20 12:02:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:36,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751030472] [2022-11-20 12:02:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:02:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751030472] [2022-11-20 12:02:38,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751030472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:02:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825534450] [2022-11-20 12:02:38,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:02:38,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:38,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:02:38,751 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:02:38,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 12:02:39,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:02:39,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:02:39,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 12:02:39,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:02:39,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:39,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:39,077 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:02:39,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 12:02:39,129 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 12:02:39,129 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 12:02:39,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 12:02:39,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 12:02:39,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 12:02:40,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 12:02:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:40,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 12:02:40,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-20 12:02:40,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 12:02:41,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-20 12:02:41,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:41,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-20 12:02:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:02:41,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:02:41,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 12:02:42,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2001) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse4) 4) 85)) (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2001) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-20 12:02:45,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse0 .cse1))) (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse3 .cse4 v_ArrVal_2001) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (< (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse6 .cse4 v_ArrVal_2001) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse1) 4) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse7 .cse1))))))))) is different from false [2022-11-20 12:02:45,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (< (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse1 .cse2 v_ArrVal_2001) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse3)) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse7 .cse2 v_ArrVal_2001) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse8 .cse3))))))))) is different from false [2022-11-20 12:02:45,950 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (< (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse1 .cse2 v_ArrVal_2001) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse3) 4) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1998 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse7 .cse2 v_ArrVal_2001) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse8 .cse3))))))))) is different from false [2022-11-20 12:02:46,045 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_ArrVal_1998 (Array Int Int)) (v_ArrVal_1995 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1995) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse0 .cse1))) (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (< (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse3 .cse4 v_ArrVal_2001) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse1) 4) 85)))))) (forall ((v_ArrVal_1998 (Array Int Int)) (v_ArrVal_1995 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1995) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1998))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| (select .cse9 .cse1))) (forall ((v_ArrVal_2001 Int) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_1999 Int)) (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1535| 4) |c_~#queue~0.offset|) v_ArrVal_1999))) (store (store .cse11 .cse4 v_ArrVal_2001) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2005) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-20 12:03:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 12:03:01,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825534450] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:01,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2022-11-20 12:03:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561929843] [2022-11-20 12:03:01,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 12:03:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 12:03:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1001, Unknown=39, NotChecked=350, Total=1560 [2022-11-20 12:03:01,810 INFO L87 Difference]: Start difference. First operand 807 states and 1642 transitions. Second operand has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:11,245 INFO L93 Difference]: Finished difference Result 1066 states and 2074 transitions. [2022-11-20 12:03:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 12:03:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 states have internal predecessors, (69), 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) Word has length 23 [2022-11-20 12:03:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:11,247 INFO L225 Difference]: With dead ends: 1066 [2022-11-20 12:03:11,247 INFO L226 Difference]: Without dead ends: 1066 [2022-11-20 12:03:11,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 7 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=462, Invalid=2591, Unknown=47, NotChecked=560, Total=3660 [2022-11-20 12:03:11,249 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 81 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1021 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:11,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 104 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 450 Invalid, 0 Unknown, 1021 Unchecked, 1.2s Time] [2022-11-20 12:03:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-11-20 12:03:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 818. [2022-11-20 12:03:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 808 states have (on average 2.0594059405940595) internal successors, (1664), 817 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1664 transitions. [2022-11-20 12:03:11,269 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1664 transitions. Word has length 23 [2022-11-20 12:03:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:11,269 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1664 transitions. [2022-11-20 12:03:11,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1664 transitions. [2022-11-20 12:03:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:03:11,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:11,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:11,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:11,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 12:03:11,478 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 12:03:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 353521862, now seen corresponding path program 3 times [2022-11-20 12:03:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921207060] [2022-11-20 12:03:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921207060] [2022-11-20 12:03:13,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921207060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611384595] [2022-11-20 12:03:13,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:03:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:13,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:13,967 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:13,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 12:03:14,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 12:03:14,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:03:14,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 12:03:14,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:14,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-20 12:03:14,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:14,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-20 12:03:14,454 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-20 12:03:14,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-20 12:03:14,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:14,958 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 12:03:14,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 12:03:15,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 12:03:15,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:15,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 12:03:15,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 12:03:15,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 12:03:15,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:15,950 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 12:03:15,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 12:03:16,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:16,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 12:03:16,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 12:03:16,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 12:03:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:16,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:16,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 12:03:16,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2121 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_2121 (Array Int Int))) (< (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse0)) 85)))) is different from false [2022-11-20 12:03:16,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2121 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2121 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4) 85)))) is different from false [2022-11-20 12:03:16,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2121 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4) 85)) (forall ((v_ArrVal_2121 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-20 12:03:16,930 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2118) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (< (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2118) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse4) 4) 85))))) is different from false [2022-11-20 12:03:16,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2115))) (store (store .cse0 .cse1 v_ArrVal_2118) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (< (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_2115))) (store (store .cse6 .cse1 v_ArrVal_2118) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse5) 4) 85)))) is different from false [2022-11-20 12:03:19,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse0 .cse1))) (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (< (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse3 .cse4 v_ArrVal_2118) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4) 85)))))) (forall ((v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse5 .cse1))) (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse7 .cse4 v_ArrVal_2118) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2022-11-20 12:03:19,885 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (< (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse1 .cse2 v_ArrVal_2118) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse3) 4) 85)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse4 .cse3))))))) (forall ((v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse7 .cse2 v_ArrVal_2118) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse3) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse8 .cse3))))))))) is different from false [2022-11-20 12:03:19,992 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_ArrVal_2111 Int) (v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2111) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse0 .cse1))) (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (< (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse3 .cse4 v_ArrVal_2118) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1)) 85)))))) (forall ((v_ArrVal_2111 Int) (v_ArrVal_2114 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2111) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_2114))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| (select .cse9 .cse1))) (forall ((v_ArrVal_2115 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1541| 4) |c_~#queue~0.offset|) v_ArrVal_2115))) (store (store .cse11 .cse4 v_ArrVal_2118) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2121) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-20 12:03:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 12:03:36,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611384595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:36,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 37 [2022-11-20 12:03:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750953495] [2022-11-20 12:03:36,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:36,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 12:03:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 12:03:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=808, Unknown=18, NotChecked=520, Total=1482 [2022-11-20 12:03:36,345 INFO L87 Difference]: Start difference. First operand 818 states and 1664 transitions. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:43,543 INFO L93 Difference]: Finished difference Result 1226 states and 2494 transitions. [2022-11-20 12:03:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:03:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 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) Word has length 23 [2022-11-20 12:03:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:43,545 INFO L225 Difference]: With dead ends: 1226 [2022-11-20 12:03:43,545 INFO L226 Difference]: Without dead ends: 1226 [2022-11-20 12:03:43,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 17 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=238, Invalid=1336, Unknown=18, NotChecked=664, Total=2256 [2022-11-20 12:03:43,547 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 255 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1770 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:43,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 205 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1609 Invalid, 0 Unknown, 1770 Unchecked, 3.8s Time] [2022-11-20 12:03:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-11-20 12:03:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 804. [2022-11-20 12:03:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 794 states have (on average 2.054156171284635) internal successors, (1631), 803 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1631 transitions. [2022-11-20 12:03:43,565 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1631 transitions. Word has length 23 [2022-11-20 12:03:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:43,566 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1631 transitions. [2022-11-20 12:03:43,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1631 transitions. [2022-11-20 12:03:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:03:43,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:43,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:43,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 12:03:43,783 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 12:03:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash -355581654, now seen corresponding path program 4 times [2022-11-20 12:03:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:43,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671782685] [2022-11-20 12:03:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:45,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671782685] [2022-11-20 12:03:45,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671782685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:45,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785979340] [2022-11-20 12:03:45,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:03:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:45,983 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:45,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_575d02a9-8053-4115-9063-662ebfef6c83/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 12:03:46,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:03:46,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:03:46,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-20 12:03:46,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:46,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:46,297 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:03:46,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 12:03:46,352 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 12:03:46,352 INFO L350 Elim1Store]: Elim1 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 [2022-11-20 12:03:46,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 12:03:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 12:03:47,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 12:03:47,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 12:03:47,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:47,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 12:03:48,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 12:03:48,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 12:03:49,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2022-11-20 12:03:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:49,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 105 [2022-11-20 12:03:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:50,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:50,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2241 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2241 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-20 12:03:58,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2234 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (or (forall ((v_ArrVal_2236 Int)) (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2236))) (let ((.cse0 (select .cse2 .cse4))) (or (= 20 .cse0) (forall ((v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2238) .cse4 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse5 .cse4))) (not (<= 0 .cse6)))))) (forall ((v_ArrVal_2234 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse7 .cse4))) (not (<= 0 .cse8)) (forall ((v_ArrVal_2236 Int)) (let ((.cse11 (store .cse7 .cse8 v_ArrVal_2236))) (let ((.cse9 (select .cse11 .cse4))) (or (= 20 .cse9) (forall ((v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (<= (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_2238) .cse4 (+ 1 .cse9))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))))))) is different from false [2022-11-20 12:04:03,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ (select .cse8 .cse9) 1)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (let ((.cse4 (store .cse0 .cse2 v_ArrVal_2236))) (let ((.cse6 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse0 .cse1))) (not (<= 0 .cse2)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2238) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse1) 4))) (< .cse7 v_ArrVal_2231) (= .cse6 20))))))) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|)) (.cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_2236))) (let ((.cse12 (select .cse11 .cse1))) (or (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2238) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse13 .cse1))) (not (<= 0 .cse14)) (< .cse7 v_ArrVal_2231) (= .cse12 20)))))))))) is different from false [2022-11-20 12:04:03,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ (select .cse8 .cse10) 1)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2229 Int) (v_ArrVal_2241 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2229) .cse10 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_2236))) (let ((.cse4 (select .cse1 .cse3))) (or (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2238) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse3) 4))) (not (<= 0 .cse5)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse6 .cse3))) (< .cse7 v_ArrVal_2231) (= .cse4 20))))))) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2229 Int) (v_ArrVal_2241 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| Int)) (let ((.cse11 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2229) .cse10 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse15 (select .cse11 |c_~#queue~0.base|)) (.cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| 4)))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_2236))) (let ((.cse13 (select .cse12 .cse3))) (or (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse2 v_ArrVal_2238) .cse3 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 .cse14)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1548| (select .cse15 .cse3))) (< .cse7 v_ArrVal_2231) (= .cse13 20)))))))))) is different from false [2022-11-20 12:04:04,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:04,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 421 treesize of output 425 [2022-11-20 12:04:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 12:04:21,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785979340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:21,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:21,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 41 [2022-11-20 12:04:21,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265818009] [2022-11-20 12:04:21,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:21,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 12:04:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 12:04:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1260, Unknown=36, NotChecked=308, Total=1806 [2022-11-20 12:04:21,376 INFO L87 Difference]: Start difference. First operand 804 states and 1631 transitions. Second operand has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 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)