./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-symm.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_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/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_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/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_f90ca046-88a4-41d4-8368-4aa857e174f3/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 c7fdb1595c27c144c3bf111946260cb3946663200a2d53f7fba5455031291c4f --- 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:10:13,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:10:13,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:10:13,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:10:13,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:10:13,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:10:13,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:10:13,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:10:13,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:10:13,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:10:13,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:10:13,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:10:13,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:10:13,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:10:13,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:10:13,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:10:13,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:10:13,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:10:13,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:10:13,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:10:13,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:10:13,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:10:13,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:10:13,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:10:13,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:10:13,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:10:13,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:10:13,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:10:13,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:10:13,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:10:13,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:10:13,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:10:13,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:10:13,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:10:13,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:10:13,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:10:13,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:10:13,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:10:13,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:10:13,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:10:13,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:10:13,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 21:10:13,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:10:13,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:10:13,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:10:13,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:10:13,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:10:13,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:10:13,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:10:13,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:10:13,860 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:10:13,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:10:13,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:10:13,861 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:10:13,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:10:13,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:10:13,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:10:13,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:10:13,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:10:13,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:10:13,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:10:13,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:10:13,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:10:13,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:13,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:10:13,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:10:13,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:10:13,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:10:13,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:10:13,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:10:13,865 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_f90ca046-88a4-41d4-8368-4aa857e174f3/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_f90ca046-88a4-41d4-8368-4aa857e174f3/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 -> c7fdb1595c27c144c3bf111946260cb3946663200a2d53f7fba5455031291c4f [2022-11-02 21:10:14,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:10:14,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:10:14,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:10:14,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:10:14,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:10:14,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2022-11-02 21:10:14,332 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/data/b6c28758a/6e73084f20f541a48789683fe29bb7c7/FLAGe70bc31ad [2022-11-02 21:10:14,925 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:10:14,926 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2022-11-02 21:10:14,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/data/b6c28758a/6e73084f20f541a48789683fe29bb7c7/FLAGe70bc31ad [2022-11-02 21:10:15,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/data/b6c28758a/6e73084f20f541a48789683fe29bb7c7 [2022-11-02 21:10:15,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:10:15,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:10:15,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:15,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:10:15,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:10:15,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6f47f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15, skipping insertion in model container [2022-11-02 21:10:15,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:10:15,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:10:15,590 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_f90ca046-88a4-41d4-8368-4aa857e174f3/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-11-02 21:10:15,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:15,620 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:10:15,649 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_f90ca046-88a4-41d4-8368-4aa857e174f3/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-11-02 21:10:15,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:15,671 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:10:15,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15 WrapperNode [2022-11-02 21:10:15,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:15,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:15,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:10:15,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:10:15,682 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:10:15" (1/1) ... [2022-11-02 21:10:15,698 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:10:15" (1/1) ... [2022-11-02 21:10:15,744 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 238 [2022-11-02 21:10:15,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:15,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:10:15,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:10:15,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:10:15,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,816 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:10:15,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:10:15,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:10:15,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:10:15,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (1/1) ... [2022-11-02 21:10:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:15,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:10:15,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:10:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:10:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:10:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:10:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:10:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:10:15,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:10:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:10:15,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:10:15,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:10:15,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:10:15,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:10:15,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:10:15,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:10:15,959 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:10:16,124 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:10:16,126 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:10:16,741 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:10:16,756 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:10:16,756 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:10:16,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:16 BoogieIcfgContainer [2022-11-02 21:10:16,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:10:16,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:10:16,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:10:16,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:10:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:10:15" (1/3) ... [2022-11-02 21:10:16,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd4a7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:16, skipping insertion in model container [2022-11-02 21:10:16,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:15" (2/3) ... [2022-11-02 21:10:16,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd4a7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:16, skipping insertion in model container [2022-11-02 21:10:16,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:16" (3/3) ... [2022-11-02 21:10:16,776 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-11-02 21:10:16,786 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:10:16,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:10:16,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-02 21:10:16,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:10:17,003 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 21:10:17,073 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 21:10:17,094 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 331 transitions, 678 flow [2022-11-02 21:10:17,105 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 331 transitions, 678 flow [2022-11-02 21:10:17,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 331 transitions, 678 flow [2022-11-02 21:10:17,380 INFO L130 PetriNetUnfolder]: 27/329 cut-off events. [2022-11-02 21:10:17,380 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 21:10:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 329 events. 27/329 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 564 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 205. Up to 2 conditions per place. [2022-11-02 21:10:17,404 INFO L118 LiptonReduction]: Number of co-enabled transitions 16632 [2022-11-02 21:10:41,789 INFO L133 LiptonReduction]: Checked pairs total: 17553 [2022-11-02 21:10:41,790 INFO L135 LiptonReduction]: Total number of compositions: 430 [2022-11-02 21:10:41,803 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 42 transitions, 100 flow [2022-11-02 21:10:41,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 314 states, 230 states have (on average 3.273913043478261) internal successors, (753), 313 states have internal predecessors, (753), 0 states have call successors, (0), 0 states 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:10:41,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:10:41,895 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;@72f5e46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:10:41,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-02 21:10:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 230 states have (on average 3.273913043478261) internal successors, (753), 313 states have internal predecessors, (753), 0 states have call successors, (0), 0 states 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:10:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-02 21:10:41,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:41,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-02 21:10:41,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash 44002, now seen corresponding path program 1 times [2022-11-02 21:10:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:41,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986756603] [2022-11-02 21:10:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,204 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:10:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:42,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986756603] [2022-11-02 21:10:42,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986756603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:42,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:42,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:10:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373365454] [2022-11-02 21:10:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:42,245 INFO L87 Difference]: Start difference. First operand has 314 states, 230 states have (on average 3.273913043478261) internal successors, (753), 313 states have internal predecessors, (753), 0 states have call successors, (0), 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 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:10:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:42,453 INFO L93 Difference]: Finished difference Result 395 states and 941 transitions. [2022-11-02 21:10:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:42,456 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:10:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:42,472 INFO L225 Difference]: With dead ends: 395 [2022-11-02 21:10:42,472 INFO L226 Difference]: Without dead ends: 395 [2022-11-02 21:10:42,473 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:10:42,477 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:42,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:10:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-02 21:10:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 202. [2022-11-02 21:10:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 157 states have (on average 3.038216560509554) internal successors, (477), 201 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:10:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 477 transitions. [2022-11-02 21:10:42,545 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 477 transitions. Word has length 2 [2022-11-02 21:10:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:42,545 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 477 transitions. [2022-11-02 21:10:42,546 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:10:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 477 transitions. [2022-11-02 21:10:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:10:42,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:42,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:10:42,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:10:42,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1367020, now seen corresponding path program 1 times [2022-11-02 21:10:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:42,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491239980] [2022-11-02 21:10:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,672 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:10:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491239980] [2022-11-02 21:10:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491239980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782225179] [2022-11-02 21:10:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:42,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:42,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:42,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:10:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:10:42,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:42,932 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:10:42,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:42,954 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:10:42,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782225179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:42,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:42,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-02 21:10:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432384857] [2022-11-02 21:10:42,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:42,959 INFO L87 Difference]: Start difference. First operand 202 states and 477 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:10:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:43,465 INFO L93 Difference]: Finished difference Result 980 states and 2351 transitions. [2022-11-02 21:10:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:10:43,467 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:10:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:43,477 INFO L225 Difference]: With dead ends: 980 [2022-11-02 21:10:43,480 INFO L226 Difference]: Without dead ends: 980 [2022-11-02 21:10:43,482 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:10:43,484 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:43,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:10:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-11-02 21:10:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 208. [2022-11-02 21:10:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 163 states have (on average 3.03680981595092) internal successors, (495), 207 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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:10:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 495 transitions. [2022-11-02 21:10:43,547 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 495 transitions. Word has length 3 [2022-11-02 21:10:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:43,548 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 495 transitions. [2022-11-02 21:10:43,548 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:10:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 495 transitions. [2022-11-02 21:10:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:10:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:43,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:10:43,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:43,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:43,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1367075, now seen corresponding path program 1 times [2022-11-02 21:10:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:43,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691895494] [2022-11-02 21:10:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,894 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:10:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691895494] [2022-11-02 21:10:43,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691895494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:43,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599964889] [2022-11-02 21:10:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:43,898 INFO L87 Difference]: Start difference. First operand 208 states and 495 transitions. Second operand has 3 states, 2 states have (on average 1.5) 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:10:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:43,978 INFO L93 Difference]: Finished difference Result 206 states and 487 transitions. [2022-11-02 21:10:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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:10:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:43,982 INFO L225 Difference]: With dead ends: 206 [2022-11-02 21:10:43,982 INFO L226 Difference]: Without dead ends: 206 [2022-11-02 21:10:43,982 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:10:43,987 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:43,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-02 21:10:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-11-02 21:10:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 163 states have (on average 2.9877300613496933) internal successors, (487), 205 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:10:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 487 transitions. [2022-11-02 21:10:44,017 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 487 transitions. Word has length 3 [2022-11-02 21:10:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:44,017 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 487 transitions. [2022-11-02 21:10:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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:10:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 487 transitions. [2022-11-02 21:10:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 21:10:44,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:44,019 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-02 21:10:44,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:10:44,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2073124450, now seen corresponding path program 2 times [2022-11-02 21:10:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:44,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450540743] [2022-11-02 21:10:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:44,264 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:10:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450540743] [2022-11-02 21:10:44,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450540743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97743328] [2022-11-02 21:10:44,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:10:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:44,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:44,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:10:44,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 21:10:44,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:10:44,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:10:44,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:44,437 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:10:44,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:10:44,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97743328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:44,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:10:44,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-02 21:10:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088076719] [2022-11-02 21:10:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:44,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:44,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:44,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:44,442 INFO L87 Difference]: Start difference. First operand 206 states and 487 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:10:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:44,516 INFO L93 Difference]: Finished difference Result 204 states and 485 transitions. [2022-11-02 21:10:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:44,516 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:10:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:44,518 INFO L225 Difference]: With dead ends: 204 [2022-11-02 21:10:44,519 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 21:10:44,519 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:10:44,524 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:44,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 21:10:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2022-11-02 21:10:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 3.0258064516129033) internal successors, (469), 195 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:10:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 469 transitions. [2022-11-02 21:10:44,548 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 469 transitions. Word has length 6 [2022-11-02 21:10:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:44,550 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 469 transitions. [2022-11-02 21:10:44,550 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:10:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 469 transitions. [2022-11-02 21:10:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:10:44,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:44,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:44,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:44,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:44,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1991162197, now seen corresponding path program 1 times [2022-11-02 21:10:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383611375] [2022-11-02 21:10:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:44,899 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:10:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:44,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383611375] [2022-11-02 21:10:44,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383611375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:44,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:44,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514046277] [2022-11-02 21:10:44,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:44,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:44,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:44,903 INFO L87 Difference]: Start difference. First operand 196 states and 469 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:45,030 INFO L93 Difference]: Finished difference Result 334 states and 800 transitions. [2022-11-02 21:10:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 21:10:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:45,034 INFO L225 Difference]: With dead ends: 334 [2022-11-02 21:10:45,034 INFO L226 Difference]: Without dead ends: 334 [2022-11-02 21:10:45,035 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:10:45,036 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-02 21:10:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 232. [2022-11-02 21:10:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 191 states have (on average 3.3769633507853403) internal successors, (645), 231 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 645 transitions. [2022-11-02 21:10:45,069 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 645 transitions. Word has length 7 [2022-11-02 21:10:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:45,071 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 645 transitions. [2022-11-02 21:10:45,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 645 transitions. [2022-11-02 21:10:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:10:45,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:45,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:45,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:10:45,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1991162259, now seen corresponding path program 1 times [2022-11-02 21:10:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80883978] [2022-11-02 21:10:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,132 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:10:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:45,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80883978] [2022-11-02 21:10:45,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80883978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:45,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:45,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033624675] [2022-11-02 21:10:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:45,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:45,136 INFO L87 Difference]: Start difference. First operand 232 states and 645 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:45,217 INFO L93 Difference]: Finished difference Result 234 states and 647 transitions. [2022-11-02 21:10:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 21:10:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:45,220 INFO L225 Difference]: With dead ends: 234 [2022-11-02 21:10:45,220 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 21:10:45,220 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:10:45,221 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:45,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 21:10:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-02 21:10:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 193 states have (on average 3.3523316062176165) internal successors, (647), 233 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:10:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 647 transitions. [2022-11-02 21:10:45,232 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 647 transitions. Word has length 7 [2022-11-02 21:10:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:45,233 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 647 transitions. [2022-11-02 21:10:45,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 647 transitions. [2022-11-02 21:10:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:10:45,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:45,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:45,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:10:45,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1302162885, now seen corresponding path program 1 times [2022-11-02 21:10:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259613649] [2022-11-02 21:10:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:10:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:45,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259613649] [2022-11-02 21:10:45,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259613649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:45,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548937842] [2022-11-02 21:10:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:45,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:45,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:45,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:10:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:10:45,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:10:45,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:10:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548937842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:45,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:45,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-11-02 21:10:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299846103] [2022-11-02 21:10:45,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:45,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:10:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:45,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:10:45,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:45,608 INFO L87 Difference]: Start difference. First operand 234 states and 647 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:45,784 INFO L93 Difference]: Finished difference Result 240 states and 653 transitions. [2022-11-02 21:10:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:10:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 21:10:45,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:45,793 INFO L225 Difference]: With dead ends: 240 [2022-11-02 21:10:45,793 INFO L226 Difference]: Without dead ends: 240 [2022-11-02 21:10:45,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:45,794 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:45,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:10:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-02 21:10:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-11-02 21:10:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 3.2814070351758793) internal successors, (653), 239 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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:10:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 653 transitions. [2022-11-02 21:10:45,808 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 653 transitions. Word has length 9 [2022-11-02 21:10:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:45,808 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 653 transitions. [2022-11-02 21:10:45,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 653 transitions. [2022-11-02 21:10:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:10:45,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:45,810 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:45,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:46,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 21:10:46,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1927539475, now seen corresponding path program 2 times [2022-11-02 21:10:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:46,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941725821] [2022-11-02 21:10:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:46,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941725821] [2022-11-02 21:10:46,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941725821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:46,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537823157] [2022-11-02 21:10:46,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:10:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:46,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:46,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:10:46,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:10:46,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:10:46,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:10:46,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:46,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:46,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537823157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:46,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:46,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-02 21:10:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819418988] [2022-11-02 21:10:46,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:46,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:10:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:10:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:10:46,633 INFO L87 Difference]: Start difference. First operand 240 states and 653 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:10:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:46,760 INFO L93 Difference]: Finished difference Result 242 states and 655 transitions. [2022-11-02 21:10:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:10:46,761 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 15 [2022-11-02 21:10:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:46,763 INFO L225 Difference]: With dead ends: 242 [2022-11-02 21:10:46,764 INFO L226 Difference]: Without dead ends: 242 [2022-11-02 21:10:46,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:10:46,765 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:46,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-02 21:10:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-02 21:10:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 201 states have (on average 3.2587064676616917) internal successors, (655), 241 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:10:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 655 transitions. [2022-11-02 21:10:46,776 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 655 transitions. Word has length 15 [2022-11-02 21:10:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:46,777 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 655 transitions. [2022-11-02 21:10:46,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:10:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 655 transitions. [2022-11-02 21:10:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:10:46,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:46,778 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:46,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:46,990 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1045785019, now seen corresponding path program 3 times [2022-11-02 21:10:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:46,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278913840] [2022-11-02 21:10:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:10:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278913840] [2022-11-02 21:10:48,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278913840] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131740512] [2022-11-02 21:10:48,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:10:48,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:48,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:48,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:48,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:10:48,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 21:10:48,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:10:48,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:10:48,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:48,847 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 16 treesize of output 12 [2022-11-02 21:10:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:48,914 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 21 treesize of output 20 [2022-11-02 21:10:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:48,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 23 treesize of output 22 [2022-11-02 21:10:49,055 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 21:10:49,056 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 23 treesize of output 28 [2022-11-02 21:10:49,183 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 21:10:49,183 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 32 [2022-11-02 21:10:49,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:49,278 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 14 treesize of output 16 [2022-11-02 21:10:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:49,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:49,554 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (|ULTIMATE.start_create_fresh_int_array_~i~2#1| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_281 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_279) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_281)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) is different from false [2022-11-02 21:10:49,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| Int) (v_ArrVal_279 Int) (v_ArrVal_277 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_281 Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_279) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_281)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| 1))))) is different from false [2022-11-02 21:10:49,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_163| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| Int) (v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_275 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_281 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_163|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_275) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_163| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_277) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_279) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_281)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_162| 1))))) is different from false [2022-11-02 21:10:49,808 INFO L356 Elim1Store]: treesize reduction 269, result has 31.9 percent of original size [2022-11-02 21:10:49,809 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 5 case distinctions, treesize of input 51 treesize of output 136 [2022-11-02 21:10:49,923 INFO L356 Elim1Store]: treesize reduction 26, result has 75.7 percent of original size [2022-11-02 21:10:49,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 178 [2022-11-02 21:10:49,933 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 5 treesize of output 3 [2022-11-02 21:10:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-11-02 21:10:50,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131740512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:50,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:50,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2022-11-02 21:10:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339285678] [2022-11-02 21:10:50,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:50,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 21:10:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 21:10:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=426, Unknown=3, NotChecked=138, Total=702 [2022-11-02 21:10:50,157 INFO L87 Difference]: Start difference. First operand 242 states and 655 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:10:51,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((v_ArrVal_279 Int) (|ULTIMATE.start_create_fresh_int_array_~i~2#1| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_281 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_279) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_281)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (<= 5 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647))) is different from false [2022-11-02 21:10:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:51,796 INFO L93 Difference]: Finished difference Result 331 states and 783 transitions. [2022-11-02 21:10:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:10:51,797 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 17 [2022-11-02 21:10:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:51,800 INFO L225 Difference]: With dead ends: 331 [2022-11-02 21:10:51,800 INFO L226 Difference]: Without dead ends: 331 [2022-11-02 21:10:51,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=234, Invalid=648, Unknown=4, NotChecked=236, Total=1122 [2022-11-02 21:10:51,803 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:51,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 367 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2022-11-02 21:10:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-02 21:10:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 242. [2022-11-02 21:10:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 201 states have (on average 3.253731343283582) internal successors, (654), 241 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:10:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 654 transitions. [2022-11-02 21:10:51,815 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 654 transitions. Word has length 17 [2022-11-02 21:10:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:51,815 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 654 transitions. [2022-11-02 21:10:51,815 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:10:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 654 transitions. [2022-11-02 21:10:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:10:51,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:51,818 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:51,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:52,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:52,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1045785069, now seen corresponding path program 1 times [2022-11-02 21:10:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:52,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484929192] [2022-11-02 21:10:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:53,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484929192] [2022-11-02 21:10:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484929192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235306056] [2022-11-02 21:10:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:53,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:53,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:10:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:53,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 21:10:53,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:53,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:53,903 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:10:53,904 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:10:53,961 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 11 treesize of output 7 [2022-11-02 21:10:54,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:54,031 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 25 treesize of output 24 [2022-11-02 21:10:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:54,099 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 25 treesize of output 24 [2022-11-02 21:10:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:54,168 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 25 treesize of output 24 [2022-11-02 21:10:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:54,244 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 25 treesize of output 24 [2022-11-02 21:10:54,318 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:10:54,319 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:10:54,383 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:10:54,404 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:10:54,427 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:10:54,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 16 treesize of output 18 [2022-11-02 21:10:54,467 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:10:54,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:54,519 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:10:54,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:10:54,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:10:54,599 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 17 treesize of output 12 [2022-11-02 21:10:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:10:54,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:54,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:10:54,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:10:55,383 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:10:55,384 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 5 case distinctions, treesize of input 55 treesize of output 76 [2022-11-02 21:10:55,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:10:55,423 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 73 treesize of output 71 [2022-11-02 21:10:55,431 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 56 treesize of output 52 [2022-11-02 21:10:55,439 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 26 treesize of output 24 [2022-11-02 21:10:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:10:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235306056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:55,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:55,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-02 21:10:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946788441] [2022-11-02 21:10:55,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:55,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 21:10:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 21:10:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=781, Unknown=15, NotChecked=118, Total=1056 [2022-11-02 21:10:55,593 INFO L87 Difference]: Start difference. First operand 242 states and 654 transitions. Second operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:10:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:56,969 INFO L93 Difference]: Finished difference Result 313 states and 824 transitions. [2022-11-02 21:10:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:10:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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 17 [2022-11-02 21:10:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:56,972 INFO L225 Difference]: With dead ends: 313 [2022-11-02 21:10:56,972 INFO L226 Difference]: Without dead ends: 313 [2022-11-02 21:10:56,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=287, Invalid=1428, Unknown=15, NotChecked=162, Total=1892 [2022-11-02 21:10:56,974 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:56,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 425 Invalid, 0 Unknown, 383 Unchecked, 0.5s Time] [2022-11-02 21:10:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-02 21:10:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 259. [2022-11-02 21:10:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 3.4220183486238533) internal successors, (746), 258 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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:10:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 746 transitions. [2022-11-02 21:10:56,985 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 746 transitions. Word has length 17 [2022-11-02 21:10:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:56,986 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 746 transitions. [2022-11-02 21:10:56,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:10:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 746 transitions. [2022-11-02 21:10:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:10:56,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:56,987 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:57,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:57,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:10:57,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1045785071, now seen corresponding path program 1 times [2022-11-02 21:10:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747107572] [2022-11-02 21:10:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747107572] [2022-11-02 21:10:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747107572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:59,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984669193] [2022-11-02 21:10:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:59,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:59,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:10:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:59,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 21:10:59,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:59,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:59,771 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 21:10:59,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:10:59,860 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 11 treesize of output 7 [2022-11-02 21:10:59,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:59,923 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 23 treesize of output 22 [2022-11-02 21:10:59,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:59,993 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 23 treesize of output 22 [2022-11-02 21:11:00,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:00,074 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 23 treesize of output 22 [2022-11-02 21:11:00,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:00,139 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 23 treesize of output 22 [2022-11-02 21:11:00,202 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:00,202 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:11:00,256 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 14 treesize of output 16 [2022-11-02 21:11:00,278 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 14 treesize of output 16 [2022-11-02 21:11:00,294 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 14 treesize of output 16 [2022-11-02 21:11:00,311 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 14 treesize of output 16 [2022-11-02 21:11:00,333 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 14 treesize of output 16 [2022-11-02 21:11:00,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:00,382 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 14 treesize of output 16 [2022-11-02 21:11:00,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:00,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:00,477 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 15 treesize of output 10 [2022-11-02 21:11:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:00,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:00,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_453) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-02 21:11:00,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_453) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-02 21:11:01,278 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:01,278 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 5 case distinctions, treesize of input 53 treesize of output 74 [2022-11-02 21:11:01,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:01,296 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 63 treesize of output 61 [2022-11-02 21:11:01,304 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 22 [2022-11-02 21:11:01,310 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 46 treesize of output 42 [2022-11-02 21:11:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:11:01,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984669193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:01,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:01,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2022-11-02 21:11:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877895730] [2022-11-02 21:11:01,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 21:11:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 21:11:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1022, Unknown=15, NotChecked=134, Total=1332 [2022-11-02 21:11:01,445 INFO L87 Difference]: Start difference. First operand 259 states and 746 transitions. Second operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:02,727 INFO L93 Difference]: Finished difference Result 295 states and 780 transitions. [2022-11-02 21:11:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:11:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 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 17 [2022-11-02 21:11:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:02,731 INFO L225 Difference]: With dead ends: 295 [2022-11-02 21:11:02,731 INFO L226 Difference]: Without dead ends: 295 [2022-11-02 21:11:02,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=297, Invalid=1673, Unknown=18, NotChecked=174, Total=2162 [2022-11-02 21:11:02,733 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:02,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 539 Invalid, 0 Unknown, 222 Unchecked, 0.6s Time] [2022-11-02 21:11:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-02 21:11:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 259. [2022-11-02 21:11:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 3.3394495412844036) internal successors, (728), 258 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:11:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 728 transitions. [2022-11-02 21:11:02,744 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 728 transitions. Word has length 17 [2022-11-02 21:11:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:02,745 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 728 transitions. [2022-11-02 21:11:02,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 728 transitions. [2022-11-02 21:11:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:11:02,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:02,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:02,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:02,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 21:11:02,966 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1045785061, now seen corresponding path program 1 times [2022-11-02 21:11:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768134440] [2022-11-02 21:11:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:03,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768134440] [2022-11-02 21:11:03,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768134440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:03,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116325292] [2022-11-02 21:11:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:03,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:03,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:03,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:11:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:11:04,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:04,134 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 11 treesize of output 7 [2022-11-02 21:11:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:04,181 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 25 treesize of output 24 [2022-11-02 21:11:04,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:04,228 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 25 treesize of output 24 [2022-11-02 21:11:04,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:04,282 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 25 treesize of output 24 [2022-11-02 21:11:04,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:04,336 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 25 treesize of output 24 [2022-11-02 21:11:04,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:04,379 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:11:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:04,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:04,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-11-02 21:11:04,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 Int) (v_ArrVal_530 (Array Int Int))) (< 0 (+ (select (select (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|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_529)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-11-02 21:11:04,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| Int) (v_ArrVal_527 Int) (v_ArrVal_530 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_527) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_529)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206|)))) is different from false [2022-11-02 21:11:04,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| Int) (v_ArrVal_529 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| Int) (v_ArrVal_527 Int) (v_ArrVal_525 Int) (v_ArrVal_530 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_525) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_527) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_529)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206|)))) is different from false [2022-11-02 21:11:04,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_208| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| Int) (v_ArrVal_529 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| Int) (v_ArrVal_527 Int) (v_ArrVal_525 Int) (v_ArrVal_530 (Array Int Int))) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_208| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_208|)) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_522) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_208| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_525) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_207| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_527) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_206| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_529)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-02 21:11:04,728 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:04,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 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 73 [2022-11-02 21:11:04,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:04,745 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 39 treesize of output 37 [2022-11-02 21:11:04,751 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 7 treesize of output 5 [2022-11-02 21:11:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 15 not checked. [2022-11-02 21:11:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116325292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:04,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:04,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-02 21:11:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387703111] [2022-11-02 21:11:04,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:11:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:11:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=340, Unknown=5, NotChecked=210, Total=650 [2022-11-02 21:11:04,823 INFO L87 Difference]: Start difference. First operand 259 states and 728 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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:11:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:05,602 INFO L93 Difference]: Finished difference Result 345 states and 853 transitions. [2022-11-02 21:11:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 17 [2022-11-02 21:11:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:05,606 INFO L225 Difference]: With dead ends: 345 [2022-11-02 21:11:05,607 INFO L226 Difference]: Without dead ends: 345 [2022-11-02 21:11:05,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=657, Unknown=5, NotChecked=300, Total=1190 [2022-11-02 21:11:05,609 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:05,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 380 Invalid, 0 Unknown, 267 Unchecked, 0.4s Time] [2022-11-02 21:11:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-02 21:11:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 259. [2022-11-02 21:11:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 3.334862385321101) internal successors, (727), 258 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:11:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 727 transitions. [2022-11-02 21:11:05,625 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 727 transitions. Word has length 17 [2022-11-02 21:11:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:05,625 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 727 transitions. [2022-11-02 21:11:05,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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:11:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 727 transitions. [2022-11-02 21:11:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:05,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:05,627 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:05,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:05,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:11:05,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1940403850, now seen corresponding path program 1 times [2022-11-02 21:11:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:05,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860483093] [2022-11-02 21:11:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860483093] [2022-11-02 21:11:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860483093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448734763] [2022-11-02 21:11:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:06,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:06,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:11:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:07,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 21:11:07,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:07,136 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 11 treesize of output 7 [2022-11-02 21:11:07,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,188 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 23 treesize of output 22 [2022-11-02 21:11:07,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,257 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 23 treesize of output 22 [2022-11-02 21:11:07,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,318 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 23 treesize of output 22 [2022-11-02 21:11:07,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,390 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 23 treesize of output 22 [2022-11-02 21:11:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,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 14 treesize of output 16 [2022-11-02 21:11:07,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,562 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 14 treesize of output 16 [2022-11-02 21:11:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:07,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:07,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 9223372039002259456)) is different from false [2022-11-02 21:11:07,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-02 21:11:07,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-11-02 21:11:07,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 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|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_609)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-11-02 21:11:07,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_607) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_609)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-02 21:11:07,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (v_ArrVal_605 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_605) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_607) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_609)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221|)))) is different from false [2022-11-02 21:11:07,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (v_ArrVal_605 Int) (v_ArrVal_604 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_223| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_223| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_605) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_607) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_609)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_223|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_221|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_223| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_222|)))) is different from false [2022-11-02 21:11:07,910 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:07,911 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 5 case distinctions, treesize of input 53 treesize of output 74 [2022-11-02 21:11:07,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:07,925 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 125 treesize of output 119 [2022-11-02 21:11:07,931 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:11:07,939 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 51 treesize of output 47 [2022-11-02 21:11:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 15 not checked. [2022-11-02 21:11:08,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448734763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:08,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:08,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-02 21:11:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314567936] [2022-11-02 21:11:08,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:08,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:11:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:11:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=466, Unknown=7, NotChecked=350, Total=930 [2022-11-02 21:11:08,093 INFO L87 Difference]: Start difference. First operand 259 states and 727 transitions. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:11:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:09,343 INFO L93 Difference]: Finished difference Result 340 states and 819 transitions. [2022-11-02 21:11:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:11:09,344 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 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 18 [2022-11-02 21:11:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:09,346 INFO L225 Difference]: With dead ends: 340 [2022-11-02 21:11:09,346 INFO L226 Difference]: Without dead ends: 340 [2022-11-02 21:11:09,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=770, Unknown=7, NotChecked=462, Total=1482 [2022-11-02 21:11:09,347 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:09,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 355 Invalid, 0 Unknown, 392 Unchecked, 0.5s Time] [2022-11-02 21:11:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-02 21:11:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 259. [2022-11-02 21:11:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 3.1788990825688073) internal successors, (693), 258 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:11:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 693 transitions. [2022-11-02 21:11:09,361 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 693 transitions. Word has length 18 [2022-11-02 21:11:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:09,364 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 693 transitions. [2022-11-02 21:11:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:11:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 693 transitions. [2022-11-02 21:11:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:09,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:09,369 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:09,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:11:09,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1940403808, now seen corresponding path program 1 times [2022-11-02 21:11:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889267416] [2022-11-02 21:11:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889267416] [2022-11-02 21:11:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889267416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381172885] [2022-11-02 21:11:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:10,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:10,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:11:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 21:11:10,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:10,898 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 11 treesize of output 7 [2022-11-02 21:11:10,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:10,954 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 25 treesize of output 24 [2022-11-02 21:11:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,009 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 25 treesize of output 24 [2022-11-02 21:11:11,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,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 25 treesize of output 24 [2022-11-02 21:11:11,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,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 25 treesize of output 24 [2022-11-02 21:11:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,203 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:11:11,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,304 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:11:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:11,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:11,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 4294967296))) is different from false [2022-11-02 21:11:11,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) c_~o_2~0.base) c_~o_2~0.offset) 4294967296))) is different from false [2022-11-02 21:11:11,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-11-02 21:11:11,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (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|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_692)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-11-02 21:11:11,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_689) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_692)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) is different from false [2022-11-02 21:11:11,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_692 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_687) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_689) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_692)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236|)))) is different from false [2022-11-02 21:11:11,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_685 Int) (v_ArrVal_692 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| Int) (v_ArrVal_694 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_238| Int) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_685) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_238| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_687) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_689) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_692)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_238| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_238|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_237| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_236|)))) is different from false [2022-11-02 21:11:11,622 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:11,623 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 5 case distinctions, treesize of input 55 treesize of output 76 [2022-11-02 21:11:11,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:11,641 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 143 treesize of output 137 [2022-11-02 21:11:11,649 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 61 treesize of output 57 [2022-11-02 21:11:11,656 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:11:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 15 not checked. [2022-11-02 21:11:11,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381172885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:11,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:11,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-11-02 21:11:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737253104] [2022-11-02 21:11:11,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:11,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 21:11:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 21:11:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=424, Unknown=7, NotChecked=336, Total=870 [2022-11-02 21:11:11,817 INFO L87 Difference]: Start difference. First operand 259 states and 693 transitions. Second operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 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:11:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:13,013 INFO L93 Difference]: Finished difference Result 323 states and 760 transitions. [2022-11-02 21:11:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:11:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 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 18 [2022-11-02 21:11:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:13,017 INFO L225 Difference]: With dead ends: 323 [2022-11-02 21:11:13,017 INFO L226 Difference]: Without dead ends: 323 [2022-11-02 21:11:13,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=713, Unknown=7, NotChecked=448, Total=1406 [2022-11-02 21:11:13,018 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:13,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 261 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2022-11-02 21:11:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-02 21:11:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 259. [2022-11-02 21:11:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 3.022935779816514) internal successors, (659), 258 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:11:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 659 transitions. [2022-11-02 21:11:13,030 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 659 transitions. Word has length 18 [2022-11-02 21:11:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:13,030 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 659 transitions. [2022-11-02 21:11:13,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 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:11:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 659 transitions. [2022-11-02 21:11:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:13,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:13,032 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:13,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:13,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 21:11:13,250 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1940266160, now seen corresponding path program 1 times [2022-11-02 21:11:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850942855] [2022-11-02 21:11:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850942855] [2022-11-02 21:11:15,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850942855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697924748] [2022-11-02 21:11:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:15,491 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:15,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:11:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:15,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 21:11:15,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:15,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:15,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:15,707 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:11:15,707 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:11:15,769 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 11 treesize of output 7 [2022-11-02 21:11:15,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:15,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 25 treesize of output 24 [2022-11-02 21:11:15,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:15,903 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 25 treesize of output 24 [2022-11-02 21:11:15,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:15,983 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 25 treesize of output 24 [2022-11-02 21:11:16,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:16,057 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 25 treesize of output 24 [2022-11-02 21:11:16,131 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:16,131 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:11:16,204 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:11:16,222 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:11:16,251 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:11:16,281 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:11:16,305 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:11:16,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:16,374 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:11:16,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:16,492 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:11:16,522 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 17 treesize of output 9 [2022-11-02 21:11:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:16,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:16,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_784) c_~o_0~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~o_0~0.offset))))) is different from false [2022-11-02 21:11:16,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_784) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:11:16,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_784) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:11:16,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_784) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:11:17,300 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:17,300 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 5 case distinctions, treesize of input 58 treesize of output 79 [2022-11-02 21:11:17,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:17,340 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 555 treesize of output 541 [2022-11-02 21:11:17,352 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 526 treesize of output 494 [2022-11-02 21:11:17,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 494 treesize of output 478 [2022-11-02 21:11:17,385 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 478 treesize of output 470 [2022-11-02 21:11:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:11:17,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697924748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:17,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:17,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 38 [2022-11-02 21:11:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012972553] [2022-11-02 21:11:17,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:17,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 21:11:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:17,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 21:11:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1094, Unknown=17, NotChecked=284, Total=1560 [2022-11-02 21:11:17,937 INFO L87 Difference]: Start difference. First operand 259 states and 659 transitions. Second operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:11:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:19,495 INFO L93 Difference]: Finished difference Result 306 states and 718 transitions. [2022-11-02 21:11:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:11:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 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 18 [2022-11-02 21:11:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:19,498 INFO L225 Difference]: With dead ends: 306 [2022-11-02 21:11:19,498 INFO L226 Difference]: Without dead ends: 306 [2022-11-02 21:11:19,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=319, Invalid=1750, Unknown=17, NotChecked=364, Total=2450 [2022-11-02 21:11:19,500 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 645 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:19,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 466 Invalid, 0 Unknown, 645 Unchecked, 0.6s Time] [2022-11-02 21:11:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-02 21:11:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2022-11-02 21:11:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 2.944954128440367) internal successors, (642), 258 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:11:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 642 transitions. [2022-11-02 21:11:19,511 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 642 transitions. Word has length 18 [2022-11-02 21:11:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:19,511 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 642 transitions. [2022-11-02 21:11:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:11:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 642 transitions. [2022-11-02 21:11:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:19,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:19,512 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:19,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-02 21:11:19,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 21:11:19,726 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1940266158, now seen corresponding path program 1 times [2022-11-02 21:11:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:19,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457550196] [2022-11-02 21:11:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:21,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457550196] [2022-11-02 21:11:21,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457550196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372839147] [2022-11-02 21:11:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:21,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:21,003 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:21,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 21:11:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 21:11:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,228 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:11:21,228 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:11:21,279 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 11 treesize of output 7 [2022-11-02 21:11:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,352 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 23 treesize of output 22 [2022-11-02 21:11:21,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,423 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 23 treesize of output 22 [2022-11-02 21:11:21,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,487 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 23 treesize of output 22 [2022-11-02 21:11:21,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,589 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 23 treesize of output 22 [2022-11-02 21:11:21,658 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:21,659 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:11:21,707 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 14 treesize of output 16 [2022-11-02 21:11:21,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 14 treesize of output 16 [2022-11-02 21:11:21,758 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 14 treesize of output 16 [2022-11-02 21:11:21,776 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 14 treesize of output 16 [2022-11-02 21:11:21,794 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 14 treesize of output 16 [2022-11-02 21:11:21,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,853 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 14 treesize of output 16 [2022-11-02 21:11:21,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:21,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 14 treesize of output 16 [2022-11-02 21:11:21,966 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 15 treesize of output 7 [2022-11-02 21:11:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:21,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:22,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_874) c_~o_0~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~o_0~0.offset)) 2147483648)) is different from false [2022-11-02 21:11:22,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_874) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-02 21:11:22,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_874) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-02 21:11:22,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_874) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-02 21:11:22,678 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:22,678 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 5 case distinctions, treesize of input 56 treesize of output 77 [2022-11-02 21:11:22,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:22,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 489 treesize of output 475 [2022-11-02 21:11:22,712 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 462 treesize of output 446 [2022-11-02 21:11:22,727 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 223 treesize of output 215 [2022-11-02 21:11:22,738 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 438 treesize of output 406 [2022-11-02 21:11:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:11:23,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372839147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:23,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:23,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-11-02 21:11:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271873678] [2022-11-02 21:11:23,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 21:11:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 21:11:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=820, Unknown=17, NotChecked=252, Total=1260 [2022-11-02 21:11:23,059 INFO L87 Difference]: Start difference. First operand 259 states and 642 transitions. Second operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 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:11:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,536 INFO L93 Difference]: Finished difference Result 276 states and 682 transitions. [2022-11-02 21:11:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 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 18 [2022-11-02 21:11:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,538 INFO L225 Difference]: With dead ends: 276 [2022-11-02 21:11:23,538 INFO L226 Difference]: Without dead ends: 276 [2022-11-02 21:11:23,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=924, Unknown=17, NotChecked=268, Total=1406 [2022-11-02 21:11:23,539 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 697 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:23,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 261 Invalid, 0 Unknown, 697 Unchecked, 0.3s Time] [2022-11-02 21:11:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-02 21:11:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2022-11-02 21:11:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 201 states have (on average 2.900497512437811) internal successors, (583), 241 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:11:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 583 transitions. [2022-11-02 21:11:23,548 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 583 transitions. Word has length 18 [2022-11-02 21:11:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,549 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 583 transitions. [2022-11-02 21:11:23,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 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:11:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 583 transitions. [2022-11-02 21:11:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:23,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,550 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:23,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:23,774 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1942863423, now seen corresponding path program 1 times [2022-11-02 21:11:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396680927] [2022-11-02 21:11:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 21:11:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396680927] [2022-11-02 21:11:23,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396680927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:11:23,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370511478] [2022-11-02 21:11:23,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:23,866 INFO L87 Difference]: Start difference. First operand 242 states and 583 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,982 INFO L93 Difference]: Finished difference Result 394 states and 968 transitions. [2022-11-02 21:11:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:11:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,985 INFO L225 Difference]: With dead ends: 394 [2022-11-02 21:11:23,985 INFO L226 Difference]: Without dead ends: 394 [2022-11-02 21:11:23,986 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:11:23,986 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:23,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-02 21:11:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 268. [2022-11-02 21:11:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 3.4140969162995596) internal successors, (775), 267 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:11:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 775 transitions. [2022-11-02 21:11:23,997 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 775 transitions. Word has length 18 [2022-11-02 21:11:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,998 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 775 transitions. [2022-11-02 21:11:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 775 transitions. [2022-11-02 21:11:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:23,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:24,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:11:24,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1942863466, now seen corresponding path program 1 times [2022-11-02 21:11:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848009245] [2022-11-02 21:11:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848009245] [2022-11-02 21:11:25,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848009245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:25,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145464876] [2022-11-02 21:11:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:25,988 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:26,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 21:11:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:26,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 21:11:26,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,250 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:11:26,250 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:11:26,312 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 11 treesize of output 7 [2022-11-02 21:11:26,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,390 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 23 treesize of output 22 [2022-11-02 21:11:26,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,457 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 23 treesize of output 22 [2022-11-02 21:11:26,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,530 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 23 treesize of output 22 [2022-11-02 21:11:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,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 23 treesize of output 22 [2022-11-02 21:11:26,672 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:26,673 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:11:26,742 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 14 treesize of output 16 [2022-11-02 21:11:26,753 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 14 treesize of output 16 [2022-11-02 21:11:26,784 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 14 treesize of output 16 [2022-11-02 21:11:26,801 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 14 treesize of output 16 [2022-11-02 21:11:26,820 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 14 treesize of output 16 [2022-11-02 21:11:26,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,882 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 14 treesize of output 16 [2022-11-02 21:11:26,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:26,948 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 14 treesize of output 16 [2022-11-02 21:11:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:27,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:27,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_999) c_~o_0~0.base) c_~o_0~0.offset) 9223372039002259456)) is different from false [2022-11-02 21:11:27,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_999) c_~o_0~0.base) c_~o_0~0.offset) 9223372039002259456)) is different from false [2022-11-02 21:11:27,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_997) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_999) c_~o_0~0.base) c_~o_0~0.offset) 9223372039002259456)) is different from false [2022-11-02 21:11:27,773 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:27,773 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 5 case distinctions, treesize of input 56 treesize of output 77 [2022-11-02 21:11:27,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:27,802 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 245 treesize of output 239 [2022-11-02 21:11:27,811 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 226 treesize of output 210 [2022-11-02 21:11:27,820 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 210 treesize of output 202 [2022-11-02 21:11:27,832 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 98 [2022-11-02 21:11:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:11:28,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145464876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:28,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:28,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2022-11-02 21:11:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900801192] [2022-11-02 21:11:28,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:28,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 21:11:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:28,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 21:11:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1018, Unknown=18, NotChecked=204, Total=1406 [2022-11-02 21:11:28,082 INFO L87 Difference]: Start difference. First operand 268 states and 775 transitions. Second operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:11:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:29,470 INFO L93 Difference]: Finished difference Result 368 states and 902 transitions. [2022-11-02 21:11:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:11:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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 18 [2022-11-02 21:11:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:29,476 INFO L225 Difference]: With dead ends: 368 [2022-11-02 21:11:29,476 INFO L226 Difference]: Without dead ends: 368 [2022-11-02 21:11:29,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=291, Invalid=1594, Unknown=19, NotChecked=258, Total=2162 [2022-11-02 21:11:29,478 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:29,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 419 Invalid, 0 Unknown, 527 Unchecked, 0.5s Time] [2022-11-02 21:11:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-11-02 21:11:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 268. [2022-11-02 21:11:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 3.299559471365639) internal successors, (749), 267 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:11:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 749 transitions. [2022-11-02 21:11:29,494 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 749 transitions. Word has length 18 [2022-11-02 21:11:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:29,496 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 749 transitions. [2022-11-02 21:11:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:11:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 749 transitions. [2022-11-02 21:11:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:29,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:29,501 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:29,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:29,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:11:29,726 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1942863428, now seen corresponding path program 1 times [2022-11-02 21:11:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:29,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075547293] [2022-11-02 21:11:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:11:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075547293] [2022-11-02 21:11:31,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075547293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418661088] [2022-11-02 21:11:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:31,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:31,414 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:31,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:11:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 21:11:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:31,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,672 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:11:31,672 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:11:31,721 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 11 treesize of output 7 [2022-11-02 21:11:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,798 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 25 treesize of output 24 [2022-11-02 21:11:31,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,857 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 25 treesize of output 24 [2022-11-02 21:11:31,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,921 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 25 treesize of output 24 [2022-11-02 21:11:31,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:31,996 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 25 treesize of output 24 [2022-11-02 21:11:32,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:32,060 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:11:32,140 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:11:32,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 16 treesize of output 18 [2022-11-02 21:11:32,179 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:11:32,210 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:11:32,238 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:11:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:32,302 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:11:32,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:32,367 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:11:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:32,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:32,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1089) c_~o_0~0.base) c_~o_0~0.offset) 4294967296))) is different from false [2022-11-02 21:11:32,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1088 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1089) c_~o_0~0.base) c_~o_0~0.offset) 4294967296))) is different from false [2022-11-02 21:11:32,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1089) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-02 21:11:33,127 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:33,128 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 5 case distinctions, treesize of input 58 treesize of output 79 [2022-11-02 21:11:33,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:33,147 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 279 treesize of output 273 [2022-11-02 21:11:33,156 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 258 treesize of output 250 [2022-11-02 21:11:33,164 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 250 treesize of output 234 [2022-11-02 21:11:33,172 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 234 treesize of output 230 [2022-11-02 21:11:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-02 21:11:33,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418661088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:33,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:33,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2022-11-02 21:11:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243852884] [2022-11-02 21:11:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:33,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 21:11:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:33,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 21:11:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=774, Unknown=16, NotChecked=180, Total=1122 [2022-11-02 21:11:33,467 INFO L87 Difference]: Start difference. First operand 268 states and 749 transitions. Second operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:34,470 INFO L93 Difference]: Finished difference Result 342 states and 836 transitions. [2022-11-02 21:11:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 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 18 [2022-11-02 21:11:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:34,473 INFO L225 Difference]: With dead ends: 342 [2022-11-02 21:11:34,474 INFO L226 Difference]: Without dead ends: 342 [2022-11-02 21:11:34,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=241, Invalid=1236, Unknown=17, NotChecked=228, Total=1722 [2022-11-02 21:11:34,475 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:34,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 295 Invalid, 0 Unknown, 526 Unchecked, 0.4s Time] [2022-11-02 21:11:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-02 21:11:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 268. [2022-11-02 21:11:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 3.185022026431718) internal successors, (723), 267 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:11:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 723 transitions. [2022-11-02 21:11:34,486 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 723 transitions. Word has length 18 [2022-11-02 21:11:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:34,486 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 723 transitions. [2022-11-02 21:11:34,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 723 transitions. [2022-11-02 21:11:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:34,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:34,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:34,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:34,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:34,710 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1942863427, now seen corresponding path program 1 times [2022-11-02 21:11:34,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:34,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490822043] [2022-11-02 21:11:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:34,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:35,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490822043] [2022-11-02 21:11:35,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490822043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517304146] [2022-11-02 21:11:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:35,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:35,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:35,566 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:35,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 21:11:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:11:35,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:35,908 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 11 treesize of output 7 [2022-11-02 21:11:35,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:35,959 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 25 treesize of output 24 [2022-11-02 21:11:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,018 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 25 treesize of output 24 [2022-11-02 21:11:36,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,084 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 25 treesize of output 24 [2022-11-02 21:11:36,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,143 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 25 treesize of output 24 [2022-11-02 21:11:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,194 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:11:36,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,235 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:11:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:36,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:36,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1171 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) c_~o_2~0.base) c_~o_2~0.offset)))) is different from false [2022-11-02 21:11:36,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-02 21:11:36,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1168 Int) (v_ArrVal_1171 (Array Int Int))) (< 0 (+ 2147483649 (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|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-02 21:11:36,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| Int) (v_ArrVal_1171 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1166) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311|)))) is different from false [2022-11-02 21:11:36,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1164 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| Int) (v_ArrVal_1171 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1164) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1166) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312|)))) is different from false [2022-11-02 21:11:36,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (v_ArrVal_1166 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_313| Int) (v_ArrVal_1168 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| Int) (v_ArrVal_1171 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1163) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_313| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1164) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1166) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_311|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_313| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_312|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_313|)))) is different from false [2022-11-02 21:11:36,534 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-02 21:11:36,535 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 5 case distinctions, treesize of input 55 treesize of output 76 [2022-11-02 21:11:36,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:36,547 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 143 treesize of output 137 [2022-11-02 21:11:36,552 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:11:36,558 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 110 [2022-11-02 21:11:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 15 not checked. [2022-11-02 21:11:36,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517304146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:36,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:36,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-11-02 21:11:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174241554] [2022-11-02 21:11:36,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:36,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 21:11:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 21:11:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=418, Unknown=6, NotChecked=282, Total=812 [2022-11-02 21:11:36,689 INFO L87 Difference]: Start difference. First operand 268 states and 723 transitions. Second operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:11:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:37,453 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2022-11-02 21:11:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:11:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 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 18 [2022-11-02 21:11:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:37,456 INFO L225 Difference]: With dead ends: 316 [2022-11-02 21:11:37,456 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 21:11:37,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=710, Unknown=6, NotChecked=378, Total=1332 [2022-11-02 21:11:37,457 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 263 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:37,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 0 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 285 Invalid, 0 Unknown, 272 Unchecked, 0.3s Time] [2022-11-02 21:11:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 21:11:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 268. [2022-11-02 21:11:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 3.0704845814977975) internal successors, (697), 267 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:11:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 697 transitions. [2022-11-02 21:11:37,466 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 697 transitions. Word has length 18 [2022-11-02 21:11:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:37,466 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 697 transitions. [2022-11-02 21:11:37,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:11:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 697 transitions. [2022-11-02 21:11:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:37,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:37,467 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:37,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:37,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:37,692 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 21:11:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1942863426, now seen corresponding path program 1 times [2022-11-02 21:11:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:37,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121686597] [2022-11-02 21:11:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121686597] [2022-11-02 21:11:38,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121686597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512808572] [2022-11-02 21:11:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:38,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:38,490 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:38,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90ca046-88a4-41d4-8368-4aa857e174f3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 21:11:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:38,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:11:38,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:38,779 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 11 treesize of output 7 [2022-11-02 21:11:38,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:38,833 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 23 treesize of output 22 [2022-11-02 21:11:38,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:38,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 23 treesize of output 22 [2022-11-02 21:11:38,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:38,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 23 treesize of output 22 [2022-11-02 21:11:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:38,989 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 23 treesize of output 22 [2022-11-02 21:11:39,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:39,028 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 14 treesize of output 16 [2022-11-02 21:11:39,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:39,068 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 14 treesize of output 16 [2022-11-02 21:11:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:11:39,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:39,486 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~o_0~0.base Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse0 (select (select .cse1 ~o_0~0.base) ~o_0~0.offset))) (or (<= .cse0 0) (not (<= .cse0 9223372039002259455)) (<= (select (select .cse1 c_~o_2~0.base) c_~o_2~0.offset) (+ 2147483647 .cse0)))))) (forall ((~o_0~0.base Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse2 (select (select .cse3 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= .cse2 0)) (not (<= 0 .cse2)) (<= (select (select .cse3 c_~o_2~0.base) c_~o_2~0.offset) (+ 2147483647 .cse2))))))) is different from false [2022-11-02 21:11:39,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~o_0~0.base Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse0 (select (select .cse1 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= .cse0 9223372039002259455)) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse0)) (<= .cse0 0))))) (forall ((~o_0~0.base Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse3 (select (select .cse2 ~o_0~0.base) ~o_0~0.offset))) (or (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse3)) (not (<= .cse3 0)) (not (<= 0 .cse3))))))) is different from false [2022-11-02 21:11:39,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse3 v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse0 (select (select .cse1 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= .cse0 0)) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse0)) (not (<= 0 .cse0)))))) (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse3 v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse4 (select (select .cse5 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= .cse4 9223372039002259455)) (<= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse4)) (<= .cse4 0))))))) is different from false [2022-11-02 21:11:39,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)) (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse1 (select (select .cse2 ~o_0~0.base) ~o_0~0.offset))) (or (<= .cse1 0) (not (<= .cse1 9223372039002259455)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse1)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)) (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse5 (select (select .cse6 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= 0 .cse5)) (<= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse5)) (not (<= .cse5 0)))))))))) is different from false [2022-11-02 21:11:41,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327|)) (forall ((v_ArrVal_1246 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse3 .cse4 v_ArrVal_1246) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse1 (select (select .cse2 ~o_0~0.base) ~o_0~0.offset))) (or (<= .cse1 0) (not (<= .cse1 9223372039002259455)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 2147483647)))))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327|)) (forall ((v_ArrVal_1246 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse3 .cse4 v_ArrVal_1246) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse5 (select (select .cse6 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= .cse5 0)) (<= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse5 2147483647)) (not (<= 0 .cse5)))))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)))))))) is different from false [2022-11-02 21:11:44,037 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| Int)) (or (forall ((v_ArrVal_1244 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| Int)) (or (forall ((v_ArrVal_1246 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)) (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store .cse2 .cse3 v_ArrVal_1244) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1246) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse0 (select (select .cse1 ~o_0~0.base) ~o_0~0.offset))) (or (<= .cse0 0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse0)) (not (<= .cse0 9223372039002259455)))))))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327|)))) (not (<= .cse4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328|)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| Int)) (or (forall ((v_ArrVal_1244 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| Int)) (or (forall ((v_ArrVal_1246 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| Int)) (or (forall ((~o_0~0.base Int) (v_ArrVal_1251 Int) (~o_0~0.offset Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store .cse2 .cse3 v_ArrVal_1244) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1246) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1249) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1251)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1253))) (let ((.cse5 (select (select .cse6 ~o_0~0.base) ~o_0~0.offset))) (or (not (<= 0 .cse5)) (<= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2147483647 .cse5)) (not (<= .cse5 0)))))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_326|)))) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_327|)))) (not (<= .cse4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_328|)))))) is different from false [2022-11-02 21:11:44,567 INFO L356 Elim1Store]: treesize reduction 576, result has 32.2 percent of original size [2022-11-02 21:11:44,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 464 treesize of output 426 [2022-11-02 21:11:44,638 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-02 21:11:44,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 646 treesize of output 628 [2022-11-02 21:11:44,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:44,683 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 492 treesize of output 461 [2022-11-02 21:11:44,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:44,725 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 452 treesize of output 441 [2022-11-02 21:11:44,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:44,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1252 treesize of output 1230 [2022-11-02 21:11:44,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:44,862 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 1080 treesize of output 1053 [2022-11-02 21:11:44,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:44,934 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 1044 treesize of output 981 [2022-11-02 21:11:57,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:57,087 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 254 treesize of output 246 [2022-11-02 21:11:57,781 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:12:02,438 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 9 treesize of output 3 [2022-11-02 21:12:02,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:02,477 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 422 treesize of output 435 [2022-11-02 21:12:03,100 INFO L356 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-02 21:12:03,100 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 44 treesize of output 1 [2022-11-02 21:12:03,166 INFO L356 Elim1Store]: treesize reduction 138, result has 0.7 percent of original size [2022-11-02 21:12:03,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 136 treesize of output 1 [2022-11-02 21:12:05,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:05,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 1538 treesize of output 2135