./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --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_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/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_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/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_74e34356-6ee7-4541-bf02-4567b3783842/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 d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 --- 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 21:04:18,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:18,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:18,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:18,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:18,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:18,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:18,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:18,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:18,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:18,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:18,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:18,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:18,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:18,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:18,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:18,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:18,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:18,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:18,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:18,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:18,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:18,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:18,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:18,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:18,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:18,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:18,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:18,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:18,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:18,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:18,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:18,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:18,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:18,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:18,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:18,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:18,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:18,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:18,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:18,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:18,818 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 21:04:18,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:18,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:18,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:18,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:18,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:18,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:18,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:18,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:18,864 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:18,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:18,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:18,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:04:18,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:18,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:18,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:18,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:18,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:18,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:18,868 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 21:04:18,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:18,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:18,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:18,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:18,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:18,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:18,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:18,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:18,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:18,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:18,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:18,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:18,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:18,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:18,873 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_74e34356-6ee7-4541-bf02-4567b3783842/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_74e34356-6ee7-4541-bf02-4567b3783842/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 -> d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 [2022-11-02 21:04:19,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:19,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:19,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:19,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:19,272 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:19,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-02 21:04:19,358 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/data/d041293a1/7290a842296a4885a540e3a5aa665ac0/FLAG0dc4542b7 [2022-11-02 21:04:19,925 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:19,926 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-02 21:04:19,937 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/data/d041293a1/7290a842296a4885a540e3a5aa665ac0/FLAG0dc4542b7 [2022-11-02 21:04:20,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/data/d041293a1/7290a842296a4885a540e3a5aa665ac0 [2022-11-02 21:04:20,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:20,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:20,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:20,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:20,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:20,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53136933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20, skipping insertion in model container [2022-11-02 21:04:20,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:20,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:20,576 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_74e34356-6ee7-4541-bf02-4567b3783842/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-02 21:04:20,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:20,595 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:20,628 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_74e34356-6ee7-4541-bf02-4567b3783842/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-02 21:04:20,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:20,664 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:20,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20 WrapperNode [2022-11-02 21:04:20,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:20,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:20,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:20,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:20,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,769 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 297 [2022-11-02 21:04:20,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:20,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:20,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:20,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:20,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,848 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:20,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:20,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:20,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:20,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:20,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:20,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:04:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:04:20,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:04:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:04:20,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:04:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:04:20,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:04:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 21:04:20,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 21:04:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:04:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:04:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:20,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:20,972 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 21:04:21,206 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:21,209 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:21,824 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:22,464 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:22,464 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:04:22,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:22 BoogieIcfgContainer [2022-11-02 21:04:22,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:22,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:22,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:22,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:22,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:20" (1/3) ... [2022-11-02 21:04:22,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed4103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:22, skipping insertion in model container [2022-11-02 21:04:22,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (2/3) ... [2022-11-02 21:04:22,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed4103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:22, skipping insertion in model container [2022-11-02 21:04:22,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:22" (3/3) ... [2022-11-02 21:04:22,486 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-11-02 21:04:22,498 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:04:22,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:22,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-02 21:04:22,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:04:22,728 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-11-02 21:04:22,782 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 21:04:22,799 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 236 transitions, 516 flow [2022-11-02 21:04:22,804 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 236 transitions, 516 flow [2022-11-02 21:04:22,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 236 transitions, 516 flow [2022-11-02 21:04:22,942 INFO L130 PetriNetUnfolder]: 14/221 cut-off events. [2022-11-02 21:04:22,943 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:04:22,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 221 events. 14/221 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 325 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 186. Up to 3 conditions per place. [2022-11-02 21:04:22,956 INFO L118 LiptonReduction]: Number of co-enabled transitions 5092 [2022-11-02 21:04:41,393 INFO L133 LiptonReduction]: Checked pairs total: 20913 [2022-11-02 21:04:41,393 INFO L135 LiptonReduction]: Total number of compositions: 229 [2022-11-02 21:04:41,402 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 76 transitions, 196 flow [2022-11-02 21:04:41,880 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 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 21:04:41,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:41,918 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;@1e538112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:41,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-02 21:04:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 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 21:04:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-02 21:04:41,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:41,983 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-02 21:04:41,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1393, now seen corresponding path program 1 times [2022-11-02 21:04:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:42,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794852922] [2022-11-02 21:04:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:42,169 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 21:04:42,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:42,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794852922] [2022-11-02 21:04:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794852922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:42,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:42,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-02 21:04:42,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253190907] [2022-11-02 21:04:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:04:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:04:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:04:42,252 INFO L87 Difference]: Start difference. First operand has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:42,649 INFO L93 Difference]: Finished difference Result 5109 states and 19230 transitions. [2022-11-02 21:04:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:04:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-02 21:04:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:42,753 INFO L225 Difference]: With dead ends: 5109 [2022-11-02 21:04:42,754 INFO L226 Difference]: Without dead ends: 5109 [2022-11-02 21:04:42,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:04:42,761 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:42,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2022-11-02 21:04:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5109. [2022-11-02 21:04:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4765 states have (on average 4.035676810073452) internal successors, (19230), 5108 states have internal predecessors, (19230), 0 states have call successors, (0), 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 21:04:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 19230 transitions. [2022-11-02 21:04:43,152 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 19230 transitions. Word has length 1 [2022-11-02 21:04:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:43,152 INFO L495 AbstractCegarLoop]: Abstraction has 5109 states and 19230 transitions. [2022-11-02 21:04:43,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 19230 transitions. [2022-11-02 21:04:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-02 21:04:43,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:43,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-02 21:04:43,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:43,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 44579, now seen corresponding path program 1 times [2022-11-02 21:04:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:43,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20595234] [2022-11-02 21:04:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:43,411 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 21:04:43,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20595234] [2022-11-02 21:04:43,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20595234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:43,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:43,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:04:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748920578] [2022-11-02 21:04:43,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:43,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:43,419 INFO L87 Difference]: Start difference. First operand 5109 states and 19230 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 21:04:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:43,841 INFO L93 Difference]: Finished difference Result 10215 states and 38457 transitions. [2022-11-02 21:04:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-02 21:04:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:43,971 INFO L225 Difference]: With dead ends: 10215 [2022-11-02 21:04:43,971 INFO L226 Difference]: Without dead ends: 10215 [2022-11-02 21:04:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:43,973 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:43,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2022-11-02 21:04:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 5110. [2022-11-02 21:04:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 4766 states have (on average 4.035249685270667) internal successors, (19232), 5109 states have internal predecessors, (19232), 0 states have call successors, (0), 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 21:04:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 19232 transitions. [2022-11-02 21:04:44,410 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 19232 transitions. Word has length 2 [2022-11-02 21:04:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:44,411 INFO L495 AbstractCegarLoop]: Abstraction has 5110 states and 19232 transitions. [2022-11-02 21:04:44,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 21:04:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 19232 transitions. [2022-11-02 21:04:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:04:44,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:44,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:04:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:44,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1384523, now seen corresponding path program 1 times [2022-11-02 21:04:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:44,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786716718] [2022-11-02 21:04:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:44,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786716718] [2022-11-02 21:04:44,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786716718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:44,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850529371] [2022-11-02 21:04:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:44,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:44,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:44,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:44,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:04:44,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:44,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:44,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850529371] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:44,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:44,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-02 21:04:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571433112] [2022-11-02 21:04:44,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:44,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:44,845 INFO L87 Difference]: Start difference. First operand 5110 states and 19232 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 21:04:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:46,007 INFO L93 Difference]: Finished difference Result 25533 states and 96141 transitions. [2022-11-02 21:04:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 3 [2022-11-02 21:04:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:46,460 INFO L225 Difference]: With dead ends: 25533 [2022-11-02 21:04:46,460 INFO L226 Difference]: Without dead ends: 25533 [2022-11-02 21:04:46,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:46,462 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 266 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:46,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 54 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:04:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2022-11-02 21:04:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 5113. [2022-11-02 21:04:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 4769 states have (on average 4.034598448312015) internal successors, (19241), 5112 states have internal predecessors, (19241), 0 states have call successors, (0), 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 21:04:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 19241 transitions. [2022-11-02 21:04:47,532 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 19241 transitions. Word has length 3 [2022-11-02 21:04:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:47,533 INFO L495 AbstractCegarLoop]: Abstraction has 5113 states and 19241 transitions. [2022-11-02 21:04:47,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 21:04:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 19241 transitions. [2022-11-02 21:04:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:04:47,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:47,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:04:47,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 21:04:47,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:47,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1384563, now seen corresponding path program 1 times [2022-11-02 21:04:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:47,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731318226] [2022-11-02 21:04:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731318226] [2022-11-02 21:04:47,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731318226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:47,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592831159] [2022-11-02 21:04:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:47,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:47,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:04:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:48,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:04:48,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:48,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:04:48,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592831159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:48,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:04:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-02 21:04:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376972831] [2022-11-02 21:04:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:48,101 INFO L87 Difference]: Start difference. First operand 5113 states and 19241 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:48,521 INFO L93 Difference]: Finished difference Result 10217 states and 38462 transitions. [2022-11-02 21:04:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 21:04:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:48,594 INFO L225 Difference]: With dead ends: 10217 [2022-11-02 21:04:48,595 INFO L226 Difference]: Without dead ends: 10217 [2022-11-02 21:04:48,595 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 21:04:48,598 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:48,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 27 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2022-11-02 21:04:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 5112. [2022-11-02 21:04:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 4769 states have (on average 4.033759698049906) internal successors, (19237), 5111 states have internal predecessors, (19237), 0 states have call successors, (0), 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 21:04:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 19237 transitions. [2022-11-02 21:04:49,006 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 19237 transitions. Word has length 3 [2022-11-02 21:04:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:49,006 INFO L495 AbstractCegarLoop]: Abstraction has 5112 states and 19237 transitions. [2022-11-02 21:04:49,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 19237 transitions. [2022-11-02 21:04:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 21:04:49,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:49,007 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-02 21:04:49,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:49,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:49,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1700792285, now seen corresponding path program 2 times [2022-11-02 21:04:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:49,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832685601] [2022-11-02 21:04:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:49,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832685601] [2022-11-02 21:04:49,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832685601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:49,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649206311] [2022-11-02 21:04:49,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:04:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:49,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:49,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:04:49,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 21:04:49,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:04:49,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:04:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:04:49,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:04:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649206311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:49,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:04:49,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-02 21:04:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942110191] [2022-11-02 21:04:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:49,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:49,550 INFO L87 Difference]: Start difference. First operand 5112 states and 19237 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:49,681 INFO L93 Difference]: Finished difference Result 5111 states and 19236 transitions. [2022-11-02 21:04:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 21:04:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:49,713 INFO L225 Difference]: With dead ends: 5111 [2022-11-02 21:04:49,714 INFO L226 Difference]: Without dead ends: 5111 [2022-11-02 21:04:49,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:49,715 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:49,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2022-11-02 21:04:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 5107. [2022-11-02 21:04:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 4765 states have (on average 4.035257082896117) internal successors, (19228), 5106 states have internal predecessors, (19228), 0 states have call successors, (0), 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 21:04:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 19228 transitions. [2022-11-02 21:04:49,962 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 19228 transitions. Word has length 6 [2022-11-02 21:04:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:49,962 INFO L495 AbstractCegarLoop]: Abstraction has 5107 states and 19228 transitions. [2022-11-02 21:04:49,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 19228 transitions. [2022-11-02 21:04:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:04:49,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:49,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:50,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 21:04:50,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:50,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1406889304, now seen corresponding path program 1 times [2022-11-02 21:04:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692507173] [2022-11-02 21:04:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:50,241 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 21:04:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692507173] [2022-11-02 21:04:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692507173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:50,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:50,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475350456] [2022-11-02 21:04:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:50,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:50,243 INFO L87 Difference]: Start difference. First operand 5107 states and 19228 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 21:04:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:50,446 INFO L93 Difference]: Finished difference Result 5657 states and 21827 transitions. [2022-11-02 21:04:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 21:04:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:50,478 INFO L225 Difference]: With dead ends: 5657 [2022-11-02 21:04:50,478 INFO L226 Difference]: Without dead ends: 5657 [2022-11-02 21:04:50,478 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 21:04:50,479 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:50,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2022-11-02 21:04:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5481. [2022-11-02 21:04:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 5139 states have (on average 4.162482973341117) internal successors, (21391), 5480 states have internal predecessors, (21391), 0 states have call successors, (0), 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 21:04:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 21391 transitions. [2022-11-02 21:04:50,776 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 21391 transitions. Word has length 8 [2022-11-02 21:04:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:50,777 INFO L495 AbstractCegarLoop]: Abstraction has 5481 states and 21391 transitions. [2022-11-02 21:04:50,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 21:04:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 21391 transitions. [2022-11-02 21:04:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:04:50,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:50,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:50,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:04:50,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1406889305, now seen corresponding path program 1 times [2022-11-02 21:04:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:50,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169590535] [2022-11-02 21:04:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:50,949 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 21:04:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169590535] [2022-11-02 21:04:50,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169590535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:50,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:50,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24942892] [2022-11-02 21:04:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:50,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:50,953 INFO L87 Difference]: Start difference. First operand 5481 states and 21391 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 21:04:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:51,266 INFO L93 Difference]: Finished difference Result 6061 states and 23038 transitions. [2022-11-02 21:04:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 21:04:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:51,324 INFO L225 Difference]: With dead ends: 6061 [2022-11-02 21:04:51,324 INFO L226 Difference]: Without dead ends: 6019 [2022-11-02 21:04:51,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:51,326 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:51,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2022-11-02 21:04:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 5929. [2022-11-02 21:04:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5929 states, 5587 states have (on average 4.077501342402004) internal successors, (22781), 5928 states have internal predecessors, (22781), 0 states have call successors, (0), 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 21:04:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 22781 transitions. [2022-11-02 21:04:51,662 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 22781 transitions. Word has length 8 [2022-11-02 21:04:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:51,663 INFO L495 AbstractCegarLoop]: Abstraction has 5929 states and 22781 transitions. [2022-11-02 21:04:51,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 21:04:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 22781 transitions. [2022-11-02 21:04:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:04:51,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:51,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:51,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:04:51,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1085562495, now seen corresponding path program 1 times [2022-11-02 21:04:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:51,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555324254] [2022-11-02 21:04:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555324254] [2022-11-02 21:04:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555324254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283668831] [2022-11-02 21:04:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:51,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:51,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:04:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 21:04:52,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:52,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:52,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283668831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:52,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:52,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-02 21:04:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12704405] [2022-11-02 21:04:52,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:52,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:04:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:04:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:04:52,210 INFO L87 Difference]: Start difference. First operand 5929 states and 22781 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:04:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:52,753 INFO L93 Difference]: Finished difference Result 6599 states and 23336 transitions. [2022-11-02 21:04:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:04:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:04:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:52,786 INFO L225 Difference]: With dead ends: 6599 [2022-11-02 21:04:52,786 INFO L226 Difference]: Without dead ends: 6513 [2022-11-02 21:04:52,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:04:52,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 397 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:52,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 67 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:04:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2022-11-02 21:04:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5556. [2022-11-02 21:04:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 5214 states have (on average 3.9367088607594938) internal successors, (20526), 5555 states have internal predecessors, (20526), 0 states have call successors, (0), 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 21:04:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 20526 transitions. [2022-11-02 21:04:53,085 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 20526 transitions. Word has length 9 [2022-11-02 21:04:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:53,086 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 20526 transitions. [2022-11-02 21:04:53,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:04:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 20526 transitions. [2022-11-02 21:04:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:04:53,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:53,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:53,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 21:04:53,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -524747990, now seen corresponding path program 1 times [2022-11-02 21:04:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007651990] [2022-11-02 21:04:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:53,373 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 21:04:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007651990] [2022-11-02 21:04:53,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007651990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:53,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:53,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494175510] [2022-11-02 21:04:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:53,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:53,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:53,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:53,376 INFO L87 Difference]: Start difference. First operand 5556 states and 20526 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 21:04:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:53,605 INFO L93 Difference]: Finished difference Result 8504 states and 31764 transitions. [2022-11-02 21:04:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 21:04:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:53,647 INFO L225 Difference]: With dead ends: 8504 [2022-11-02 21:04:53,647 INFO L226 Difference]: Without dead ends: 8504 [2022-11-02 21:04:53,647 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 21:04:53,649 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:53,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2022-11-02 21:04:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 6094. [2022-11-02 21:04:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 5752 states have (on average 4.355180806675939) internal successors, (25051), 6093 states have internal predecessors, (25051), 0 states have call successors, (0), 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 21:04:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 25051 transitions. [2022-11-02 21:04:53,943 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 25051 transitions. Word has length 9 [2022-11-02 21:04:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:53,944 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 25051 transitions. [2022-11-02 21:04:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 21:04:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 25051 transitions. [2022-11-02 21:04:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:04:53,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:53,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:53,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:04:53,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash -524747988, now seen corresponding path program 1 times [2022-11-02 21:04:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68217131] [2022-11-02 21:04:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:54,397 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 21:04:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:54,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68217131] [2022-11-02 21:04:54,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68217131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:54,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:54,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827312708] [2022-11-02 21:04:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:54,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:54,399 INFO L87 Difference]: Start difference. First operand 6094 states and 25051 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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 21:04:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:54,878 INFO L93 Difference]: Finished difference Result 6331 states and 25634 transitions. [2022-11-02 21:04:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:54,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 21:04:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:54,920 INFO L225 Difference]: With dead ends: 6331 [2022-11-02 21:04:54,920 INFO L226 Difference]: Without dead ends: 6094 [2022-11-02 21:04:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:54,921 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:54,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 55 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:04:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2022-11-02 21:04:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 6094. [2022-11-02 21:04:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 5752 states have (on average 4.355006954102921) internal successors, (25050), 6093 states have internal predecessors, (25050), 0 states have call successors, (0), 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 21:04:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 25050 transitions. [2022-11-02 21:04:55,190 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 25050 transitions. Word has length 9 [2022-11-02 21:04:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:55,191 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 25050 transitions. [2022-11-02 21:04:55,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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 21:04:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 25050 transitions. [2022-11-02 21:04:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 21:04:55,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:55,192 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:04:55,193 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1042156967, now seen corresponding path program 2 times [2022-11-02 21:04:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:55,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090887925] [2022-11-02 21:04:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:04:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090887925] [2022-11-02 21:04:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090887925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110774134] [2022-11-02 21:04:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:55,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:55,313 INFO L87 Difference]: Start difference. First operand 6094 states and 25050 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 21:04:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:55,554 INFO L93 Difference]: Finished difference Result 8618 states and 34877 transitions. [2022-11-02 21:04:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-11-02 21:04:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:55,608 INFO L225 Difference]: With dead ends: 8618 [2022-11-02 21:04:55,608 INFO L226 Difference]: Without dead ends: 8618 [2022-11-02 21:04:55,609 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 21:04:55,609 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:55,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8618 states. [2022-11-02 21:04:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8618 to 6670. [2022-11-02 21:04:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6328 states have (on average 4.4061314791403285) internal successors, (27882), 6669 states have internal predecessors, (27882), 0 states have call successors, (0), 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 21:04:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27882 transitions. [2022-11-02 21:04:55,930 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27882 transitions. Word has length 10 [2022-11-02 21:04:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:55,931 INFO L495 AbstractCegarLoop]: Abstraction has 6670 states and 27882 transitions. [2022-11-02 21:04:55,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 21:04:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27882 transitions. [2022-11-02 21:04:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 21:04:55,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:55,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:55,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:04:55,933 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:55,933 INFO L85 PathProgramCache]: Analyzing trace with hash -481342460, now seen corresponding path program 1 times [2022-11-02 21:04:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:55,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021243238] [2022-11-02 21:04:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021243238] [2022-11-02 21:04:56,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021243238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953510429] [2022-11-02 21:04:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:56,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:56,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:04:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:56,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 21:04:56,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:56,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:56,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953510429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:56,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:56,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-02 21:04:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495370846] [2022-11-02 21:04:56,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:56,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:04:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:04:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:04:56,482 INFO L87 Difference]: Start difference. First operand 6670 states and 27882 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 21:04:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:57,014 INFO L93 Difference]: Finished difference Result 6510 states and 26945 transitions. [2022-11-02 21:04:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 21:04:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:57,161 INFO L225 Difference]: With dead ends: 6510 [2022-11-02 21:04:57,161 INFO L226 Difference]: Without dead ends: 6273 [2022-11-02 21:04:57,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:04:57,162 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 163 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:57,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 116 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:04:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2022-11-02 21:04:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6273. [2022-11-02 21:04:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 5931 states have (on average 4.444613050075873) internal successors, (26361), 6272 states have internal predecessors, (26361), 0 states have call successors, (0), 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 21:04:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 26361 transitions. [2022-11-02 21:04:57,358 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 26361 transitions. Word has length 10 [2022-11-02 21:04:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:57,359 INFO L495 AbstractCegarLoop]: Abstraction has 6273 states and 26361 transitions. [2022-11-02 21:04:57,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 21:04:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 26361 transitions. [2022-11-02 21:04:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:04:57,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:57,360 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:57,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:57,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:04:57,573 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 864228908, now seen corresponding path program 2 times [2022-11-02 21:04:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291637526] [2022-11-02 21:04:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:58,059 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 21:04:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:58,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291637526] [2022-11-02 21:04:58,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291637526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:58,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477872789] [2022-11-02 21:04:58,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:04:58,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:58,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:58,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:04:58,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:04:58,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:04:58,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 21:04:58,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:58,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:58,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-02 21:04:58,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:04:58,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:58,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:04:58,475 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 18 treesize of output 20 [2022-11-02 21:04:58,517 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 21:04:58,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:58,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_295) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-11-02 21:04:58,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-02 21:04:58,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:58,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:04:58,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:58,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-02 21:04:58,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-11-02 21:04:58,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:04:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:04:58,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477872789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:58,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:58,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-02 21:04:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951431799] [2022-11-02 21:04:58,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:58,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:04:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:04:58,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=254, Unknown=2, NotChecked=66, Total=380 [2022-11-02 21:04:58,756 INFO L87 Difference]: Start difference. First operand 6273 states and 26361 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:04:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:59,376 INFO L93 Difference]: Finished difference Result 6353 states and 26559 transitions. [2022-11-02 21:04:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:59,376 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:04:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:59,403 INFO L225 Difference]: With dead ends: 6353 [2022-11-02 21:04:59,403 INFO L226 Difference]: Without dead ends: 6353 [2022-11-02 21:04:59,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=386, Unknown=2, NotChecked=82, Total=552 [2022-11-02 21:04:59,404 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2022-11-02 21:04:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2022-11-02 21:04:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6299. [2022-11-02 21:04:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5957 states have (on average 4.436797045492698) internal successors, (26430), 6298 states have internal predecessors, (26430), 0 states have call successors, (0), 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 21:04:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 26430 transitions. [2022-11-02 21:04:59,613 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 26430 transitions. Word has length 11 [2022-11-02 21:04:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:59,614 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 26430 transitions. [2022-11-02 21:04:59,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:04:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 26430 transitions. [2022-11-02 21:04:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:04:59,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:59,615 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:59,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:59,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:59,820 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:04:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 864228912, now seen corresponding path program 1 times [2022-11-02 21:04:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:59,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881885395] [2022-11-02 21:04:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:00,295 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 21:05:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:00,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881885395] [2022-11-02 21:05:00,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881885395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662590215] [2022-11-02 21:05:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:00,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:00,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:05:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:00,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:05:00,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:00,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:00,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:00,579 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 16 treesize of output 18 [2022-11-02 21:05:00,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:00,624 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 16 treesize of output 18 [2022-11-02 21:05:00,665 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 21:05:00,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:00,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_333) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-02 21:05:00,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-02 21:05:00,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:00,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:00,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:00,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:05:00,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:05:00,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:05:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:00,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662590215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:00,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:00,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-02 21:05:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472589398] [2022-11-02 21:05:00,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:05:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:05:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=255, Unknown=2, NotChecked=66, Total=380 [2022-11-02 21:05:00,888 INFO L87 Difference]: Start difference. First operand 6299 states and 26430 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:05:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,630 INFO L93 Difference]: Finished difference Result 6305 states and 26415 transitions. [2022-11-02 21:05:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:05:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,663 INFO L225 Difference]: With dead ends: 6305 [2022-11-02 21:05:01,663 INFO L226 Difference]: Without dead ends: 6305 [2022-11-02 21:05:01,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=417, Unknown=2, NotChecked=86, Total=600 [2022-11-02 21:05:01,664 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 65 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2022-11-02 21:05:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2022-11-02 21:05:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 6299. [2022-11-02 21:05:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5957 states have (on average 4.432768171898607) internal successors, (26406), 6298 states have internal predecessors, (26406), 0 states have call successors, (0), 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 21:05:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 26406 transitions. [2022-11-02 21:05:02,013 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 26406 transitions. Word has length 11 [2022-11-02 21:05:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:02,014 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 26406 transitions. [2022-11-02 21:05:02,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:05:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 26406 transitions. [2022-11-02 21:05:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:05:02,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:02,015 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:02,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:02,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2052873496, now seen corresponding path program 1 times [2022-11-02 21:05:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:02,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335298813] [2022-11-02 21:05:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:02,863 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 21:05:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335298813] [2022-11-02 21:05:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335298813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760427690] [2022-11-02 21:05:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:02,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:02,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:05:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:03,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:05:03,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:03,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:03,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:03,169 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 16 treesize of output 18 [2022-11-02 21:05:03,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:03,262 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 16 treesize of output 18 [2022-11-02 21:05:03,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:03,315 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 21:05:03,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:03,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:03,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) is different from false [2022-11-02 21:05:03,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_380) |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) is different from false [2022-11-02 21:05:03,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:03,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:03,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:03,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-02 21:05:03,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-02 21:05:03,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-11-02 21:05:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:03,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760427690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:03,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:03,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-02 21:05:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407994468] [2022-11-02 21:05:03,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=296, Unknown=3, NotChecked=108, Total=462 [2022-11-02 21:05:03,724 INFO L87 Difference]: Start difference. First operand 6299 states and 26406 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:03,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= c_~t_4~0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_380) |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:03,840 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-02 21:05:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:05,008 INFO L93 Difference]: Finished difference Result 10904 states and 44405 transitions. [2022-11-02 21:05:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:05,076 INFO L225 Difference]: With dead ends: 10904 [2022-11-02 21:05:05,076 INFO L226 Difference]: Without dead ends: 10904 [2022-11-02 21:05:05,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=397, Unknown=5, NotChecked=220, Total=702 [2022-11-02 21:05:05,080 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:05,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 189 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1164 Invalid, 0 Unknown, 357 Unchecked, 1.0s Time] [2022-11-02 21:05:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2022-11-02 21:05:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 6327. [2022-11-02 21:05:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 5985 states have (on average 4.433082706766918) internal successors, (26532), 6326 states have internal predecessors, (26532), 0 states have call successors, (0), 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 21:05:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 26532 transitions. [2022-11-02 21:05:05,388 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 26532 transitions. Word has length 11 [2022-11-02 21:05:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:05,388 INFO L495 AbstractCegarLoop]: Abstraction has 6327 states and 26532 transitions. [2022-11-02 21:05:05,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 26532 transitions. [2022-11-02 21:05:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:05:05,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:05,389 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:05,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 21:05:05,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2052873493, now seen corresponding path program 1 times [2022-11-02 21:05:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:05,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70450363] [2022-11-02 21:05:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,223 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 21:05:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70450363] [2022-11-02 21:05:06,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70450363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980174605] [2022-11-02 21:05:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:06,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:06,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:05:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:06,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:06,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:06,461 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:05:06,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:05:06,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:06,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:06,581 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 18 treesize of output 20 [2022-11-02 21:05:06,632 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:06,633 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 21:05:06,686 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 18 treesize of output 20 [2022-11-02 21:05:06,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:05:06,732 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 21:05:06,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:06,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:06,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:06,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:05:06,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:06,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:05:06,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2022-11-02 21:05:06,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2022-11-02 21:05:07,199 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 21:05:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980174605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:07,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:07,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-02 21:05:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793894137] [2022-11-02 21:05:07,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:07,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=362, Unknown=2, NotChecked=38, Total=462 [2022-11-02 21:05:07,202 INFO L87 Difference]: Start difference. First operand 6327 states and 26532 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:08,326 INFO L93 Difference]: Finished difference Result 11113 states and 45254 transitions. [2022-11-02 21:05:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:08,327 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:08,380 INFO L225 Difference]: With dead ends: 11113 [2022-11-02 21:05:08,380 INFO L226 Difference]: Without dead ends: 11113 [2022-11-02 21:05:08,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=584, Unknown=2, NotChecked=50, Total=756 [2022-11-02 21:05:08,381 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:08,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 155 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 556 Invalid, 0 Unknown, 408 Unchecked, 0.6s Time] [2022-11-02 21:05:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-02 21:05:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 6409. [2022-11-02 21:05:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6409 states, 6067 states have (on average 4.428383055876051) internal successors, (26867), 6408 states have internal predecessors, (26867), 0 states have call successors, (0), 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 21:05:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 26867 transitions. [2022-11-02 21:05:08,618 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 26867 transitions. Word has length 11 [2022-11-02 21:05:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:08,619 INFO L495 AbstractCegarLoop]: Abstraction has 6409 states and 26867 transitions. [2022-11-02 21:05:08,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 26867 transitions. [2022-11-02 21:05:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:08,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:08,620 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:08,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:08,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 21:05:08,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash -372731644, now seen corresponding path program 3 times [2022-11-02 21:05:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:08,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242535964] [2022-11-02 21:05:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242535964] [2022-11-02 21:05:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242535964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884340796] [2022-11-02 21:05:09,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:05:09,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:09,293 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:09,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:05:09,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 21:05:09,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:09,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 21:05:09,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:09,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:09,662 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:05:09,663 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 21:05:09,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:09,708 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 18 treesize of output 20 [2022-11-02 21:05:09,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:09,756 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 18 treesize of output 20 [2022-11-02 21:05:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:09,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:09,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-02 21:05:09,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-02 21:05:09,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_473)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-02 21:05:09,930 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:05:09,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-02 21:05:09,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:09,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:05:09,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-02 21:05:09,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2022-11-02 21:05:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 21:05:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884340796] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:10,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-02 21:05:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570753594] [2022-11-02 21:05:10,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:05:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:05:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=324, Unknown=3, NotChecked=114, Total=506 [2022-11-02 21:05:10,070 INFO L87 Difference]: Start difference. First operand 6409 states and 26867 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 21:05:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:11,079 INFO L93 Difference]: Finished difference Result 6415 states and 26870 transitions. [2022-11-02 21:05:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:11,114 INFO L225 Difference]: With dead ends: 6415 [2022-11-02 21:05:11,114 INFO L226 Difference]: Without dead ends: 6415 [2022-11-02 21:05:11,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=500, Unknown=3, NotChecked=144, Total=756 [2022-11-02 21:05:11,115 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:11,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 90 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 709 Invalid, 0 Unknown, 201 Unchecked, 0.6s Time] [2022-11-02 21:05:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6415 states. [2022-11-02 21:05:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6415 to 6384. [2022-11-02 21:05:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6384 states, 6042 states have (on average 4.43545183714002) internal successors, (26799), 6383 states have internal predecessors, (26799), 0 states have call successors, (0), 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 21:05:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6384 states to 6384 states and 26799 transitions. [2022-11-02 21:05:11,283 INFO L78 Accepts]: Start accepts. Automaton has 6384 states and 26799 transitions. Word has length 12 [2022-11-02 21:05:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:11,283 INFO L495 AbstractCegarLoop]: Abstraction has 6384 states and 26799 transitions. [2022-11-02 21:05:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 21:05:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6384 states and 26799 transitions. [2022-11-02 21:05:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:11,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:11,284 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:11,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:11,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 21:05:11,487 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:11,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 815912944, now seen corresponding path program 2 times [2022-11-02 21:05:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:11,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284664888] [2022-11-02 21:05:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:12,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:12,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284664888] [2022-11-02 21:05:12,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284664888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:12,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794346722] [2022-11-02 21:05:12,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:12,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:12,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:12,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:12,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:05:12,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:12,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:12,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:05:12,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:12,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:12,285 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:05:12,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:05:12,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:12,418 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:05:12,419 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 21:05:12,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:12,466 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 16 treesize of output 18 [2022-11-02 21:05:12,517 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:12,517 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 21:05:12,632 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 16 treesize of output 18 [2022-11-02 21:05:12,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:12,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:12,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_533) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:13,003 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:05:13,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-02 21:05:13,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:13,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-02 21:05:13,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-11-02 21:05:13,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-11-02 21:05:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:13,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794346722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:13,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:13,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:05:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579787884] [2022-11-02 21:05:13,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:13,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:05:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:05:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=4, NotChecked=44, Total=600 [2022-11-02 21:05:13,226 INFO L87 Difference]: Start difference. First operand 6384 states and 26799 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:14,578 INFO L93 Difference]: Finished difference Result 12271 states and 52239 transitions. [2022-11-02 21:05:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:14,653 INFO L225 Difference]: With dead ends: 12271 [2022-11-02 21:05:14,654 INFO L226 Difference]: Without dead ends: 12271 [2022-11-02 21:05:14,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=4, NotChecked=56, Total=930 [2022-11-02 21:05:14,655 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 116 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:14,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 224 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 933 Invalid, 0 Unknown, 567 Unchecked, 0.8s Time] [2022-11-02 21:05:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12271 states. [2022-11-02 21:05:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12271 to 6852. [2022-11-02 21:05:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6510 states have (on average 4.521966205837174) internal successors, (29438), 6851 states have internal predecessors, (29438), 0 states have call successors, (0), 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 21:05:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 29438 transitions. [2022-11-02 21:05:14,947 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 29438 transitions. Word has length 12 [2022-11-02 21:05:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:14,947 INFO L495 AbstractCegarLoop]: Abstraction has 6852 states and 29438 transitions. [2022-11-02 21:05:14,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 29438 transitions. [2022-11-02 21:05:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:14,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:14,949 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:14,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:15,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:05:15,149 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1021293729, now seen corresponding path program 1 times [2022-11-02 21:05:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:15,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441613655] [2022-11-02 21:05:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:15,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441613655] [2022-11-02 21:05:15,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441613655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:15,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790627588] [2022-11-02 21:05:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:15,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:15,309 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:15,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 21:05:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:15,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:05:15,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:15,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:15,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790627588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:15,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:15,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-02 21:05:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386590116] [2022-11-02 21:05:15,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:15,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:05:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:05:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:05:15,707 INFO L87 Difference]: Start difference. First operand 6852 states and 29438 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:05:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:16,621 INFO L93 Difference]: Finished difference Result 11153 states and 45407 transitions. [2022-11-02 21:05:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:16,673 INFO L225 Difference]: With dead ends: 11153 [2022-11-02 21:05:16,673 INFO L226 Difference]: Without dead ends: 11113 [2022-11-02 21:05:16,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:05:16,674 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 348 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:16,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 188 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:05:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-02 21:05:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10021. [2022-11-02 21:05:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10021 states, 9679 states have (on average 4.441987808657919) internal successors, (42994), 10020 states have internal predecessors, (42994), 0 states have call successors, (0), 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 21:05:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 42994 transitions. [2022-11-02 21:05:16,978 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 42994 transitions. Word has length 12 [2022-11-02 21:05:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:16,978 INFO L495 AbstractCegarLoop]: Abstraction has 10021 states and 42994 transitions. [2022-11-02 21:05:16,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:05:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 42994 transitions. [2022-11-02 21:05:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:16,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:16,979 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:17,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:17,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:17,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2015994715, now seen corresponding path program 1 times [2022-11-02 21:05:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:17,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136437366] [2022-11-02 21:05:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,621 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 21:05:17,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:17,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136437366] [2022-11-02 21:05:17,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136437366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:17,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28809495] [2022-11-02 21:05:17,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:17,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:17,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:17,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:17,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 21:05:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 21:05:17,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:17,862 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:05:17,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:05:17,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:17,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:17,968 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 16 treesize of output 18 [2022-11-02 21:05:18,015 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:18,015 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 21:05:18,070 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 16 treesize of output 18 [2022-11-02 21:05:18,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:18,107 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 21:05:18,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:18,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_618) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:18,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:18,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:18,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:18,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:05:18,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-02 21:05:18,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-02 21:05:18,583 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 21:05:18,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28809495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:18,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:18,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-02 21:05:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883869547] [2022-11-02 21:05:18,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:18,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=362, Unknown=2, NotChecked=38, Total=462 [2022-11-02 21:05:18,585 INFO L87 Difference]: Start difference. First operand 10021 states and 42994 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:19,864 INFO L93 Difference]: Finished difference Result 19245 states and 83050 transitions. [2022-11-02 21:05:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:19,864 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:20,018 INFO L225 Difference]: With dead ends: 19245 [2022-11-02 21:05:20,019 INFO L226 Difference]: Without dead ends: 19245 [2022-11-02 21:05:20,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=576, Unknown=2, NotChecked=50, Total=756 [2022-11-02 21:05:20,023 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 144 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:20,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 204 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 964 Invalid, 0 Unknown, 424 Unchecked, 0.8s Time] [2022-11-02 21:05:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19245 states. [2022-11-02 21:05:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19245 to 10129. [2022-11-02 21:05:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10129 states, 9787 states have (on average 4.442219270460815) internal successors, (43476), 10128 states have internal predecessors, (43476), 0 states have call successors, (0), 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 21:05:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10129 states to 10129 states and 43476 transitions. [2022-11-02 21:05:20,564 INFO L78 Accepts]: Start accepts. Automaton has 10129 states and 43476 transitions. Word has length 12 [2022-11-02 21:05:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:20,565 INFO L495 AbstractCegarLoop]: Abstraction has 10129 states and 43476 transitions. [2022-11-02 21:05:20,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10129 states and 43476 transitions. [2022-11-02 21:05:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:20,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:20,566 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:20,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-02 21:05:20,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:20,781 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2015994712, now seen corresponding path program 1 times [2022-11-02 21:05:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:20,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811113724] [2022-11-02 21:05:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,225 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 21:05:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811113724] [2022-11-02 21:05:21,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811113724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155263623] [2022-11-02 21:05:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:21,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:21,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:21,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:21,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:05:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:05:21,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:21,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:21,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:21,537 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 18 treesize of output 20 [2022-11-02 21:05:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:21,629 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 18 treesize of output 20 [2022-11-02 21:05:21,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:05:21,668 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 21:05:21,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:21,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:21,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-02 21:05:21,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int) (v_ArrVal_665 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-11-02 21:05:21,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:05:21,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-02 21:05:21,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-11-02 21:05:21,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:05:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155263623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:21,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-02 21:05:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517573276] [2022-11-02 21:05:21,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:21,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=296, Unknown=3, NotChecked=108, Total=462 [2022-11-02 21:05:21,908 INFO L87 Difference]: Start difference. First operand 10129 states and 43476 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:22,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int) (v_ArrVal_665 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 9223372039002259456)))) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:22,011 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-02 21:05:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:22,989 INFO L93 Difference]: Finished difference Result 18163 states and 75490 transitions. [2022-11-02 21:05:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:23,073 INFO L225 Difference]: With dead ends: 18163 [2022-11-02 21:05:23,074 INFO L226 Difference]: Without dead ends: 18155 [2022-11-02 21:05:23,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=397, Unknown=5, NotChecked=220, Total=702 [2022-11-02 21:05:23,075 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:23,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 181 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1047 Invalid, 0 Unknown, 273 Unchecked, 0.8s Time] [2022-11-02 21:05:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18155 states. [2022-11-02 21:05:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18155 to 10725. [2022-11-02 21:05:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10725 states, 10383 states have (on average 4.444187614369643) internal successors, (46144), 10724 states have internal predecessors, (46144), 0 states have call successors, (0), 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 21:05:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10725 states to 10725 states and 46144 transitions. [2022-11-02 21:05:23,505 INFO L78 Accepts]: Start accepts. Automaton has 10725 states and 46144 transitions. Word has length 12 [2022-11-02 21:05:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:23,505 INFO L495 AbstractCegarLoop]: Abstraction has 10725 states and 46144 transitions. [2022-11-02 21:05:23,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 10725 states and 46144 transitions. [2022-11-02 21:05:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:23,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:23,507 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:23,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 21:05:23,709 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -785427169, now seen corresponding path program 2 times [2022-11-02 21:05:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:23,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6271581] [2022-11-02 21:05:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:24,131 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 21:05:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:24,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6271581] [2022-11-02 21:05:24,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6271581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:24,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395909013] [2022-11-02 21:05:24,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:24,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:24,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:24,133 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:24,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 21:05:24,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:24,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:24,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 21:05:24,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:24,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:24,373 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:05:24,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:05:24,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:24,472 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 16 treesize of output 18 [2022-11-02 21:05:24,517 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:24,518 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 21:05:24,563 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 16 treesize of output 18 [2022-11-02 21:05:24,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:24,602 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 21:05:24,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:24,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_717) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:24,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:24,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:24,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:24,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:05:24,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:05:24,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:05:25,011 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 21:05:25,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395909013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:25,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:25,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-02 21:05:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42654992] [2022-11-02 21:05:25,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:25,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:25,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=367, Unknown=2, NotChecked=38, Total=462 [2022-11-02 21:05:25,014 INFO L87 Difference]: Start difference. First operand 10725 states and 46144 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:26,126 INFO L93 Difference]: Finished difference Result 15081 states and 65331 transitions. [2022-11-02 21:05:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:05:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:26,190 INFO L225 Difference]: With dead ends: 15081 [2022-11-02 21:05:26,190 INFO L226 Difference]: Without dead ends: 15073 [2022-11-02 21:05:26,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=725, Unknown=2, NotChecked=56, Total=930 [2022-11-02 21:05:26,191 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 267 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:26,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 100 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 656 Invalid, 0 Unknown, 411 Unchecked, 0.6s Time] [2022-11-02 21:05:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15073 states. [2022-11-02 21:05:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15073 to 10361. [2022-11-02 21:05:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10361 states, 10019 states have (on average 4.431080946202216) internal successors, (44395), 10360 states have internal predecessors, (44395), 0 states have call successors, (0), 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 21:05:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10361 states to 10361 states and 44395 transitions. [2022-11-02 21:05:26,667 INFO L78 Accepts]: Start accepts. Automaton has 10361 states and 44395 transitions. Word has length 12 [2022-11-02 21:05:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:26,668 INFO L495 AbstractCegarLoop]: Abstraction has 10361 states and 44395 transitions. [2022-11-02 21:05:26,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:05:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10361 states and 44395 transitions. [2022-11-02 21:05:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:05:26,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:26,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:26,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:26,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:26,871 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash -785429683, now seen corresponding path program 1 times [2022-11-02 21:05:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:26,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822999585] [2022-11-02 21:05:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:27,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:27,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822999585] [2022-11-02 21:05:27,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822999585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:27,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245130250] [2022-11-02 21:05:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:27,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:27,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:27,197 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:27,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 21:05:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:05:27,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:27,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:27,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245130250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:27,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:27,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-02 21:05:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120948182] [2022-11-02 21:05:27,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:05:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:05:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:05:27,631 INFO L87 Difference]: Start difference. First operand 10361 states and 44395 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:28,367 INFO L93 Difference]: Finished difference Result 8551 states and 34978 transitions. [2022-11-02 21:05:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 21:05:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:28,420 INFO L225 Difference]: With dead ends: 8551 [2022-11-02 21:05:28,420 INFO L226 Difference]: Without dead ends: 8503 [2022-11-02 21:05:28,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:05:28,422 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:28,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 121 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:05:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2022-11-02 21:05:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8049. [2022-11-02 21:05:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8049 states, 7707 states have (on average 4.373816011418191) internal successors, (33709), 8048 states have internal predecessors, (33709), 0 states have call successors, (0), 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 21:05:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8049 states to 8049 states and 33709 transitions. [2022-11-02 21:05:28,773 INFO L78 Accepts]: Start accepts. Automaton has 8049 states and 33709 transitions. Word has length 12 [2022-11-02 21:05:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:28,773 INFO L495 AbstractCegarLoop]: Abstraction has 8049 states and 33709 transitions. [2022-11-02 21:05:28,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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 21:05:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8049 states and 33709 transitions. [2022-11-02 21:05:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:28,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:28,776 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:28,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:29,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 21:05:29,001 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222281, now seen corresponding path program 2 times [2022-11-02 21:05:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:29,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055146265] [2022-11-02 21:05:29,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:29,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055146265] [2022-11-02 21:05:29,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055146265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:29,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:29,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771424360] [2022-11-02 21:05:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:29,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:29,086 INFO L87 Difference]: Start difference. First operand 8049 states and 33709 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:29,256 INFO L93 Difference]: Finished difference Result 7475 states and 31423 transitions. [2022-11-02 21:05:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:29,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 13 [2022-11-02 21:05:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:29,307 INFO L225 Difference]: With dead ends: 7475 [2022-11-02 21:05:29,307 INFO L226 Difference]: Without dead ends: 7475 [2022-11-02 21:05:29,307 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 21:05:29,308 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:29,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2022-11-02 21:05:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 7475. [2022-11-02 21:05:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7182 states have (on average 4.375243664717349) internal successors, (31423), 7474 states have internal predecessors, (31423), 0 states have call successors, (0), 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 21:05:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 31423 transitions. [2022-11-02 21:05:29,677 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 31423 transitions. Word has length 13 [2022-11-02 21:05:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:29,677 INFO L495 AbstractCegarLoop]: Abstraction has 7475 states and 31423 transitions. [2022-11-02 21:05:29,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 31423 transitions. [2022-11-02 21:05:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:29,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:29,678 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:29,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:05:29,678 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222282, now seen corresponding path program 1 times [2022-11-02 21:05:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654596366] [2022-11-02 21:05:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:29,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654596366] [2022-11-02 21:05:29,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654596366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:29,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:29,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873165737] [2022-11-02 21:05:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:29,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:29,771 INFO L87 Difference]: Start difference. First operand 7475 states and 31423 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:30,148 INFO L93 Difference]: Finished difference Result 6901 states and 29137 transitions. [2022-11-02 21:05:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 13 [2022-11-02 21:05:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:30,210 INFO L225 Difference]: With dead ends: 6901 [2022-11-02 21:05:30,210 INFO L226 Difference]: Without dead ends: 6901 [2022-11-02 21:05:30,218 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 21:05:30,219 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:30,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2022-11-02 21:05:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6333. [2022-11-02 21:05:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6333 states, 6089 states have (on average 3.9523731318771556) internal successors, (24066), 6332 states have internal predecessors, (24066), 0 states have call successors, (0), 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 21:05:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 24066 transitions. [2022-11-02 21:05:30,418 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 24066 transitions. Word has length 13 [2022-11-02 21:05:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:30,418 INFO L495 AbstractCegarLoop]: Abstraction has 6333 states and 24066 transitions. [2022-11-02 21:05:30,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 24066 transitions. [2022-11-02 21:05:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:30,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:30,419 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:30,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:05:30,420 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222283, now seen corresponding path program 1 times [2022-11-02 21:05:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:30,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549427955] [2022-11-02 21:05:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:31,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:31,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549427955] [2022-11-02 21:05:31,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549427955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:31,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274896359] [2022-11-02 21:05:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:31,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:31,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:31,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 21:05:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:31,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:31,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:31,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:31,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:31,398 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 18 treesize of output 20 [2022-11-02 21:05:31,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:31,443 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 18 treesize of output 20 [2022-11-02 21:05:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:31,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:31,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_841) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-02 21:05:31,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-02 21:05:31,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:05:31,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:05:31,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-02 21:05:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-02 21:05:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 21:05:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274896359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:31,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:31,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-02 21:05:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400606568] [2022-11-02 21:05:31,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:31,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:05:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:05:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=483, Unknown=2, NotChecked=90, Total=650 [2022-11-02 21:05:31,799 INFO L87 Difference]: Start difference. First operand 6333 states and 24066 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:33,106 INFO L93 Difference]: Finished difference Result 6569 states and 24572 transitions. [2022-11-02 21:05:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:33,106 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 21:05:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:33,138 INFO L225 Difference]: With dead ends: 6569 [2022-11-02 21:05:33,138 INFO L226 Difference]: Without dead ends: 6569 [2022-11-02 21:05:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=804, Unknown=2, NotChecked=118, Total=1056 [2022-11-02 21:05:33,139 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:33,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 138 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 979 Invalid, 0 Unknown, 168 Unchecked, 0.9s Time] [2022-11-02 21:05:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2022-11-02 21:05:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6339. [2022-11-02 21:05:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6095 states have (on average 3.9529122231337164) internal successors, (24093), 6338 states have internal predecessors, (24093), 0 states have call successors, (0), 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 21:05:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 24093 transitions. [2022-11-02 21:05:33,369 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 24093 transitions. Word has length 13 [2022-11-02 21:05:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:33,369 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 24093 transitions. [2022-11-02 21:05:33,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 24093 transitions. [2022-11-02 21:05:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:33,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:33,370 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:33,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 21:05:33,573 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222287, now seen corresponding path program 1 times [2022-11-02 21:05:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:33,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759528519] [2022-11-02 21:05:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759528519] [2022-11-02 21:05:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759528519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:34,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097872292] [2022-11-02 21:05:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:34,039 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:34,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 21:05:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:34,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:34,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:34,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:34,372 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 16 treesize of output 18 [2022-11-02 21:05:34,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:34,416 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 16 treesize of output 18 [2022-11-02 21:05:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:34,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:34,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_883) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-02 21:05:34,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-02 21:05:34,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:34,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-02 21:05:34,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-11-02 21:05:34,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-11-02 21:05:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 21:05:34,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097872292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:34,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:34,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-02 21:05:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805813681] [2022-11-02 21:05:34,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:05:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:05:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=483, Unknown=2, NotChecked=90, Total=650 [2022-11-02 21:05:34,824 INFO L87 Difference]: Start difference. First operand 6339 states and 24093 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:35,823 INFO L93 Difference]: Finished difference Result 6569 states and 24566 transitions. [2022-11-02 21:05:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 21:05:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:35,844 INFO L225 Difference]: With dead ends: 6569 [2022-11-02 21:05:35,844 INFO L226 Difference]: Without dead ends: 6569 [2022-11-02 21:05:35,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=804, Unknown=2, NotChecked=118, Total=1056 [2022-11-02 21:05:35,845 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 181 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:35,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 125 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 815 Invalid, 0 Unknown, 208 Unchecked, 0.6s Time] [2022-11-02 21:05:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2022-11-02 21:05:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6339. [2022-11-02 21:05:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6095 states have (on average 3.9519278096800656) internal successors, (24087), 6338 states have internal predecessors, (24087), 0 states have call successors, (0), 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 21:05:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 24087 transitions. [2022-11-02 21:05:36,041 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 24087 transitions. Word has length 13 [2022-11-02 21:05:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:36,041 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 24087 transitions. [2022-11-02 21:05:36,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 24087 transitions. [2022-11-02 21:05:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:36,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:36,042 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:36,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:36,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:36,253 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1970044032, now seen corresponding path program 2 times [2022-11-02 21:05:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:36,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396615879] [2022-11-02 21:05:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396615879] [2022-11-02 21:05:36,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396615879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135784210] [2022-11-02 21:05:36,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:36,689 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:36,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 21:05:36,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:36,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:36,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 21:05:36,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:36,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:36,965 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:05:36,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:05:37,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:37,112 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:05:37,112 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 21:05:37,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:37,159 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 18 treesize of output 20 [2022-11-02 21:05:37,203 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:37,204 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 21:05:37,260 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 18 treesize of output 20 [2022-11-02 21:05:37,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:05:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:37,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:37,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_940) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:37,614 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:05:37,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-02 21:05:37,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:37,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:05:37,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-02 21:05:37,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-02 21:05:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:37,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135784210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:37,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:37,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:05:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070591741] [2022-11-02 21:05:37,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:05:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:05:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=4, NotChecked=44, Total=600 [2022-11-02 21:05:37,874 INFO L87 Difference]: Start difference. First operand 6339 states and 24087 transitions. Second operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 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 21:05:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:38,891 INFO L93 Difference]: Finished difference Result 8659 states and 32275 transitions. [2022-11-02 21:05:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:05:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 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 21:05:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:38,925 INFO L225 Difference]: With dead ends: 8659 [2022-11-02 21:05:38,925 INFO L226 Difference]: Without dead ends: 8627 [2022-11-02 21:05:38,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=981, Unknown=4, NotChecked=66, Total=1260 [2022-11-02 21:05:38,926 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 221 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:38,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 77 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 461 Invalid, 0 Unknown, 668 Unchecked, 0.4s Time] [2022-11-02 21:05:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2022-11-02 21:05:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 6141. [2022-11-02 21:05:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 5897 states have (on average 3.8899440393420384) internal successors, (22939), 6140 states have internal predecessors, (22939), 0 states have call successors, (0), 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 21:05:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 22939 transitions. [2022-11-02 21:05:39,181 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 22939 transitions. Word has length 13 [2022-11-02 21:05:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:39,182 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 22939 transitions. [2022-11-02 21:05:39,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 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 21:05:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 22939 transitions. [2022-11-02 21:05:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:39,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:39,183 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:39,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:39,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 21:05:39,384 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash -476501132, now seen corresponding path program 1 times [2022-11-02 21:05:39,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:39,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485525264] [2022-11-02 21:05:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:39,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485525264] [2022-11-02 21:05:39,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485525264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:39,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067688970] [2022-11-02 21:05:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:39,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:39,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 21:05:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:39,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:05:39,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:39,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067688970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:39,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:39,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-02 21:05:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073436732] [2022-11-02 21:05:39,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:39,753 INFO L87 Difference]: Start difference. First operand 6141 states and 22939 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:05:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:40,238 INFO L93 Difference]: Finished difference Result 14947 states and 54472 transitions. [2022-11-02 21:05:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:05:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:40,300 INFO L225 Difference]: With dead ends: 14947 [2022-11-02 21:05:40,300 INFO L226 Difference]: Without dead ends: 14947 [2022-11-02 21:05:40,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:40,301 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 298 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:40,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 45 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:05:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-11-02 21:05:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 9345. [2022-11-02 21:05:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9345 states, 9101 states have (on average 4.476760795516976) internal successors, (40743), 9344 states have internal predecessors, (40743), 0 states have call successors, (0), 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 21:05:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 40743 transitions. [2022-11-02 21:05:40,769 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 40743 transitions. Word has length 13 [2022-11-02 21:05:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:40,769 INFO L495 AbstractCegarLoop]: Abstraction has 9345 states and 40743 transitions. [2022-11-02 21:05:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:05:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 40743 transitions. [2022-11-02 21:05:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:40,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:40,770 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:40,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:40,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 21:05:40,971 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -476501131, now seen corresponding path program 2 times [2022-11-02 21:05:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86124921] [2022-11-02 21:05:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:41,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86124921] [2022-11-02 21:05:41,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86124921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:41,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:41,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105278971] [2022-11-02 21:05:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:41,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:41,106 INFO L87 Difference]: Start difference. First operand 9345 states and 40743 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:41,252 INFO L93 Difference]: Finished difference Result 8175 states and 34744 transitions. [2022-11-02 21:05:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 13 [2022-11-02 21:05:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:41,300 INFO L225 Difference]: With dead ends: 8175 [2022-11-02 21:05:41,300 INFO L226 Difference]: Without dead ends: 8175 [2022-11-02 21:05:41,301 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 21:05:41,302 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:41,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2022-11-02 21:05:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8175. [2022-11-02 21:05:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 7996 states have (on average 4.345172586293146) internal successors, (34744), 8174 states have internal predecessors, (34744), 0 states have call successors, (0), 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 21:05:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 34744 transitions. [2022-11-02 21:05:41,793 INFO L78 Accepts]: Start accepts. Automaton has 8175 states and 34744 transitions. Word has length 13 [2022-11-02 21:05:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 8175 states and 34744 transitions. [2022-11-02 21:05:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8175 states and 34744 transitions. [2022-11-02 21:05:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:41,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:41,795 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:41,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:05:41,796 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash -476501129, now seen corresponding path program 1 times [2022-11-02 21:05:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:41,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259718592] [2022-11-02 21:05:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:41,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259718592] [2022-11-02 21:05:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259718592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:41,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:41,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199893821] [2022-11-02 21:05:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:41,886 INFO L87 Difference]: Start difference. First operand 8175 states and 34744 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:42,016 INFO L93 Difference]: Finished difference Result 7077 states and 29313 transitions. [2022-11-02 21:05:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 13 [2022-11-02 21:05:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:42,055 INFO L225 Difference]: With dead ends: 7077 [2022-11-02 21:05:42,056 INFO L226 Difference]: Without dead ends: 7077 [2022-11-02 21:05:42,057 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 21:05:42,058 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:42,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 9 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2022-11-02 21:05:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 7077. [2022-11-02 21:05:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 6953 states have (on average 4.215878038256868) internal successors, (29313), 7076 states have internal predecessors, (29313), 0 states have call successors, (0), 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 21:05:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 29313 transitions. [2022-11-02 21:05:42,451 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 29313 transitions. Word has length 13 [2022-11-02 21:05:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 7077 states and 29313 transitions. [2022-11-02 21:05:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 29313 transitions. [2022-11-02 21:05:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:05:42,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:42,453 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:42,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:05:42,453 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -476501127, now seen corresponding path program 1 times [2022-11-02 21:05:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192115314] [2022-11-02 21:05:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:05:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:42,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192115314] [2022-11-02 21:05:42,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192115314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:42,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:42,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061821771] [2022-11-02 21:05:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:42,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:42,501 INFO L87 Difference]: Start difference. First operand 7077 states and 29313 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:42,606 INFO L93 Difference]: Finished difference Result 5871 states and 23030 transitions. [2022-11-02 21:05:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 13 [2022-11-02 21:05:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:42,635 INFO L225 Difference]: With dead ends: 5871 [2022-11-02 21:05:42,636 INFO L226 Difference]: Without dead ends: 5871 [2022-11-02 21:05:42,636 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 21:05:42,637 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:42,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2022-11-02 21:05:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5871. [2022-11-02 21:05:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5792 states have (on average 3.9761740331491713) internal successors, (23030), 5870 states have internal predecessors, (23030), 0 states have call successors, (0), 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 21:05:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 23030 transitions. [2022-11-02 21:05:42,825 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 23030 transitions. Word has length 13 [2022-11-02 21:05:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:42,825 INFO L495 AbstractCegarLoop]: Abstraction has 5871 states and 23030 transitions. [2022-11-02 21:05:42,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 21:05:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 23030 transitions. [2022-11-02 21:05:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:43,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:43,006 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:05:43,006 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1712780828, now seen corresponding path program 2 times [2022-11-02 21:05:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:43,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530019377] [2022-11-02 21:05:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530019377] [2022-11-02 21:05:43,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530019377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528485236] [2022-11-02 21:05:43,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:43,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:43,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:43,274 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:43,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 21:05:43,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:43,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:43,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 21:05:43,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:43,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:43,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528485236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:43,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:43,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-02 21:05:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571298385] [2022-11-02 21:05:43,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:43,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:05:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:05:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:05:43,810 INFO L87 Difference]: Start difference. First operand 5871 states and 23030 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 21:05:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:45,118 INFO L93 Difference]: Finished difference Result 12276 states and 48193 transitions. [2022-11-02 21:05:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:05:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:05:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:45,179 INFO L225 Difference]: With dead ends: 12276 [2022-11-02 21:05:45,179 INFO L226 Difference]: Without dead ends: 12232 [2022-11-02 21:05:45,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 21:05:45,181 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 814 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:45,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 321 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:05:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12232 states. [2022-11-02 21:05:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12232 to 7314. [2022-11-02 21:05:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7314 states, 7235 states have (on average 4.0217000691085) internal successors, (29097), 7313 states have internal predecessors, (29097), 0 states have call successors, (0), 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 21:05:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7314 states to 7314 states and 29097 transitions. [2022-11-02 21:05:45,502 INFO L78 Accepts]: Start accepts. Automaton has 7314 states and 29097 transitions. Word has length 14 [2022-11-02 21:05:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:45,502 INFO L495 AbstractCegarLoop]: Abstraction has 7314 states and 29097 transitions. [2022-11-02 21:05:45,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 21:05:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7314 states and 29097 transitions. [2022-11-02 21:05:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:45,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:45,503 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:45,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:45,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:45,705 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1886632068, now seen corresponding path program 1 times [2022-11-02 21:05:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:45,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118283250] [2022-11-02 21:05:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118283250] [2022-11-02 21:05:46,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118283250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738820960] [2022-11-02 21:05:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:46,185 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:46,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 21:05:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:46,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:46,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:46,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:46,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:46,604 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 16 treesize of output 18 [2022-11-02 21:05:46,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:46,677 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 16 treesize of output 18 [2022-11-02 21:05:46,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:46,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:46,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:46,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)))) is different from false [2022-11-02 21:05:46,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1149) |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-02 21:05:46,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:46,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:05:46,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:46,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:05:46,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:05:46,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:05:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 21:05:47,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738820960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:47,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:47,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-02 21:05:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239433938] [2022-11-02 21:05:47,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:47,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:05:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:47,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:05:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=538, Unknown=3, NotChecked=144, Total=756 [2022-11-02 21:05:47,166 INFO L87 Difference]: Start difference. First operand 7314 states and 29097 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:47,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= (select .cse0 8) 2147483647) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse0 .cse1) 2147483647) (<= c_~t_4~0 2147483647) (forall ((v_ArrVal_1149 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1149) |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 4294967296))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:47,357 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-02 21:05:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:48,328 INFO L93 Difference]: Finished difference Result 10951 states and 42870 transitions. [2022-11-02 21:05:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:05:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:05:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:48,370 INFO L225 Difference]: With dead ends: 10951 [2022-11-02 21:05:48,370 INFO L226 Difference]: Without dead ends: 10951 [2022-11-02 21:05:48,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=942, Unknown=5, NotChecked=330, Total=1406 [2022-11-02 21:05:48,372 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 340 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:48,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 214 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1094 Invalid, 0 Unknown, 471 Unchecked, 0.8s Time] [2022-11-02 21:05:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2022-11-02 21:05:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 7593. [2022-11-02 21:05:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7514 states have (on average 4.053633217993079) internal successors, (30459), 7592 states have internal predecessors, (30459), 0 states have call successors, (0), 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 21:05:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 30459 transitions. [2022-11-02 21:05:48,584 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 30459 transitions. Word has length 14 [2022-11-02 21:05:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:48,584 INFO L495 AbstractCegarLoop]: Abstraction has 7593 states and 30459 transitions. [2022-11-02 21:05:48,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 30459 transitions. [2022-11-02 21:05:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:48,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:48,586 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:48,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:48,787 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1886632071, now seen corresponding path program 1 times [2022-11-02 21:05:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11377457] [2022-11-02 21:05:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:49,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11377457] [2022-11-02 21:05:49,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11377457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:49,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837301704] [2022-11-02 21:05:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:49,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:49,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:49,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:49,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-02 21:05:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:49,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:49,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:49,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:49,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:49,647 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 18 treesize of output 20 [2022-11-02 21:05:49,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:49,733 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 18 treesize of output 20 [2022-11-02 21:05:49,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:05:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:49,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:49,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1202) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:49,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) is different from false [2022-11-02 21:05:49,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1201) |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) is different from false [2022-11-02 21:05:49,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:49,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:05:49,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:49,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:05:49,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-02 21:05:49,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2022-11-02 21:05:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 21:05:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837301704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:50,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:50,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-02 21:05:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412910640] [2022-11-02 21:05:50,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:05:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:05:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=542, Unknown=3, NotChecked=144, Total=756 [2022-11-02 21:05:50,122 INFO L87 Difference]: Start difference. First operand 7593 states and 30459 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:50,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1201) |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:50,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 .cse1) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((v_ArrVal_1202 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) c_~X_0~0.base) .cse1) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-02 21:05:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:51,595 INFO L93 Difference]: Finished difference Result 10951 states and 42618 transitions. [2022-11-02 21:05:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:05:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:05:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:51,635 INFO L225 Difference]: With dead ends: 10951 [2022-11-02 21:05:51,635 INFO L226 Difference]: Without dead ends: 10943 [2022-11-02 21:05:51,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=1065, Unknown=5, NotChecked=350, Total=1560 [2022-11-02 21:05:51,636 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 380 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 525 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:51,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 277 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1317 Invalid, 0 Unknown, 525 Unchecked, 1.0s Time] [2022-11-02 21:05:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10943 states. [2022-11-02 21:05:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10943 to 7338. [2022-11-02 21:05:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7338 states, 7259 states have (on average 4.018735362997658) internal successors, (29172), 7337 states have internal predecessors, (29172), 0 states have call successors, (0), 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 21:05:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 29172 transitions. [2022-11-02 21:05:51,829 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 29172 transitions. Word has length 14 [2022-11-02 21:05:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:51,830 INFO L495 AbstractCegarLoop]: Abstraction has 7338 states and 29172 transitions. [2022-11-02 21:05:51,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 29172 transitions. [2022-11-02 21:05:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:51,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:51,831 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:51,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:52,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-02 21:05:52,039 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2134825483, now seen corresponding path program 1 times [2022-11-02 21:05:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:52,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32752221] [2022-11-02 21:05:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:52,486 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 21:05:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:52,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32752221] [2022-11-02 21:05:52,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32752221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137146946] [2022-11-02 21:05:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:52,489 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:52,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-02 21:05:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:52,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:05:52,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:52,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:52,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:52,793 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 16 treesize of output 18 [2022-11-02 21:05:52,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:52,881 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 16 treesize of output 18 [2022-11-02 21:05:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:52,918 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 16 treesize of output 18 [2022-11-02 21:05:52,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:52,951 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 21:05:52,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:53,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:53,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:05:53,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296))) is different from false [2022-11-02 21:05:53,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1253) |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-02 21:05:53,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:53,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:05:53,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:53,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-02 21:05:53,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2022-11-02 21:05:53,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 206 [2022-11-02 21:05:53,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-11-02 21:05:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:53,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137146946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:53,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:53,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:05:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263124588] [2022-11-02 21:05:53,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:53,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:05:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:53,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:05:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2022-11-02 21:05:53,547 INFO L87 Difference]: Start difference. First operand 7338 states and 29172 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:53,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1253) |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= c_~t_4~0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:53,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) .cse0) 4294967296))) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select .cse1 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= c_~X_0~0.offset 0))) is different from false [2022-11-02 21:05:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:54,481 INFO L93 Difference]: Finished difference Result 11242 states and 43318 transitions. [2022-11-02 21:05:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:05:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:54,520 INFO L225 Difference]: With dead ends: 11242 [2022-11-02 21:05:54,521 INFO L226 Difference]: Without dead ends: 11242 [2022-11-02 21:05:54,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=476, Unknown=6, NotChecked=294, Total=870 [2022-11-02 21:05:54,522 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 118 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:54,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 160 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1101 Invalid, 0 Unknown, 403 Unchecked, 0.7s Time] [2022-11-02 21:05:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11242 states. [2022-11-02 21:05:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11242 to 7500. [2022-11-02 21:05:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7500 states, 7421 states have (on average 4.017787360194044) internal successors, (29816), 7499 states have internal predecessors, (29816), 0 states have call successors, (0), 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 21:05:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 29816 transitions. [2022-11-02 21:05:54,708 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 29816 transitions. Word has length 14 [2022-11-02 21:05:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:54,708 INFO L495 AbstractCegarLoop]: Abstraction has 7500 states and 29816 transitions. [2022-11-02 21:05:54,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 29816 transitions. [2022-11-02 21:05:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:54,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:54,710 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:54,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:54,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-02 21:05:54,929 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2134825480, now seen corresponding path program 1 times [2022-11-02 21:05:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:54,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653804971] [2022-11-02 21:05:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:55,380 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 21:05:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653804971] [2022-11-02 21:05:55,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653804971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591521913] [2022-11-02 21:05:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:55,382 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:55,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-02 21:05:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:55,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:05:55,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:55,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:55,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:55,770 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 18 treesize of output 20 [2022-11-02 21:05:55,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:55,871 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 18 treesize of output 20 [2022-11-02 21:05:55,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:55,917 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 18 treesize of output 20 [2022-11-02 21:05:55,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:05:55,951 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 21:05:55,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:56,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:56,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:05:56,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-02 21:05:56,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)))) is different from false [2022-11-02 21:05:56,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:56,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:05:56,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:56,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-02 21:05:56,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2022-11-02 21:05:56,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 238 [2022-11-02 21:05:56,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-02 21:05:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:56,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591521913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:56,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:56,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:05:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604619854] [2022-11-02 21:05:56,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:05:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:05:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=367, Unknown=4, NotChecked=164, Total=600 [2022-11-02 21:05:56,399 INFO L87 Difference]: Start difference. First operand 7500 states and 29816 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:56,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse2 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) .cse2) 9223372039002259456)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:05:56,634 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) .cse1) 9223372039002259456)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-02 21:05:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:57,441 INFO L93 Difference]: Finished difference Result 13195 states and 52606 transitions. [2022-11-02 21:05:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:05:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:57,495 INFO L225 Difference]: With dead ends: 13195 [2022-11-02 21:05:57,495 INFO L226 Difference]: Without dead ends: 13163 [2022-11-02 21:05:57,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=520, Unknown=6, NotChecked=306, Total=930 [2022-11-02 21:05:57,496 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 163 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:57,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 177 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1000 Invalid, 0 Unknown, 512 Unchecked, 0.7s Time] [2022-11-02 21:05:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2022-11-02 21:05:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 8444. [2022-11-02 21:05:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8444 states, 8365 states have (on average 4.098266586969515) internal successors, (34282), 8443 states have internal predecessors, (34282), 0 states have call successors, (0), 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 21:05:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 34282 transitions. [2022-11-02 21:05:57,799 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 34282 transitions. Word has length 14 [2022-11-02 21:05:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:57,799 INFO L495 AbstractCegarLoop]: Abstraction has 8444 states and 34282 transitions. [2022-11-02 21:05:57,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:05:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 34282 transitions. [2022-11-02 21:05:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:05:57,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:57,801 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:57,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:58,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-02 21:05:58,001 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:05:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2129593774, now seen corresponding path program 1 times [2022-11-02 21:05:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:58,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659111989] [2022-11-02 21:05:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,437 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 21:05:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:58,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659111989] [2022-11-02 21:05:58,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659111989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995993243] [2022-11-02 21:05:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:58,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:58,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:58,439 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:58,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-02 21:05:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:05:58,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:58,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:58,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:58,726 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:05:58,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-02 21:05:58,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:58,832 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 18 treesize of output 20 [2022-11-02 21:05:58,891 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:58,891 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 21:05:58,940 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 18 treesize of output 20 [2022-11-02 21:05:58,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:58,973 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 18 treesize of output 20 [2022-11-02 21:05:59,032 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 21:05:59,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:59,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1364 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1364) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-02 21:05:59,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1363 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1363) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1364) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-02 21:05:59,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:05:59,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:59,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-02 21:05:59,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2022-11-02 21:05:59,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-02 21:05:59,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-02 21:05:59,509 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 21:05:59,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995993243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:59,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:59,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-02 21:05:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974465565] [2022-11-02 21:05:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:05:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:05:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=470, Unknown=3, NotChecked=90, Total=650 [2022-11-02 21:05:59,511 INFO L87 Difference]: Start difference. First operand 8444 states and 34282 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:00,704 INFO L93 Difference]: Finished difference Result 8780 states and 35382 transitions. [2022-11-02 21:06:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:06:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:00,732 INFO L225 Difference]: With dead ends: 8780 [2022-11-02 21:06:00,732 INFO L226 Difference]: Without dead ends: 8780 [2022-11-02 21:06:00,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=857, Unknown=3, NotChecked=126, Total=1190 [2022-11-02 21:06:00,733 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 236 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:00,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 84 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 531 Invalid, 0 Unknown, 352 Unchecked, 0.5s Time] [2022-11-02 21:06:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2022-11-02 21:06:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 8526. [2022-11-02 21:06:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8526 states, 8447 states have (on average 4.118740381200427) internal successors, (34791), 8525 states have internal predecessors, (34791), 0 states have call successors, (0), 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 21:06:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 34791 transitions. [2022-11-02 21:06:00,896 INFO L78 Accepts]: Start accepts. Automaton has 8526 states and 34791 transitions. Word has length 14 [2022-11-02 21:06:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:00,897 INFO L495 AbstractCegarLoop]: Abstraction has 8526 states and 34791 transitions. [2022-11-02 21:06:00,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8526 states and 34791 transitions. [2022-11-02 21:06:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:00,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:00,898 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:00,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:01,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-02 21:06:01,099 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2129593778, now seen corresponding path program 1 times [2022-11-02 21:06:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24853611] [2022-11-02 21:06:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,525 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 21:06:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24853611] [2022-11-02 21:06:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24853611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182042875] [2022-11-02 21:06:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:01,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:01,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:01,529 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:01,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-02 21:06:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:06:01,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:01,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:01,897 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 16 treesize of output 18 [2022-11-02 21:06:02,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:02,002 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 16 treesize of output 18 [2022-11-02 21:06:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:02,041 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 16 treesize of output 18 [2022-11-02 21:06:02,091 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 21:06:02,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:02,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-02 21:06:02,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-02 21:06:02,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-11-02 21:06:02,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1415) |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)))) is different from false [2022-11-02 21:06:02,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:02,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:06:02,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:02,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-02 21:06:02,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2022-11-02 21:06:02,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 214 [2022-11-02 21:06:02,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2022-11-02 21:06:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:06:02,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182042875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:02,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:02,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-02 21:06:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828768428] [2022-11-02 21:06:02,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:02,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:06:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:06:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-11-02 21:06:02,609 INFO L87 Difference]: Start difference. First operand 8526 states and 34791 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:02,735 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1415) |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:06:04,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (+ c_~X_0~0.offset 4))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (select .cse0 .cse1) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select .cse0 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) .cse1) 4294967296)))) (= c_~X_0~0.offset 0))) is different from false [2022-11-02 21:06:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:05,373 INFO L93 Difference]: Finished difference Result 8617 states and 35007 transitions. [2022-11-02 21:06:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:06:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:05,400 INFO L225 Difference]: With dead ends: 8617 [2022-11-02 21:06:05,400 INFO L226 Difference]: Without dead ends: 8617 [2022-11-02 21:06:05,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=104, Invalid=514, Unknown=6, NotChecked=306, Total=930 [2022-11-02 21:06:05,401 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:05,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 110 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 736 Invalid, 0 Unknown, 251 Unchecked, 0.5s Time] [2022-11-02 21:06:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2022-11-02 21:06:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 8572. [2022-11-02 21:06:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8572 states, 8493 states have (on average 4.109619686800895) internal successors, (34903), 8571 states have internal predecessors, (34903), 0 states have call successors, (0), 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 21:06:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8572 states to 8572 states and 34903 transitions. [2022-11-02 21:06:05,584 INFO L78 Accepts]: Start accepts. Automaton has 8572 states and 34903 transitions. Word has length 14 [2022-11-02 21:06:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:05,584 INFO L495 AbstractCegarLoop]: Abstraction has 8572 states and 34903 transitions. [2022-11-02 21:06:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8572 states and 34903 transitions. [2022-11-02 21:06:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:05,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:05,586 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:05,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:05,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:05,813 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:05,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2046992108, now seen corresponding path program 2 times [2022-11-02 21:06:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:05,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724295703] [2022-11-02 21:06:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:06,275 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 21:06:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724295703] [2022-11-02 21:06:06,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724295703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222943344] [2022-11-02 21:06:06,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:06:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:06,277 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:06,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 21:06:06,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:06:06,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:06:06,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:06:06,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:06,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:06,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:06,603 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 16 treesize of output 18 [2022-11-02 21:06:06,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:06,682 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 16 treesize of output 18 [2022-11-02 21:06:06,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:06,746 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 16 treesize of output 18 [2022-11-02 21:06:06,769 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 21:06:06,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:06,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 4294967296)) is different from false [2022-11-02 21:06:06,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-02 21:06:06,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-02 21:06:06,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_92| Int)) (or (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |v_thread1Thread1of1ForFork2_~#t2~0.base_92| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_92|)))) is different from false [2022-11-02 21:06:06,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_92| Int) (v_ArrVal_1470 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |v_thread1Thread1of1ForFork2_~#t2~0.base_92| v_ArrVal_1470) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_92|)))) is different from false [2022-11-02 21:06:06,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:06,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:06:06,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:06,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 135 [2022-11-02 21:06:06,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-02 21:06:06,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2022-11-02 21:06:06,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-02 21:06:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:06:07,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222943344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:07,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:07,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-02 21:06:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116874252] [2022-11-02 21:06:07,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:07,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:06:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:06:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=372, Unknown=5, NotChecked=210, Total=650 [2022-11-02 21:06:07,116 INFO L87 Difference]: Start difference. First operand 8572 states and 34903 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:42,435 INFO L93 Difference]: Finished difference Result 8774 states and 35104 transitions. [2022-11-02 21:06:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:06:42,436 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:42,462 INFO L225 Difference]: With dead ends: 8774 [2022-11-02 21:06:42,462 INFO L226 Difference]: Without dead ends: 8774 [2022-11-02 21:06:42,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=20, NotChecked=300, Total=1190 [2022-11-02 21:06:42,463 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 243 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:42,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 84 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 753 Invalid, 0 Unknown, 393 Unchecked, 0.6s Time] [2022-11-02 21:06:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8774 states. [2022-11-02 21:06:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8774 to 8466. [2022-11-02 21:06:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 8387 states have (on average 4.097889591033742) internal successors, (34369), 8465 states have internal predecessors, (34369), 0 states have call successors, (0), 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 21:06:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 34369 transitions. [2022-11-02 21:06:42,628 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 34369 transitions. Word has length 14 [2022-11-02 21:06:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:42,628 INFO L495 AbstractCegarLoop]: Abstraction has 8466 states and 34369 transitions. [2022-11-02 21:06:42,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 34369 transitions. [2022-11-02 21:06:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:42,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:42,630 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:42,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:42,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-02 21:06:42,857 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2044702903, now seen corresponding path program 2 times [2022-11-02 21:06:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068997254] [2022-11-02 21:06:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:43,358 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 21:06:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:43,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068997254] [2022-11-02 21:06:43,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068997254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585121730] [2022-11-02 21:06:43,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:06:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:43,361 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:43,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-02 21:06:43,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:06:43,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:06:43,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 21:06:43,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:43,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:43,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:43,770 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 16 treesize of output 18 [2022-11-02 21:06:43,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:43,858 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 16 treesize of output 18 [2022-11-02 21:06:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:43,899 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 16 treesize of output 18 [2022-11-02 21:06:43,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:06:43,932 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 21:06:43,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:44,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:06:44,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:06:44,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_94| Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |v_thread1Thread1of1ForFork2_~#t2~0.base_94| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_94|)))) is different from false [2022-11-02 21:06:44,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_94| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |v_thread1Thread1of1ForFork2_~#t2~0.base_94| v_ArrVal_1523) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_94|)))) is different from false [2022-11-02 21:06:44,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:44,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:06:44,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:44,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-02 21:06:44,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2022-11-02 21:06:44,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 214 [2022-11-02 21:06:44,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2022-11-02 21:06:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:06:44,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585121730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:44,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:44,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:06:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850482535] [2022-11-02 21:06:44,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:06:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:06:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2022-11-02 21:06:44,297 INFO L87 Difference]: Start difference. First operand 8466 states and 34369 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:45,418 INFO L93 Difference]: Finished difference Result 11633 states and 46651 transitions. [2022-11-02 21:06:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:06:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:45,484 INFO L225 Difference]: With dead ends: 11633 [2022-11-02 21:06:45,484 INFO L226 Difference]: Without dead ends: 11601 [2022-11-02 21:06:45,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=728, Unknown=4, NotChecked=236, Total=1122 [2022-11-02 21:06:45,485 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 363 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:45,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 59 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 570 Invalid, 0 Unknown, 425 Unchecked, 0.5s Time] [2022-11-02 21:06:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11601 states. [2022-11-02 21:06:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11601 to 8313. [2022-11-02 21:06:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8313 states, 8234 states have (on average 4.104687879523925) internal successors, (33798), 8312 states have internal predecessors, (33798), 0 states have call successors, (0), 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 21:06:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 33798 transitions. [2022-11-02 21:06:45,782 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 33798 transitions. Word has length 14 [2022-11-02 21:06:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:45,782 INFO L495 AbstractCegarLoop]: Abstraction has 8313 states and 33798 transitions. [2022-11-02 21:06:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 33798 transitions. [2022-11-02 21:06:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:45,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:45,784 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:45,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:45,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-02 21:06:45,989 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -514433224, now seen corresponding path program 2 times [2022-11-02 21:06:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488339248] [2022-11-02 21:06:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:46,391 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 21:06:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488339248] [2022-11-02 21:06:46,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488339248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190212559] [2022-11-02 21:06:46,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:06:46,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:46,394 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:46,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-02 21:06:46,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:06:46,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:06:46,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:06:46,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:46,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:46,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:46,816 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 18 treesize of output 20 [2022-11-02 21:06:46,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:46,870 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 18 treesize of output 20 [2022-11-02 21:06:46,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:46,944 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 18 treesize of output 20 [2022-11-02 21:06:46,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:06:46,981 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 21:06:46,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:47,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1576 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:06:47,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-02 21:06:47,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1575) |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)))) is different from false [2022-11-02 21:06:47,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1575) |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)))) is different from false [2022-11-02 21:06:47,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:47,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:06:47,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:47,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-02 21:06:47,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-11-02 21:06:47,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-02 21:06:47,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-02 21:06:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:06:47,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190212559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:47,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:47,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:06:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395089996] [2022-11-02 21:06:47,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:47,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:06:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:06:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=368, Unknown=4, NotChecked=164, Total=600 [2022-11-02 21:06:47,349 INFO L87 Difference]: Start difference. First operand 8313 states and 33798 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:47,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse2 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) .cse2) 9223372039002259456)))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:06:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:48,562 INFO L93 Difference]: Finished difference Result 14952 states and 59478 transitions. [2022-11-02 21:06:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:06:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:48,614 INFO L225 Difference]: With dead ends: 14952 [2022-11-02 21:06:48,614 INFO L226 Difference]: Without dead ends: 14920 [2022-11-02 21:06:48,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=775, Unknown=5, NotChecked=310, Total=1260 [2022-11-02 21:06:48,615 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 521 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:48,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 93 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 677 Invalid, 0 Unknown, 516 Unchecked, 0.6s Time] [2022-11-02 21:06:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14920 states. [2022-11-02 21:06:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14920 to 8233. [2022-11-02 21:06:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8233 states, 8154 states have (on average 4.106205543291636) internal successors, (33482), 8232 states have internal predecessors, (33482), 0 states have call successors, (0), 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 21:06:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 33482 transitions. [2022-11-02 21:06:48,944 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 33482 transitions. Word has length 14 [2022-11-02 21:06:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:48,945 INFO L495 AbstractCegarLoop]: Abstraction has 8233 states and 33482 transitions. [2022-11-02 21:06:48,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 33482 transitions. [2022-11-02 21:06:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:48,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:48,946 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:48,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:49,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:49,146 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1067089296, now seen corresponding path program 1 times [2022-11-02 21:06:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:49,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857119964] [2022-11-02 21:06:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,525 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 21:06:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857119964] [2022-11-02 21:06:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857119964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448558601] [2022-11-02 21:06:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:49,527 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:49,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-02 21:06:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:06:49,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:49,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:49,790 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:06:49,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:06:49,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:49,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:49,884 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 16 treesize of output 18 [2022-11-02 21:06:49,928 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:06:49,928 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 21:06:49,966 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 16 treesize of output 18 [2022-11-02 21:06:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:50,023 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 16 treesize of output 18 [2022-11-02 21:06:50,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:06:50,055 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 21:06:50,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:50,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1632) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:06:50,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1631) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1632) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:06:50,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:50,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:06:50,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:50,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-02 21:06:50,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 222 [2022-11-02 21:06:50,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 214 [2022-11-02 21:06:50,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2022-11-02 21:06:50,689 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 21:06:50,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448558601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:50,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:50,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:06:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592189378] [2022-11-02 21:06:50,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:50,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:06:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:06:50,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=444, Unknown=3, NotChecked=86, Total=600 [2022-11-02 21:06:50,691 INFO L87 Difference]: Start difference. First operand 8233 states and 33482 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:51,807 INFO L93 Difference]: Finished difference Result 14421 states and 58176 transitions. [2022-11-02 21:06:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:06:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:51,862 INFO L225 Difference]: With dead ends: 14421 [2022-11-02 21:06:51,862 INFO L226 Difference]: Without dead ends: 14421 [2022-11-02 21:06:51,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=845, Unknown=3, NotChecked=122, Total=1122 [2022-11-02 21:06:51,863 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:51,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 160 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 675 Invalid, 0 Unknown, 559 Unchecked, 0.5s Time] [2022-11-02 21:06:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14421 states. [2022-11-02 21:06:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14421 to 8450. [2022-11-02 21:06:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8450 states, 8371 states have (on average 4.115756779357305) internal successors, (34453), 8449 states have internal predecessors, (34453), 0 states have call successors, (0), 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 21:06:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 34453 transitions. [2022-11-02 21:06:52,208 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 34453 transitions. Word has length 14 [2022-11-02 21:06:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:52,209 INFO L495 AbstractCegarLoop]: Abstraction has 8450 states and 34453 transitions. [2022-11-02 21:06:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 34453 transitions. [2022-11-02 21:06:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:06:52,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:52,211 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:52,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:52,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:52,411 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1067089293, now seen corresponding path program 1 times [2022-11-02 21:06:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941466538] [2022-11-02 21:06:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:52,796 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 21:06:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941466538] [2022-11-02 21:06:52,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941466538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104856078] [2022-11-02 21:06:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:52,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:52,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:52,798 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:52,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-02 21:06:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:53,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:06:53,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:53,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:53,040 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:06:53,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:06:53,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:53,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:53,127 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 18 treesize of output 20 [2022-11-02 21:06:53,170 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:06:53,170 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 21:06:53,209 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 18 treesize of output 20 [2022-11-02 21:06:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:53,272 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 18 treesize of output 20 [2022-11-02 21:06:53,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:06:53,307 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 21:06:53,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:53,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1688) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:06:53,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1687) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1688) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:06:53,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:53,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:06:53,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:53,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-02 21:06:53,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 259 [2022-11-02 21:06:53,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 486 [2022-11-02 21:06:53,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 470 [2022-11-02 21:06:54,247 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 21:06:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104856078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:54,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:06:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349169186] [2022-11-02 21:06:54,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:54,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:06:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:06:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=439, Unknown=3, NotChecked=86, Total=600 [2022-11-02 21:06:54,249 INFO L87 Difference]: Start difference. First operand 8450 states and 34453 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:54,993 INFO L93 Difference]: Finished difference Result 10961 states and 43735 transitions. [2022-11-02 21:06:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:06:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:06:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:55,125 INFO L225 Difference]: With dead ends: 10961 [2022-11-02 21:06:55,125 INFO L226 Difference]: Without dead ends: 10941 [2022-11-02 21:06:55,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=742, Unknown=3, NotChecked=114, Total=992 [2022-11-02 21:06:55,126 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 221 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:55,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 127 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 482 Invalid, 0 Unknown, 469 Unchecked, 0.4s Time] [2022-11-02 21:06:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10941 states. [2022-11-02 21:06:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10941 to 8480. [2022-11-02 21:06:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8401 states have (on average 4.118914414950601) internal successors, (34603), 8479 states have internal predecessors, (34603), 0 states have call successors, (0), 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 21:06:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 34603 transitions. [2022-11-02 21:06:55,301 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 34603 transitions. Word has length 14 [2022-11-02 21:06:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:55,301 INFO L495 AbstractCegarLoop]: Abstraction has 8480 states and 34603 transitions. [2022-11-02 21:06:55,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:06:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 34603 transitions. [2022-11-02 21:06:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:06:55,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:55,303 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:55,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:55,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-02 21:06:55,517 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1185185780, now seen corresponding path program 3 times [2022-11-02 21:06:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:55,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292565808] [2022-11-02 21:06:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:55,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292565808] [2022-11-02 21:06:55,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292565808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:55,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105663712] [2022-11-02 21:06:55,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:06:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:55,994 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:55,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-02 21:06:56,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 21:06:56,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:06:56,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:06:56,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:56,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:06:56,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:56,397 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 18 treesize of output 20 [2022-11-02 21:06:56,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:56,446 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 18 treesize of output 20 [2022-11-02 21:06:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:56,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:06:56,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1734) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2022-11-02 21:06:56,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1734) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-02 21:06:56,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:56,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:06:56,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:06:56,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-02 21:06:56,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-11-02 21:06:56,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:06:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 21:06:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105663712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:06:56,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:06:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-02 21:06:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290964207] [2022-11-02 21:06:56,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:06:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:06:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:06:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=783, Unknown=2, NotChecked=114, Total=992 [2022-11-02 21:06:56,862 INFO L87 Difference]: Start difference. First operand 8480 states and 34603 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:58,336 INFO L93 Difference]: Finished difference Result 9138 states and 36259 transitions. [2022-11-02 21:06:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:06:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:06:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:58,365 INFO L225 Difference]: With dead ends: 9138 [2022-11-02 21:06:58,365 INFO L226 Difference]: Without dead ends: 9138 [2022-11-02 21:06:58,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1319, Unknown=2, NotChecked=150, Total=1640 [2022-11-02 21:06:58,366 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 315 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:58,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 235 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1556 Invalid, 0 Unknown, 249 Unchecked, 0.9s Time] [2022-11-02 21:06:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9138 states. [2022-11-02 21:06:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9138 to 8490. [2022-11-02 21:06:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8490 states, 8411 states have (on average 4.1193674949470935) internal successors, (34648), 8489 states have internal predecessors, (34648), 0 states have call successors, (0), 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 21:06:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8490 states to 8490 states and 34648 transitions. [2022-11-02 21:06:58,533 INFO L78 Accepts]: Start accepts. Automaton has 8490 states and 34648 transitions. Word has length 15 [2022-11-02 21:06:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:58,534 INFO L495 AbstractCegarLoop]: Abstraction has 8490 states and 34648 transitions. [2022-11-02 21:06:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 8490 states and 34648 transitions. [2022-11-02 21:06:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:06:58,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:58,535 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:58,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-02 21:06:58,735 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:06:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1185185776, now seen corresponding path program 2 times [2022-11-02 21:06:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:58,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989544019] [2022-11-02 21:06:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989544019] [2022-11-02 21:06:59,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989544019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:06:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154005377] [2022-11-02 21:06:59,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:06:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:06:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:59,244 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:06:59,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-02 21:06:59,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:06:59,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:06:59,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:06:59,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:06:59,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:06:59,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:59,765 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 18 treesize of output 20 [2022-11-02 21:06:59,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:06:59,836 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 18 treesize of output 20 [2022-11-02 21:06:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:59,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:00,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:00,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:07:00,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:00,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 80 [2022-11-02 21:07:00,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2022-11-02 21:07:00,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-02 21:07:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:00,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154005377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:00,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:00,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-02 21:07:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189980470] [2022-11-02 21:07:00,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:00,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:07:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:07:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=870, Unknown=8, NotChecked=0, Total=992 [2022-11-02 21:07:00,879 INFO L87 Difference]: Start difference. First operand 8490 states and 34648 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,564 INFO L93 Difference]: Finished difference Result 8501 states and 34681 transitions. [2022-11-02 21:07:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:07:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,601 INFO L225 Difference]: With dead ends: 8501 [2022-11-02 21:07:01,601 INFO L226 Difference]: Without dead ends: 8501 [2022-11-02 21:07:01,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=201, Invalid=1513, Unknown=8, NotChecked=0, Total=1722 [2022-11-02 21:07:01,602 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2022-11-02 21:07:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8501 states. [2022-11-02 21:07:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8501 to 8501. [2022-11-02 21:07:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8422 states have (on average 4.117905485632867) internal successors, (34681), 8500 states have internal predecessors, (34681), 0 states have call successors, (0), 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 21:07:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 34681 transitions. [2022-11-02 21:07:01,775 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 34681 transitions. Word has length 15 [2022-11-02 21:07:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,775 INFO L495 AbstractCegarLoop]: Abstraction has 8501 states and 34681 transitions. [2022-11-02 21:07:01,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 34681 transitions. [2022-11-02 21:07:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:01,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,776 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:01,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-11-02 21:07:01,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:01,977 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1359037020, now seen corresponding path program 2 times [2022-11-02 21:07:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:01,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769629442] [2022-11-02 21:07:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769629442] [2022-11-02 21:07:02,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769629442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005143921] [2022-11-02 21:07:02,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:02,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:02,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:02,507 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:02,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-02 21:07:02,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:02,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:02,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 21:07:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:02,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:02,951 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:07:02,951 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 21:07:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:02,992 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 16 treesize of output 18 [2022-11-02 21:07:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:03,073 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 16 treesize of output 18 [2022-11-02 21:07:03,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:03,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:03,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1838 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1838) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:03,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_104| Int) (v_ArrVal_1838 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_104| v_ArrVal_1838) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_104|)))) is different from false [2022-11-02 21:07:03,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_104| Int) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1837) |v_thread1Thread1of1ForFork2_~#t2~0.base_104| v_ArrVal_1838) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_104|)))) is different from false [2022-11-02 21:07:03,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1836 Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_104| Int) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1836)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1837) |v_thread1Thread1of1ForFork2_~#t2~0.base_104| v_ArrVal_1838) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_104|)))) is different from false [2022-11-02 21:07:03,359 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:07:03,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-02 21:07:03,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:03,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:07:03,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:07:03,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:07:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-02 21:07:03,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005143921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:03,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:03,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-02 21:07:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945815185] [2022-11-02 21:07:03,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:03,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:07:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:07:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=635, Unknown=4, NotChecked=212, Total=930 [2022-11-02 21:07:03,536 INFO L87 Difference]: Start difference. First operand 8501 states and 34681 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:03,845 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 8)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (<= c_~t_4~0 2147483647) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_104| Int) (v_ArrVal_1838 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_104| v_ArrVal_1838) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_104|)))) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) is different from false [2022-11-02 21:07:03,856 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_104| Int) (v_ArrVal_1838 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_104| v_ArrVal_1838) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_104|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-02 21:07:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,869 INFO L93 Difference]: Finished difference Result 13708 states and 54843 transitions. [2022-11-02 21:07:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,922 INFO L225 Difference]: With dead ends: 13708 [2022-11-02 21:07:04,923 INFO L226 Difference]: Without dead ends: 13708 [2022-11-02 21:07:04,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1133, Unknown=6, NotChecked=438, Total=1722 [2022-11-02 21:07:04,923 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 369 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 259 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1250 Invalid, 0 Unknown, 403 Unchecked, 0.8s Time] [2022-11-02 21:07:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13708 states. [2022-11-02 21:07:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13708 to 8585. [2022-11-02 21:07:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8585 states, 8506 states have (on average 4.120738302374794) internal successors, (35051), 8584 states have internal predecessors, (35051), 0 states have call successors, (0), 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 21:07:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8585 states to 8585 states and 35051 transitions. [2022-11-02 21:07:05,299 INFO L78 Accepts]: Start accepts. Automaton has 8585 states and 35051 transitions. Word has length 15 [2022-11-02 21:07:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:05,299 INFO L495 AbstractCegarLoop]: Abstraction has 8585 states and 35051 transitions. [2022-11-02 21:07:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 8585 states and 35051 transitions. [2022-11-02 21:07:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:05,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:05,301 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:05,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:05,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:05,509 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1359037023, now seen corresponding path program 2 times [2022-11-02 21:07:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:05,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039506426] [2022-11-02 21:07:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:06,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:06,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039506426] [2022-11-02 21:07:06,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039506426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:06,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075184649] [2022-11-02 21:07:06,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:06,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:06,025 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:06,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-02 21:07:06,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:06,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:06,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 21:07:06,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:06,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:06,393 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:07:06,394 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 21:07:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:06,429 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 18 treesize of output 20 [2022-11-02 21:07:06,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:06,500 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 18 treesize of output 20 [2022-11-02 21:07:06,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:07:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:06,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:06,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1896 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1896) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:06,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1896 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_106| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_106|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_106| v_ArrVal_1896) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) is different from false [2022-11-02 21:07:06,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_106| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1895) |v_thread1Thread1of1ForFork2_~#t2~0.base_106| v_ArrVal_1896) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_106|)))) is different from false [2022-11-02 21:07:06,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_106| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1893)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1895) |v_thread1Thread1of1ForFork2_~#t2~0.base_106| v_ArrVal_1896) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_106|)))) is different from false [2022-11-02 21:07:06,713 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:07:06,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-02 21:07:06,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:06,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:07:06,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-02 21:07:06,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-02 21:07:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-02 21:07:06,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075184649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:06,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-02 21:07:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710208717] [2022-11-02 21:07:06,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:06,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:07:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:07:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=635, Unknown=4, NotChecked=212, Total=930 [2022-11-02 21:07:06,887 INFO L87 Difference]: Start difference. First operand 8585 states and 35051 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:07,184 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1896 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_106| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_106|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_106| v_ArrVal_1896) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) (not (= (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 8)) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) is different from false [2022-11-02 21:07:07,196 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_1896 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_106| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_106|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_106| v_ArrVal_1896) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483648)) (= c_~X_0~0.offset 0)) is different from false [2022-11-02 21:07:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:08,332 INFO L93 Difference]: Finished difference Result 13705 states and 54363 transitions. [2022-11-02 21:07:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:08,384 INFO L225 Difference]: With dead ends: 13705 [2022-11-02 21:07:08,384 INFO L226 Difference]: Without dead ends: 13701 [2022-11-02 21:07:08,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1133, Unknown=6, NotChecked=438, Total=1722 [2022-11-02 21:07:08,385 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 300 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:08,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 276 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1444 Invalid, 0 Unknown, 682 Unchecked, 0.9s Time] [2022-11-02 21:07:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13701 states. [2022-11-02 21:07:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13701 to 8582. [2022-11-02 21:07:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8582 states, 8503 states have (on average 4.112313301187816) internal successors, (34967), 8581 states have internal predecessors, (34967), 0 states have call successors, (0), 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 21:07:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 34967 transitions. [2022-11-02 21:07:08,608 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 34967 transitions. Word has length 15 [2022-11-02 21:07:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:08,608 INFO L495 AbstractCegarLoop]: Abstraction has 8582 states and 34967 transitions. [2022-11-02 21:07:08,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 34967 transitions. [2022-11-02 21:07:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:08,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:08,610 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:08,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:08,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-02 21:07:08,811 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1660581565, now seen corresponding path program 1 times [2022-11-02 21:07:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:08,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943135881] [2022-11-02 21:07:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:09,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943135881] [2022-11-02 21:07:09,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943135881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:09,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417351252] [2022-11-02 21:07:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:09,321 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:09,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-02 21:07:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:07:09,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:09,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,662 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:07:09,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:07:09,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:09,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,786 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 16 treesize of output 18 [2022-11-02 21:07:09,831 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:09,831 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 21:07:09,872 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 16 treesize of output 18 [2022-11-02 21:07:09,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:09,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:10,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1951 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1951) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:10,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:10,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 21:07:10,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:10,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-02 21:07:10,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 21:07:10,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:07:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:10,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417351252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:10,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-02 21:07:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71720141] [2022-11-02 21:07:10,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:10,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:07:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:07:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=628, Unknown=2, NotChecked=50, Total=756 [2022-11-02 21:07:10,438 INFO L87 Difference]: Start difference. First operand 8582 states and 34967 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:11,677 INFO L93 Difference]: Finished difference Result 12542 states and 50777 transitions. [2022-11-02 21:07:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:07:11,677 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:11,725 INFO L225 Difference]: With dead ends: 12542 [2022-11-02 21:07:11,726 INFO L226 Difference]: Without dead ends: 12542 [2022-11-02 21:07:11,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1364, Unknown=2, NotChecked=76, Total=1640 [2022-11-02 21:07:11,726 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 446 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 863 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 242 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 967 Invalid, 0 Unknown, 863 Unchecked, 0.7s Time] [2022-11-02 21:07:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2022-11-02 21:07:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 8665. [2022-11-02 21:07:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8665 states, 8586 states have (on average 4.115536920568367) internal successors, (35336), 8664 states have internal predecessors, (35336), 0 states have call successors, (0), 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 21:07:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 35336 transitions. [2022-11-02 21:07:11,938 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 35336 transitions. Word has length 15 [2022-11-02 21:07:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:11,938 INFO L495 AbstractCegarLoop]: Abstraction has 8665 states and 35336 transitions. [2022-11-02 21:07:11,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 35336 transitions. [2022-11-02 21:07:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:11,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:11,939 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:11,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:12,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-02 21:07:12,140 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1660581568, now seen corresponding path program 1 times [2022-11-02 21:07:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760006462] [2022-11-02 21:07:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760006462] [2022-11-02 21:07:12,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760006462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133636433] [2022-11-02 21:07:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:12,554 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:12,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-02 21:07:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:12,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:07:12,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:12,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:12,901 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:07:12,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:07:12,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:13,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:13,017 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 18 treesize of output 20 [2022-11-02 21:07:13,060 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:13,063 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 21:07:13,107 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 18 treesize of output 20 [2022-11-02 21:07:13,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:07:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:13,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:13,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2006) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:13,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:13,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:07:13,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:13,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-02 21:07:13,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-02 21:07:13,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-02 21:07:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:13,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133636433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:13,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:13,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-02 21:07:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359532763] [2022-11-02 21:07:13,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:13,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:07:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:07:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=628, Unknown=2, NotChecked=50, Total=756 [2022-11-02 21:07:13,596 INFO L87 Difference]: Start difference. First operand 8665 states and 35336 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:14,852 INFO L93 Difference]: Finished difference Result 12648 states and 50367 transitions. [2022-11-02 21:07:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:07:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:14,900 INFO L225 Difference]: With dead ends: 12648 [2022-11-02 21:07:14,900 INFO L226 Difference]: Without dead ends: 12640 [2022-11-02 21:07:14,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=1511, Unknown=2, NotChecked=80, Total=1806 [2022-11-02 21:07:14,901 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 458 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 525 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:14,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 213 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 876 Invalid, 0 Unknown, 525 Unchecked, 0.6s Time] [2022-11-02 21:07:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12640 states. [2022-11-02 21:07:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12640 to 8552. [2022-11-02 21:07:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8552 states, 8473 states have (on average 4.115543491089342) internal successors, (34871), 8551 states have internal predecessors, (34871), 0 states have call successors, (0), 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 21:07:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8552 states to 8552 states and 34871 transitions. [2022-11-02 21:07:15,155 INFO L78 Accepts]: Start accepts. Automaton has 8552 states and 34871 transitions. Word has length 15 [2022-11-02 21:07:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:15,155 INFO L495 AbstractCegarLoop]: Abstraction has 8552 states and 34871 transitions. [2022-11-02 21:07:15,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8552 states and 34871 transitions. [2022-11-02 21:07:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:15,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:15,157 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:15,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:15,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-02 21:07:15,358 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1594684341, now seen corresponding path program 2 times [2022-11-02 21:07:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958663826] [2022-11-02 21:07:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958663826] [2022-11-02 21:07:15,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958663826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:15,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947361039] [2022-11-02 21:07:15,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:15,901 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:15,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-02 21:07:16,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:16,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:16,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:07:16,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:16,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:16,235 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:07:16,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:07:16,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:16,350 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:07:16,351 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 21:07:16,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:16,393 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 18 treesize of output 20 [2022-11-02 21:07:16,441 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:16,441 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 15 treesize of output 15 [2022-11-02 21:07:16,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:16,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:07:16,556 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 18 treesize of output 20 [2022-11-02 21:07:16,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:07:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:16,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:16,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2069) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))))) is different from false [2022-11-02 21:07:16,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2068) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2069) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:16,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_120| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_112| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| v_ArrVal_2068) |v_thread1Thread1of1ForFork2_~#t3~0.base_120| v_ArrVal_2069) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_112|)) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_120|) 0)))) is different from false [2022-11-02 21:07:16,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_120| Int) (v_ArrVal_2066 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_112| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2066) |v_thread1Thread1of1ForFork2_~#t2~0.base_112| v_ArrVal_2068) |v_thread1Thread1of1ForFork2_~#t3~0.base_120| v_ArrVal_2069) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_112|)) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_120|) 0)))) is different from false [2022-11-02 21:07:16,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2064 Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_120| Int) (v_ArrVal_2066 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_112| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_112|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2064)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2066) |v_thread1Thread1of1ForFork2_~#t2~0.base_112| v_ArrVal_2068) |v_thread1Thread1of1ForFork2_~#t3~0.base_120| v_ArrVal_2069) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_120|) 0)))) is different from false [2022-11-02 21:07:16,833 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:07:16,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-11-02 21:07:16,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:16,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-02 21:07:16,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2022-11-02 21:07:16,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2022-11-02 21:07:16,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-02 21:07:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 21:07:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947361039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:17,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:17,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-02 21:07:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141802717] [2022-11-02 21:07:17,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:07:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:07:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=443, Unknown=5, NotChecked=230, Total=756 [2022-11-02 21:07:17,194 INFO L87 Difference]: Start difference. First operand 8552 states and 34871 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:18,369 INFO L93 Difference]: Finished difference Result 15050 states and 60888 transitions. [2022-11-02 21:07:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:18,425 INFO L225 Difference]: With dead ends: 15050 [2022-11-02 21:07:18,426 INFO L226 Difference]: Without dead ends: 15042 [2022-11-02 21:07:18,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=674, Unknown=7, NotChecked=290, Total=1122 [2022-11-02 21:07:18,426 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:18,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 168 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 795 Invalid, 0 Unknown, 678 Unchecked, 0.6s Time] [2022-11-02 21:07:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15042 states. [2022-11-02 21:07:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15042 to 9057. [2022-11-02 21:07:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9057 states, 8978 states have (on average 4.188460681666295) internal successors, (37604), 9056 states have internal predecessors, (37604), 0 states have call successors, (0), 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 21:07:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9057 states to 9057 states and 37604 transitions. [2022-11-02 21:07:18,666 INFO L78 Accepts]: Start accepts. Automaton has 9057 states and 37604 transitions. Word has length 15 [2022-11-02 21:07:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:18,667 INFO L495 AbstractCegarLoop]: Abstraction has 9057 states and 37604 transitions. [2022-11-02 21:07:18,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9057 states and 37604 transitions. [2022-11-02 21:07:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:18,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:18,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:18,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:18,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-11-02 21:07:18,870 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1797137312, now seen corresponding path program 1 times [2022-11-02 21:07:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:18,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478385442] [2022-11-02 21:07:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:19,227 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 21:07:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478385442] [2022-11-02 21:07:19,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478385442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823318227] [2022-11-02 21:07:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:19,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:19,229 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:19,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-02 21:07:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:19,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:07:19,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:19,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:19,492 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:07:19,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-02 21:07:19,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:19,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:19,593 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 18 treesize of output 20 [2022-11-02 21:07:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:19,645 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 18 treesize of output 20 [2022-11-02 21:07:19,681 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:19,681 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 21:07:19,717 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 18 treesize of output 20 [2022-11-02 21:07:19,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:07:19,756 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 21:07:19,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:19,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2125 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2125) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:19,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:19,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:07:19,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:19,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-02 21:07:19,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2022-11-02 21:07:20,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2022-11-02 21:07:20,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 230 [2022-11-02 21:07:20,271 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 21:07:20,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823318227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:20,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:07:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45077433] [2022-11-02 21:07:20,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:07:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:07:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=4, NotChecked=44, Total=600 [2022-11-02 21:07:20,273 INFO L87 Difference]: Start difference. First operand 9057 states and 37604 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:20,894 INFO L93 Difference]: Finished difference Result 11208 states and 45761 transitions. [2022-11-02 21:07:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:20,936 INFO L225 Difference]: With dead ends: 11208 [2022-11-02 21:07:20,936 INFO L226 Difference]: Without dead ends: 11176 [2022-11-02 21:07:20,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=4, NotChecked=54, Total=870 [2022-11-02 21:07:20,937 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:20,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 90 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 421 Invalid, 0 Unknown, 516 Unchecked, 0.3s Time] [2022-11-02 21:07:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11176 states. [2022-11-02 21:07:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11176 to 8921. [2022-11-02 21:07:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8921 states, 8842 states have (on average 4.197466636507578) internal successors, (37114), 8920 states have internal predecessors, (37114), 0 states have call successors, (0), 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 21:07:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8921 states to 8921 states and 37114 transitions. [2022-11-02 21:07:21,149 INFO L78 Accepts]: Start accepts. Automaton has 8921 states and 37114 transitions. Word has length 15 [2022-11-02 21:07:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:21,149 INFO L495 AbstractCegarLoop]: Abstraction has 8921 states and 37114 transitions. [2022-11-02 21:07:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8921 states and 37114 transitions. [2022-11-02 21:07:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:21,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:21,150 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:21,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:21,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:21,351 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1922952301, now seen corresponding path program 1 times [2022-11-02 21:07:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:21,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891117378] [2022-11-02 21:07:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:21,695 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 21:07:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891117378] [2022-11-02 21:07:21,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891117378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236422585] [2022-11-02 21:07:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:21,698 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:21,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-02 21:07:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:21,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 21:07:21,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:21,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:22,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:22,016 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 16 treesize of output 18 [2022-11-02 21:07:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:22,090 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 16 treesize of output 18 [2022-11-02 21:07:22,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:22,137 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 16 treesize of output 18 [2022-11-02 21:07:22,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:22,165 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 21:07:22,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:22,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2178) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:22,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2177) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2178) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:22,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_116| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_124|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_116|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_116| v_ArrVal_2177) |v_thread1Thread1of1ForFork2_~#t3~0.base_124| v_ArrVal_2178) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296))) is different from false [2022-11-02 21:07:22,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_116| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_124|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_116|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2176) |v_thread1Thread1of1ForFork2_~#t2~0.base_116| v_ArrVal_2177) |v_thread1Thread1of1ForFork2_~#t3~0.base_124| v_ArrVal_2178) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-02 21:07:22,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:22,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:07:22,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:22,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-02 21:07:22,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2022-11-02 21:07:22,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-02 21:07:22,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2022-11-02 21:07:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:07:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236422585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:22,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:07:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843042240] [2022-11-02 21:07:22,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:07:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:22,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:07:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=364, Unknown=4, NotChecked=164, Total=600 [2022-11-02 21:07:22,545 INFO L87 Difference]: Start difference. First operand 8921 states and 37114 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:22,639 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_116| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_124|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_116|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2176) |v_thread1Thread1of1ForFork2_~#t2~0.base_116| v_ArrVal_2177) |v_thread1Thread1of1ForFork2_~#t3~0.base_124| v_ArrVal_2178) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= c_~t_4~0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-02 21:07:22,643 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (= c_~X_0~0.offset 0) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_116| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_124|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_116|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_116| v_ArrVal_2177) |v_thread1Thread1of1ForFork2_~#t3~0.base_124| v_ArrVal_2178) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-11-02 21:07:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:23,458 INFO L93 Difference]: Finished difference Result 12570 states and 50361 transitions. [2022-11-02 21:07:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:23,504 INFO L225 Difference]: With dead ends: 12570 [2022-11-02 21:07:23,504 INFO L226 Difference]: Without dead ends: 12550 [2022-11-02 21:07:23,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=475, Unknown=6, NotChecked=294, Total=870 [2022-11-02 21:07:23,505 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 124 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:23,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 170 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1118 Invalid, 0 Unknown, 378 Unchecked, 0.7s Time] [2022-11-02 21:07:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12550 states. [2022-11-02 21:07:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12550 to 8838. [2022-11-02 21:07:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 8759 states have (on average 4.200251170224911) internal successors, (36790), 8837 states have internal predecessors, (36790), 0 states have call successors, (0), 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 21:07:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 36790 transitions. [2022-11-02 21:07:23,783 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 36790 transitions. Word has length 15 [2022-11-02 21:07:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:23,783 INFO L495 AbstractCegarLoop]: Abstraction has 8838 states and 36790 transitions. [2022-11-02 21:07:23,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 36790 transitions. [2022-11-02 21:07:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:23,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:23,785 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:23,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:23,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-11-02 21:07:23,985 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1280120135, now seen corresponding path program 1 times [2022-11-02 21:07:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:23,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394937888] [2022-11-02 21:07:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:24,497 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 21:07:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:24,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394937888] [2022-11-02 21:07:24,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394937888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:24,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383954546] [2022-11-02 21:07:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:24,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:24,500 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:24,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-02 21:07:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:24,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:07:24,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:24,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:24,772 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:07:24,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:07:24,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:24,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:24,868 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 18 treesize of output 20 [2022-11-02 21:07:24,907 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 21:07:24,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:07:24,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:07:25,004 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 18 treesize of output 20 [2022-11-02 21:07:25,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:07:25,036 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 21:07:25,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:25,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2236 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2236) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:25,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2235) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2236) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-02 21:07:25,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:25,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:07:25,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:25,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-02 21:07:25,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2022-11-02 21:07:25,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-02 21:07:25,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-02 21:07:25,539 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 21:07:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383954546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:25,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:25,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:07:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014173831] [2022-11-02 21:07:25,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:25,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:07:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:07:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=437, Unknown=3, NotChecked=86, Total=600 [2022-11-02 21:07:25,540 INFO L87 Difference]: Start difference. First operand 8838 states and 36790 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:26,446 INFO L93 Difference]: Finished difference Result 12510 states and 50927 transitions. [2022-11-02 21:07:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:26,446 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:26,491 INFO L225 Difference]: With dead ends: 12510 [2022-11-02 21:07:26,491 INFO L226 Difference]: Without dead ends: 12510 [2022-11-02 21:07:26,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=679, Unknown=4, NotChecked=110, Total=930 [2022-11-02 21:07:26,491 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 136 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:26,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 147 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 669 Invalid, 0 Unknown, 389 Unchecked, 0.5s Time] [2022-11-02 21:07:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12510 states. [2022-11-02 21:07:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12510 to 8989. [2022-11-02 21:07:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8989 states, 8910 states have (on average 4.204938271604938) internal successors, (37466), 8988 states have internal predecessors, (37466), 0 states have call successors, (0), 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 21:07:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8989 states to 8989 states and 37466 transitions. [2022-11-02 21:07:26,707 INFO L78 Accepts]: Start accepts. Automaton has 8989 states and 37466 transitions. Word has length 15 [2022-11-02 21:07:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:26,707 INFO L495 AbstractCegarLoop]: Abstraction has 8989 states and 37466 transitions. [2022-11-02 21:07:26,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8989 states and 37466 transitions. [2022-11-02 21:07:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:26,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:26,709 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:26,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-11-02 21:07:26,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-11-02 21:07:26,910 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1280120132, now seen corresponding path program 1 times [2022-11-02 21:07:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:26,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326602777] [2022-11-02 21:07:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:27,235 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 21:07:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326602777] [2022-11-02 21:07:27,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326602777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224196714] [2022-11-02 21:07:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:27,237 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:27,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-02 21:07:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:27,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:07:27,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:27,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:27,518 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:07:27,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 21:07:27,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:27,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:27,615 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 16 treesize of output 18 [2022-11-02 21:07:27,654 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:27,655 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 21:07:27,697 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 16 treesize of output 18 [2022-11-02 21:07:27,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:27,745 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 16 treesize of output 18 [2022-11-02 21:07:27,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:27,777 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 21:07:27,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:27,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2292 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2292) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:27,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2291) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2292) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-02 21:07:27,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:27,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:07:27,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:27,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1105 treesize of output 1059 [2022-11-02 21:07:27,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 1014 [2022-11-02 21:07:27,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 886 [2022-11-02 21:07:28,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 822 [2022-11-02 21:07:29,201 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 21:07:29,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224196714] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:29,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-02 21:07:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952559262] [2022-11-02 21:07:29,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:07:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:07:29,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=444, Unknown=3, NotChecked=86, Total=600 [2022-11-02 21:07:29,203 INFO L87 Difference]: Start difference. First operand 8989 states and 37466 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:30,295 INFO L93 Difference]: Finished difference Result 13441 states and 55709 transitions. [2022-11-02 21:07:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:30,296 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:30,346 INFO L225 Difference]: With dead ends: 13441 [2022-11-02 21:07:30,346 INFO L226 Difference]: Without dead ends: 13441 [2022-11-02 21:07:30,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=885, Unknown=3, NotChecked=126, Total=1190 [2022-11-02 21:07:30,346 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 189 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:30,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 136 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 734 Invalid, 0 Unknown, 485 Unchecked, 0.5s Time] [2022-11-02 21:07:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13441 states. [2022-11-02 21:07:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13441 to 9737. [2022-11-02 21:07:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9658 states have (on average 4.264961689790847) internal successors, (41191), 9736 states have internal predecessors, (41191), 0 states have call successors, (0), 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 21:07:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 41191 transitions. [2022-11-02 21:07:30,583 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 41191 transitions. Word has length 15 [2022-11-02 21:07:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:30,583 INFO L495 AbstractCegarLoop]: Abstraction has 9737 states and 41191 transitions. [2022-11-02 21:07:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:07:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 41191 transitions. [2022-11-02 21:07:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:30,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:30,585 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:30,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:30,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:30,785 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2009608472, now seen corresponding path program 3 times [2022-11-02 21:07:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:30,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278023626] [2022-11-02 21:07:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:31,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278023626] [2022-11-02 21:07:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278023626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:31,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637806737] [2022-11-02 21:07:31,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:07:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:31,183 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:31,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-02 21:07:31,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 21:07:31,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:07:31,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:31,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:31,705 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:07:31,705 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 21:07:31,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:31,744 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 16 treesize of output 18 [2022-11-02 21:07:31,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:31,787 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 16 treesize of output 18 [2022-11-02 21:07:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:31,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:32,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2344 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2344) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)) is different from false [2022-11-02 21:07:32,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-02 21:07:32,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2341 Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2341)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-02 21:07:32,047 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-02 21:07:32,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-02 21:07:32,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:32,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-02 21:07:32,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-11-02 21:07:32,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-11-02 21:07:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 21:07:32,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637806737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:32,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:32,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-02 21:07:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670759899] [2022-11-02 21:07:32,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:32,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 21:07:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:32,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 21:07:32,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=900, Unknown=3, NotChecked=186, Total=1190 [2022-11-02 21:07:32,260 INFO L87 Difference]: Start difference. First operand 9737 states and 41191 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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 21:07:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:33,894 INFO L93 Difference]: Finished difference Result 10457 states and 43052 transitions. [2022-11-02 21:07:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:07:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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 21:07:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:33,930 INFO L225 Difference]: With dead ends: 10457 [2022-11-02 21:07:33,930 INFO L226 Difference]: Without dead ends: 10457 [2022-11-02 21:07:33,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1462, Unknown=3, NotChecked=240, Total=1892 [2022-11-02 21:07:33,931 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 275 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:33,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 277 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1726 Invalid, 0 Unknown, 369 Unchecked, 1.0s Time] [2022-11-02 21:07:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10457 states. [2022-11-02 21:07:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10457 to 9737. [2022-11-02 21:07:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9658 states have (on average 4.263926278732657) internal successors, (41181), 9736 states have internal predecessors, (41181), 0 states have call successors, (0), 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 21:07:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 41181 transitions. [2022-11-02 21:07:34,136 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 41181 transitions. Word has length 16 [2022-11-02 21:07:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 9737 states and 41181 transitions. [2022-11-02 21:07:34,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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 21:07:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 41181 transitions. [2022-11-02 21:07:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:34,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:34,138 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:34,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:34,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:34,339 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1913947843, now seen corresponding path program 4 times [2022-11-02 21:07:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697613569] [2022-11-02 21:07:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697613569] [2022-11-02 21:07:34,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697613569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706745332] [2022-11-02 21:07:34,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:07:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:34,489 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:34,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-02 21:07:34,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:07:34,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:34,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:34,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:34,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:35,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706745332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:35,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:35,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-02 21:07:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533773826] [2022-11-02 21:07:35,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 21:07:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 21:07:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:07:35,043 INFO L87 Difference]: Start difference. First operand 9737 states and 41181 transitions. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:07:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:36,659 INFO L93 Difference]: Finished difference Result 22305 states and 92798 transitions. [2022-11-02 21:07:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 21:07:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:07:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:36,751 INFO L225 Difference]: With dead ends: 22305 [2022-11-02 21:07:36,751 INFO L226 Difference]: Without dead ends: 22261 [2022-11-02 21:07:36,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=590, Invalid=1572, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 21:07:36,752 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1449 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:36,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 360 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:07:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22261 states. [2022-11-02 21:07:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22261 to 11004. [2022-11-02 21:07:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11004 states, 10925 states have (on average 4.2854919908466815) internal successors, (46819), 11003 states have internal predecessors, (46819), 0 states have call successors, (0), 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 21:07:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11004 states to 11004 states and 46819 transitions. [2022-11-02 21:07:37,194 INFO L78 Accepts]: Start accepts. Automaton has 11004 states and 46819 transitions. Word has length 16 [2022-11-02 21:07:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:37,194 INFO L495 AbstractCegarLoop]: Abstraction has 11004 states and 46819 transitions. [2022-11-02 21:07:37,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:07:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11004 states and 46819 transitions. [2022-11-02 21:07:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:37,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:37,197 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:37,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:37,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-02 21:07:37,397 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-02 21:07:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 768476217, now seen corresponding path program 1 times [2022-11-02 21:07:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939350682] [2022-11-02 21:07:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939350682] [2022-11-02 21:07:37,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939350682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445202458] [2022-11-02 21:07:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:37,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:37,899 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:37,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e34356-6ee7-4541-bf02-4567b3783842/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-02 21:07:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:07:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:38,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:38,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:38,316 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 18 treesize of output 20 [2022-11-02 21:07:38,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:38,411 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 18 treesize of output 20 [2022-11-02 21:07:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:38,447 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 18 treesize of output 20 [2022-11-02 21:07:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:38,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:38,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2443 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2443) c_~X_0~0.base) (+ 8 c_~X_0~0.offset))))) is different from false [2022-11-02 21:07:38,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2442) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2443) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-02 21:07:38,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_124|)) (forall ((v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_124| v_ArrVal_2442) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2443) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))))) is different from false [2022-11-02 21:07:38,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_124|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2441) |v_thread1Thread1of1ForFork2_~#t2~0.base_124| v_ArrVal_2442) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2443) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-11-02 21:07:38,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:38,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 21:07:38,722 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:38,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-02 21:07:38,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 518 [2022-11-02 21:07:38,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 518 treesize of output 486 [2022-11-02 21:07:38,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 470 [2022-11-02 21:07:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 21:07:39,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445202458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:39,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:39,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-02 21:07:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185356050] [2022-11-02 21:07:39,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:39,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:07:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:07:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=667, Unknown=4, NotChecked=220, Total=992 [2022-11-02 21:07:39,415 INFO L87 Difference]: Start difference. First operand 11004 states and 46819 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 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 21:07:39,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_124| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_124|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2441) |v_thread1Thread1of1ForFork2_~#t2~0.base_124| v_ArrVal_2442) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2443) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 9223372039002259456)))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false