./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --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-5e519f3 [2022-11-02 20:44:46,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:44:46,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:44:46,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:44:46,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:44:46,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:44:46,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:44:46,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:44:46,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:44:46,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:44:46,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:44:46,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:44:46,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:44:46,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:44:46,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:44:46,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:44:46,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:44:46,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:44:46,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:44:46,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:44:46,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:44:46,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:44:46,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:44:46,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:44:46,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:44:46,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:44:46,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:44:46,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:44:46,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:44:46,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:44:46,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:44:46,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:44:46,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:44:46,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:44:46,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:44:46,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:44:46,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:44:46,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:44:46,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:44:46,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:44:46,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:44:46,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:44:46,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:44:46,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:44:46,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:44:46,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:44:46,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:44:46,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:44:46,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:44:46,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:44:46,446 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:44:46,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:44:46,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:44:46,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:44:46,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:44:46,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:44:46,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:44:46,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:44:46,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:44:46,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:44:46,449 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:44:46,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:44:46,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:44:46,450 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:44:46,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:44:46,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:44:46,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:44:46,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:44:46,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:46,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:44:46,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:44:46,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:44:46,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:44:46,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:44:46,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:44:46,454 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_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/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_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc 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 ! overflow) ) 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-02 20:44:46,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:44:46,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:44:46,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:44:46,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:44:46,783 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:44:46,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-02 20:44:46,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/data/1feafd5bf/3aa07dfcdb004cfeb6a6f12fd95c569c/FLAG75cc5d3ee [2022-11-02 20:44:47,466 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:44:47,467 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/sv-benchmarks/c/pthread/queue_ok.i [2022-11-02 20:44:47,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/data/1feafd5bf/3aa07dfcdb004cfeb6a6f12fd95c569c/FLAG75cc5d3ee [2022-11-02 20:44:47,702 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/data/1feafd5bf/3aa07dfcdb004cfeb6a6f12fd95c569c [2022-11-02 20:44:47,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:44:47,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:44:47,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:47,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:44:47,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:44:47,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:47" (1/1) ... [2022-11-02 20:44:47,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267ff45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:47, skipping insertion in model container [2022-11-02 20:44:47,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:47" (1/1) ... [2022-11-02 20:44:47,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:44:47,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:44:48,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-02 20:44:48,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-02 20:44:48,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:48,451 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:44:48,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-02 20:44:48,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-02 20:44:48,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:48,603 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:44:48,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48 WrapperNode [2022-11-02 20:44:48,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:48,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:48,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:44:48,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:44:48,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,680 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-02 20:44:48,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:48,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:44:48,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:44:48,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:44:48,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,739 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:44:48,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:44:48,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:44:48,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:44:48,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:48,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:48,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:44:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:44:48,846 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:44:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:44:48,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:44:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:44:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:44:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:44:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:44:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:44:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:44:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:44:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:44:48,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:44:48,851 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:44:49,104 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:44:49,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:44:49,657 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:44:49,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:44:49,668 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:44:49,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:49 BoogieIcfgContainer [2022-11-02 20:44:49,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:44:49,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:44:49,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:44:49,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:44:49,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:44:47" (1/3) ... [2022-11-02 20:44:49,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:49, skipping insertion in model container [2022-11-02 20:44:49,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (2/3) ... [2022-11-02 20:44:49,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:49, skipping insertion in model container [2022-11-02 20:44:49,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:49" (3/3) ... [2022-11-02 20:44:49,681 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-02 20:44:49,690 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:44:49,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:44:49,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-02 20:44:49,701 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:44:49,871 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:44:49,917 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:44:49,931 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-02 20:44:49,934 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-02 20:44:49,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 253 transitions, 522 flow [2022-11-02 20:44:50,126 INFO L130 PetriNetUnfolder]: 13/251 cut-off events. [2022-11-02 20:44:50,126 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:44:50,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 13/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-02 20:44:50,143 INFO L118 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-02 20:45:02,270 INFO L133 LiptonReduction]: Checked pairs total: 31637 [2022-11-02 20:45:02,270 INFO L135 LiptonReduction]: Total number of compositions: 244 [2022-11-02 20:45:02,279 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-02 20:45:02,388 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 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-02 20:45:02,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:45:02,412 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2159290b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:45:02,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-02 20:45:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 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-02 20:45:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:45:02,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:02,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:02,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1500788054, now seen corresponding path program 1 times [2022-11-02 20:45:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253700475] [2022-11-02 20:45:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:04,272 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-02 20:45:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253700475] [2022-11-02 20:45:04,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253700475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:04,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681985973] [2022-11-02 20:45:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:04,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:04,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:45:04,308 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-02 20:45:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:04,771 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-02 20:45:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:45:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:04,796 INFO L225 Difference]: With dead ends: 1168 [2022-11-02 20:45:04,796 INFO L226 Difference]: Without dead ends: 1168 [2022-11-02 20:45:04,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:04,800 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:04,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:45:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-02 20:45:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-02 20:45:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 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-02 20:45:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-02 20:45:04,954 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-02 20:45:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:04,955 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-02 20:45:04,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-02 20:45:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-02 20:45:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:45:04,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:04,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:04,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:45:04,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 764555353, now seen corresponding path program 1 times [2022-11-02 20:45:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133018894] [2022-11-02 20:45:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,238 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-02 20:45:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:06,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133018894] [2022-11-02 20:45:06,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133018894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:06,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:06,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137865551] [2022-11-02 20:45:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:06,242 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:07,001 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-02 20:45:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:45:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:07,022 INFO L225 Difference]: With dead ends: 1537 [2022-11-02 20:45:07,023 INFO L226 Difference]: Without dead ends: 1537 [2022-11-02 20:45:07,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:07,025 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:07,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 31 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:45:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-02 20:45:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-02 20:45:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 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-02 20:45:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-02 20:45:07,126 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-02 20:45:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:07,127 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-02 20:45:07,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-02 20:45:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:45:07,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:07,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:07,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:45:07,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 720358963, now seen corresponding path program 2 times [2022-11-02 20:45:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115306677] [2022-11-02 20:45:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,671 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-02 20:45:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:07,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115306677] [2022-11-02 20:45:07,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115306677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:07,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:07,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042193981] [2022-11-02 20:45:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:07,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:07,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:07,674 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:07,988 INFO L93 Difference]: Finished difference Result 1712 states and 4512 transitions. [2022-11-02 20:45:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:45:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:07,998 INFO L225 Difference]: With dead ends: 1712 [2022-11-02 20:45:07,998 INFO L226 Difference]: Without dead ends: 1712 [2022-11-02 20:45:07,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-02 20:45:08,000 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:08,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 26 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:45:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-02 20:45:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1328. [2022-11-02 20:45:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 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-02 20:45:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-02 20:45:08,049 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-02 20:45:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:08,049 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-02 20:45:08,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-02 20:45:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:45:08,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:08,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:08,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:45:08,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 720212953, now seen corresponding path program 3 times [2022-11-02 20:45:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:08,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736281895] [2022-11-02 20:45:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:08,564 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-02 20:45:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:08,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736281895] [2022-11-02 20:45:08,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736281895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:08,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:08,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037323268] [2022-11-02 20:45:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:08,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:08,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:08,567 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:08,838 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-02 20:45:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:08,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:45:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:08,846 INFO L225 Difference]: With dead ends: 1537 [2022-11-02 20:45:08,847 INFO L226 Difference]: Without dead ends: 1537 [2022-11-02 20:45:08,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:08,850 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:08,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 21 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:45:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-02 20:45:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-02 20:45:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 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-02 20:45:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-02 20:45:08,930 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-02 20:45:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:08,930 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-02 20:45:08,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:45:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-02 20:45:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:45:08,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:08,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:08,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:45:08,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 527899556, now seen corresponding path program 1 times [2022-11-02 20:45:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:08,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069858357] [2022-11-02 20:45:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:09,018 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-02 20:45:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:09,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069858357] [2022-11-02 20:45:09,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069858357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:09,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:09,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540128536] [2022-11-02 20:45:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:45:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:09,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:45:09,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:45:09,026 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02 20:45:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:09,276 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-02 20:45:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:45:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02 20:45:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:09,291 INFO L225 Difference]: With dead ends: 2154 [2022-11-02 20:45:09,292 INFO L226 Difference]: Without dead ends: 2154 [2022-11-02 20:45:09,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 20:45:09,294 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:09,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 20 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:45:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-02 20:45:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-02 20:45:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 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-02 20:45:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-02 20:45:09,367 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-02 20:45:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:09,368 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-02 20:45:09,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02 20:45:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-02 20:45:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:45:09,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:09,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:09,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:45:09,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash 633487863, now seen corresponding path program 1 times [2022-11-02 20:45:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370740027] [2022-11-02 20:45:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:10,186 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-02 20:45:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:10,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370740027] [2022-11-02 20:45:10,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370740027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:10,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:10,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880825313] [2022-11-02 20:45:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:10,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:10,188 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-02 20:45:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:10,684 INFO L93 Difference]: Finished difference Result 2177 states and 6018 transitions. [2022-11-02 20:45:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-02 20:45:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:10,697 INFO L225 Difference]: With dead ends: 2177 [2022-11-02 20:45:10,698 INFO L226 Difference]: Without dead ends: 2177 [2022-11-02 20:45:10,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:10,699 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:10,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:45:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-11-02 20:45:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1953. [2022-11-02 20:45:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 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-02 20:45:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-02 20:45:10,765 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-02 20:45:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:10,765 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-02 20:45:10,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-02 20:45:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-02 20:45:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:45:10,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:10,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:10,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:45:10,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 505333492, now seen corresponding path program 1 times [2022-11-02 20:45:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:10,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654730623] [2022-11-02 20:45:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:10,843 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-02 20:45:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:10,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654730623] [2022-11-02 20:45:10,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654730623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:10,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:10,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:45:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471207215] [2022-11-02 20:45:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:10,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:10,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:10,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:10,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:10,845 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-02 20:45:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:10,934 INFO L93 Difference]: Finished difference Result 559 states and 1298 transitions. [2022-11-02 20:45:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:10,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-02 20:45:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:10,937 INFO L225 Difference]: With dead ends: 559 [2022-11-02 20:45:10,937 INFO L226 Difference]: Without dead ends: 537 [2022-11-02 20:45:10,937 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-02 20:45:10,938 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:10,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-02 20:45:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-02 20:45:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 519 states have (on average 2.420038535645472) internal successors, (1256), 536 states have internal predecessors, (1256), 0 states have call successors, (0), 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-02 20:45:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1256 transitions. [2022-11-02 20:45:10,954 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1256 transitions. Word has length 11 [2022-11-02 20:45:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:10,955 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1256 transitions. [2022-11-02 20:45:10,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-02 20:45:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1256 transitions. [2022-11-02 20:45:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:45:10,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:10,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:10,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:45:10,956 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:10,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 657803752, now seen corresponding path program 1 times [2022-11-02 20:45:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:10,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625715121] [2022-11-02 20:45:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:11,844 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-02 20:45:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:11,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625715121] [2022-11-02 20:45:11,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625715121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:11,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:11,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:45:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500330751] [2022-11-02 20:45:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:11,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:11,847 INFO L87 Difference]: Start difference. First operand 537 states and 1256 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:12,343 INFO L93 Difference]: Finished difference Result 776 states and 1802 transitions. [2022-11-02 20:45:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:12,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:12,348 INFO L225 Difference]: With dead ends: 776 [2022-11-02 20:45:12,348 INFO L226 Difference]: Without dead ends: 776 [2022-11-02 20:45:12,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:12,349 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 75 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:12,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 18 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:45:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-11-02 20:45:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 592. [2022-11-02 20:45:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 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-02 20:45:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-02 20:45:12,372 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-02 20:45:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:12,372 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-02 20:45:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-02 20:45:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:45:12,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:12,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:12,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:45:12,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1736858162, now seen corresponding path program 2 times [2022-11-02 20:45:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022117610] [2022-11-02 20:45:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,257 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-02 20:45:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:13,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022117610] [2022-11-02 20:45:13,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022117610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:13,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:13,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:45:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248389047] [2022-11-02 20:45:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:13,259 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:13,720 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-02 20:45:13,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:13,725 INFO L225 Difference]: With dead ends: 820 [2022-11-02 20:45:13,725 INFO L226 Difference]: Without dead ends: 820 [2022-11-02 20:45:13,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:13,726 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:13,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:45:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-02 20:45:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-02 20:45:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 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-02 20:45:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-02 20:45:13,745 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-02 20:45:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:13,745 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-02 20:45:13,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-02 20:45:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:45:13,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:13,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:13,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:45:13,746 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1835467546, now seen corresponding path program 3 times [2022-11-02 20:45:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426240498] [2022-11-02 20:45:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:14,573 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-02 20:45:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426240498] [2022-11-02 20:45:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426240498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:14,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:14,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:45:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007872724] [2022-11-02 20:45:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:14,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:14,576 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:14,987 INFO L93 Difference]: Finished difference Result 831 states and 1916 transitions. [2022-11-02 20:45:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:14,992 INFO L225 Difference]: With dead ends: 831 [2022-11-02 20:45:14,993 INFO L226 Difference]: Without dead ends: 831 [2022-11-02 20:45:14,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:14,993 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:14,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:45:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-02 20:45:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 570. [2022-11-02 20:45:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 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-02 20:45:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-02 20:45:15,013 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-02 20:45:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:15,013 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-02 20:45:15,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 20:45:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-02 20:45:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:45:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:15,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:45:15,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 151555746, now seen corresponding path program 1 times [2022-11-02 20:45:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:15,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548796077] [2022-11-02 20:45:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:15,073 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-02 20:45:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:15,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548796077] [2022-11-02 20:45:15,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548796077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:15,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:15,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:45:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492438862] [2022-11-02 20:45:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:15,075 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-02 20:45:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:15,179 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-02 20:45:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-02 20:45:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:15,184 INFO L225 Difference]: With dead ends: 606 [2022-11-02 20:45:15,184 INFO L226 Difference]: Without dead ends: 606 [2022-11-02 20:45:15,184 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-02 20:45:15,185 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:15,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-02 20:45:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-02 20:45:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 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-02 20:45:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-02 20:45:15,201 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-02 20:45:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:15,201 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-02 20:45:15,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-02 20:45:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-02 20:45:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:45:15,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:15,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:45:15,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:45:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 988549789, now seen corresponding path program 1 times [2022-11-02 20:45:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:15,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625179263] [2022-11-02 20:45:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:16,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625179263] [2022-11-02 20:45:16,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625179263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:16,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246119512] [2022-11-02 20:45:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:16,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:16,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:16,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:45:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:16,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-02 20:45:16,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:16,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:16,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:16,653 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:45:16,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-02 20:45:16,667 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:45:16,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:45:16,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-02 20:45:18,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-02 20:45:29,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-02 20:45:36,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:36,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-02 20:45:47,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-02 20:46:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:01,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:10,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-02 20:46:10,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_438 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-02 20:46:10,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:46:10,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) (= .cse1 20)))) is different from false [2022-11-02 20:46:10,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (= .cse0 20) (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_438) (not (<= v_ArrVal_435 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))))) is different from false [2022-11-02 20:46:10,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse1 .cse4))) (or (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_435) .cse4 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_435) (< (+ .cse3 1) v_ArrVal_438))))) (= .cse3 20)))) is different from false [2022-11-02 20:46:10,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_433)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_435) .cse4 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_438) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_435) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse1 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:46:10,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| 4)) v_ArrVal_433)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2)) (.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_435) .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| (select .cse1 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_435) (= .cse0 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse3 .cse2)))))))) is different from false [2022-11-02 20:46:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:46:10,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246119512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:10,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:46:10,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-02 20:46:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991815151] [2022-11-02 20:46:10,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:10,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:46:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:46:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=480, Unknown=35, NotChecked=424, Total=1056 [2022-11-02 20:46:10,618 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-02 20:46:29,819 WARN L234 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 108 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:47:15,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (let ((.cse0 (select .cse1 84))) (or (<= .cse0 21) (<= 23 .cse0))) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse4) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (select .cse1 88) 1) (<= |c_~#stored_elements~0.base| 6) (exists ((v_ArrVal_433 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse5 (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_~#queue~0.offset| 80) 0) .cse3 0) .cse4 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_433))) (and (= .cse1 (store (store .cse5 .cse4 v_ArrVal_435) .cse3 v_ArrVal_438)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 0) (<= v_ArrVal_438 (+ (select .cse5 .cse3) 1)) (<= v_ArrVal_435 (+ (select .cse5 .cse4) 1))))))) is different from false [2022-11-02 20:47:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:47,529 INFO L93 Difference]: Finished difference Result 609 states and 1414 transitions. [2022-11-02 20:47:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-02 20:47:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:47,533 INFO L225 Difference]: With dead ends: 609 [2022-11-02 20:47:47,533 INFO L226 Difference]: Without dead ends: 609 [2022-11-02 20:47:47,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 149.7s TimeCoverageRelationStatistics Valid=217, Invalid=874, Unknown=67, NotChecked=648, Total=1806 [2022-11-02 20:47:47,535 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:47,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 686 Unchecked, 0.4s Time] [2022-11-02 20:47:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-02 20:47:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2022-11-02 20:47:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 591 states have (on average 2.3925549915397633) internal successors, (1414), 608 states have internal predecessors, (1414), 0 states have call successors, (0), 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-02 20:47:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1414 transitions. [2022-11-02 20:47:47,554 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1414 transitions. Word has length 16 [2022-11-02 20:47:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:47,554 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1414 transitions. [2022-11-02 20:47:47,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-02 20:47:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1414 transitions. [2022-11-02 20:47:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:47,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:47,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:47,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:47,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:47:47,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-02 20:47:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 988549840, now seen corresponding path program 1 times [2022-11-02 20:47:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:47,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727537621] [2022-11-02 20:47:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727537621] [2022-11-02 20:47:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727537621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266342906] [2022-11-02 20:47:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:48,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:48,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e5c1119-e968-43f4-979e-98e8bf047bd7/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:47:48,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:48,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:48,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:47:48,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-02 20:47:48,466 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:47:48,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:47:48,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-02 20:47:49,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-02 20:47:54,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-02 20:48:00,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:00,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-02 20:48:10,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-02 20:48:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:22,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:28,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-02 20:48:28,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_533 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2022-11-02 20:48:28,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 88 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-11-02 20:48:28,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (< (+ v_ArrVal_531 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 88 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:48:28,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_530 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_530)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_531 2147483648) 0) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 88 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-11-02 20:48:28,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_530 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_537 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_530)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_531 2147483648) 0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_537) .cse2) 2147483650)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_533)))))) is different from false [2022-11-02 20:48:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:48:28,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266342906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:28,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:28,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-11-02 20:48:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337734409] [2022-11-02 20:48:28,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:28,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:48:28,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:28,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:48:28,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=331, Unknown=26, NotChecked=258, Total=702 [2022-11-02 20:48:28,451 INFO L87 Difference]: Start difference. First operand 609 states and 1414 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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-02 20:48:43,130 WARN L234 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 96 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)