./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/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_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/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_dbf7a0c4-bb0f-4400-8f66-62306077b484/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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:44:26,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:44:26,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:44:26,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:44:26,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:44:26,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:44:26,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:44:26,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:44:26,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:44:26,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:44:26,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:44:26,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:44:26,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:44:26,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:44:26,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:44:26,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:44:26,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:44:26,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:44:26,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:44:26,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:44:26,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:44:26,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:44:26,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:44:26,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:44:26,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:44:26,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:44:26,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:44:26,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:44:26,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:44:26,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:44:26,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:44:26,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:44:26,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:44:26,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:44:26,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:44:26,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:44:26,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:44:26,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:44:26,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:44:26,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:44:26,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:44:26,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:44:26,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:44:26,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:44:26,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:44:26,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:44:26,981 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:44:26,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:44:26,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:44:26,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:44:26,982 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:44:26,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:44:26,983 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:44:26,984 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:44:26,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:44:26,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:44:26,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:44:26,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:44:26,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:44:26,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:44:26,985 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:44:26,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:44:26,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:44:26,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:44:26,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:44:26,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:44:26,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:44:26,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:44:26,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:26,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:44:26,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:44:26,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:44:26,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:44:26,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:44:26,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:44:26,990 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_dbf7a0c4-bb0f-4400-8f66-62306077b484/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_dbf7a0c4-bb0f-4400-8f66-62306077b484/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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2022-11-02 20:44:27,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:44:27,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:44:27,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:44:27,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:44:27,259 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:44:27,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2022-11-02 20:44:27,354 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/data/1b94b69eb/7fbbe163fbe84d038cf34ea24f89c8f8/FLAG887811118 [2022-11-02 20:44:27,924 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:44:27,926 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/sv-benchmarks/c/bitvector/byte_add_2-1.i [2022-11-02 20:44:27,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/data/1b94b69eb/7fbbe163fbe84d038cf34ea24f89c8f8/FLAG887811118 [2022-11-02 20:44:28,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/data/1b94b69eb/7fbbe163fbe84d038cf34ea24f89c8f8 [2022-11-02 20:44:28,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:44:28,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:44:28,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:28,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:44:28,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:44:28,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298006f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28, skipping insertion in model container [2022-11-02 20:44:28,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:44:28,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:44:28,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2022-11-02 20:44:28,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:28,652 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:44:28,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2022-11-02 20:44:28,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:28,699 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:44:28,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28 WrapperNode [2022-11-02 20:44:28,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:28,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:28,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:44:28,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:44:28,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,784 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2022-11-02 20:44:28,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:28,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:44:28,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:44:28,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:44:28,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:44:28,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:44:28,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:44:28,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:44:28,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (1/1) ... [2022-11-02 20:44:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:28,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:28,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:28,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:44:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:44:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:44:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:44:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:44:29,037 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:44:29,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:44:29,570 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:44:29,577 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:44:29,577 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:44:29,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:29 BoogieIcfgContainer [2022-11-02 20:44:29,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:44:29,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:44:29,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:44:29,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:44:29,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:44:28" (1/3) ... [2022-11-02 20:44:29,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28351d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:29, skipping insertion in model container [2022-11-02 20:44:29,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:28" (2/3) ... [2022-11-02 20:44:29,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28351d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:29, skipping insertion in model container [2022-11-02 20:44:29,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:29" (3/3) ... [2022-11-02 20:44:29,592 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2022-11-02 20:44:29,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:44:29,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-02 20:44:29,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:44:29,704 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;@645284f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:44:29,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-02 20:44:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:44:29,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:29,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:44:29,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-02 20:44:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:29,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871787053] [2022-11-02 20:44:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871787053] [2022-11-02 20:44:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871787053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:29,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:29,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:44:29,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997912677] [2022-11-02 20:44:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:44:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:44:29,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:44:29,973 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:30,005 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2022-11-02 20:44:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:44:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-02 20:44:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:30,019 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:44:30,020 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:44:30,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:44:30,027 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:30,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:44:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:44:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-11-02 20:44:30,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2022-11-02 20:44:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:30,068 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-11-02 20:44:30,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-11-02 20:44:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:44:30,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:30,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:30,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:44:30,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2022-11-02 20:44:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658625509] [2022-11-02 20:44:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:30,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:30,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658625509] [2022-11-02 20:44:30,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658625509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:30,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:30,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301090793] [2022-11-02 20:44:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:30,252 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:30,414 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2022-11-02 20:44:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:44:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:30,416 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:44:30,416 INFO L226 Difference]: Without dead ends: 98 [2022-11-02 20:44:30,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:30,418 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:30,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-02 20:44:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-11-02 20:44:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2022-11-02 20:44:30,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2022-11-02 20:44:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:30,429 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2022-11-02 20:44:30,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2022-11-02 20:44:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:44:30,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:30,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:30,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:44:30,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2022-11-02 20:44:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:30,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966203744] [2022-11-02 20:44:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:44:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:30,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966203744] [2022-11-02 20:44:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966203744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:30,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:30,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:44:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742188307] [2022-11-02 20:44:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:30,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:44:30,741 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20:44:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:31,023 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2022-11-02 20:44:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20 [2022-11-02 20:44:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:31,032 INFO L225 Difference]: With dead ends: 221 [2022-11-02 20:44:31,032 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:44:31,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:31,037 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:31,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:44:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2022-11-02 20:44:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-11-02 20:44:31,064 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2022-11-02 20:44:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-11-02 20:44:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20:44:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-11-02 20:44:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:44:31,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:31,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:31,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:44:31,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2022-11-02 20:44:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:31,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167499792] [2022-11-02 20:44:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:44:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:31,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167499792] [2022-11-02 20:44:31,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167499792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:31,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:31,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284446975] [2022-11-02 20:44:31,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:31,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:31,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:31,351 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:31,360 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2022-11-02 20:44:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:31,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:44:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:31,361 INFO L225 Difference]: With dead ends: 162 [2022-11-02 20:44:31,362 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:44:31,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:31,364 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 80 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:31,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:44:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-02 20:44:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2022-11-02 20:44:31,373 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2022-11-02 20:44:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:31,374 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2022-11-02 20:44:31,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2022-11-02 20:44:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:44:31,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:31,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:31,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:44:31,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1486873965, now seen corresponding path program 1 times [2022-11-02 20:44:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:31,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201676754] [2022-11-02 20:44:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:31,470 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 20:44:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201676754] [2022-11-02 20:44:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201676754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:31,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:31,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241811420] [2022-11-02 20:44:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:31,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:31,474 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:31,487 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-11-02 20:44:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-02 20:44:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:31,489 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:44:31,489 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:44:31,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:31,491 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:31,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:44:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-02 20:44:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2022-11-02 20:44:31,499 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2022-11-02 20:44:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2022-11-02 20:44:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2022-11-02 20:44:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:44:31,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:31,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:31,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:44:31,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1796976081, now seen corresponding path program 1 times [2022-11-02 20:44:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381037949] [2022-11-02 20:44:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:31,760 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 20:44:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:31,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381037949] [2022-11-02 20:44:31,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381037949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:31,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:31,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:44:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439995392] [2022-11-02 20:44:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:44:31,763 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:31,992 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2022-11-02 20:44:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-02 20:44:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:31,994 INFO L225 Difference]: With dead ends: 247 [2022-11-02 20:44:31,994 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 20:44:31,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:31,995 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 113 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:31,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 20:44:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2022-11-02 20:44:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-02 20:44:32,011 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 29 [2022-11-02 20:44:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:32,011 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-02 20:44:32,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-02 20:44:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:44:32,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:32,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:32,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:44:32,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2022-11-02 20:44:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:32,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842978096] [2022-11-02 20:44:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,128 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 20:44:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:32,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842978096] [2022-11-02 20:44:32,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842978096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:32,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246856736] [2022-11-02 20:44:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:32,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:32,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:44:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:44:32,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:32,372 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 20:44:32,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:32,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246856736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:32,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:32,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-02 20:44:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407531364] [2022-11-02 20:44:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:32,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:32,375 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:32,588 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2022-11-02 20:44:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:44:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:32,590 INFO L225 Difference]: With dead ends: 213 [2022-11-02 20:44:32,590 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:44:32,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:32,591 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:32,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 132 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:44:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2022-11-02 20:44:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2022-11-02 20:44:32,610 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2022-11-02 20:44:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:32,610 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2022-11-02 20:44:32,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2022-11-02 20:44:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:44:32,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:32,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:32,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:32,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:32,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2022-11-02 20:44:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:32,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383647106] [2022-11-02 20:44:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:33,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383647106] [2022-11-02 20:44:33,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383647106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:33,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815481514] [2022-11-02 20:44:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:33,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:33,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:33,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:33,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:44:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:33,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:44:33,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:44:33,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:33,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815481514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:33,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:33,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-02 20:44:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045978005] [2022-11-02 20:44:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:33,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:33,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:33,410 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 20:44:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:33,523 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2022-11-02 20:44:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 39 [2022-11-02 20:44:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:33,526 INFO L225 Difference]: With dead ends: 255 [2022-11-02 20:44:33,526 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 20:44:33,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:33,531 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 104 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:33,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 104 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 20:44:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2022-11-02 20:44:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2022-11-02 20:44:33,552 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 39 [2022-11-02 20:44:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:33,552 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2022-11-02 20:44:33,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 20:44:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2022-11-02 20:44:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:44:33,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:33,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:33,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:33,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:33,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1054853098, now seen corresponding path program 1 times [2022-11-02 20:44:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:33,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821397089] [2022-11-02 20:44:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:44:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821397089] [2022-11-02 20:44:33,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821397089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:33,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:33,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:44:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139887402] [2022-11-02 20:44:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:33,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:44:33,982 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:34,159 INFO L93 Difference]: Finished difference Result 326 states and 434 transitions. [2022-11-02 20:44:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:34,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 20:44:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:34,161 INFO L225 Difference]: With dead ends: 326 [2022-11-02 20:44:34,161 INFO L226 Difference]: Without dead ends: 230 [2022-11-02 20:44:34,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:34,162 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 97 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:34,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 118 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-02 20:44:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2022-11-02 20:44:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2022-11-02 20:44:34,171 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 48 [2022-11-02 20:44:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:34,172 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2022-11-02 20:44:34,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2022-11-02 20:44:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:44:34,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:34,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:44:34,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -847771261, now seen corresponding path program 1 times [2022-11-02 20:44:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743867682] [2022-11-02 20:44:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:44:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:34,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743867682] [2022-11-02 20:44:34,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743867682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:34,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:34,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:44:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575208573] [2022-11-02 20:44:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:44:34,314 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:34,479 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2022-11-02 20:44:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 64 [2022-11-02 20:44:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:34,483 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:44:34,483 INFO L226 Difference]: Without dead ends: 295 [2022-11-02 20:44:34,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:34,484 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 116 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:34,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 111 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-02 20:44:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2022-11-02 20:44:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2022-11-02 20:44:34,498 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 64 [2022-11-02 20:44:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:34,498 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2022-11-02 20:44:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2022-11-02 20:44:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:44:34,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:34,500 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:44:34,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2022-11-02 20:44:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:34,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835549015] [2022-11-02 20:44:34,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-02 20:44:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:34,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835549015] [2022-11-02 20:44:34,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835549015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:34,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:34,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:44:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259453107] [2022-11-02 20:44:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:34,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:34,795 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:35,107 INFO L93 Difference]: Finished difference Result 759 states and 1046 transitions. [2022-11-02 20:44:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:44:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 80 [2022-11-02 20:44:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:35,110 INFO L225 Difference]: With dead ends: 759 [2022-11-02 20:44:35,111 INFO L226 Difference]: Without dead ends: 586 [2022-11-02 20:44:35,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:35,112 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 205 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:35,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 416 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-02 20:44:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 195. [2022-11-02 20:44:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2022-11-02 20:44:35,125 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 80 [2022-11-02 20:44:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:35,125 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2022-11-02 20:44:35,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2022-11-02 20:44:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:44:35,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:35,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:44:35,127 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2022-11-02 20:44:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:35,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114719442] [2022-11-02 20:44:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-02 20:44:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:35,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114719442] [2022-11-02 20:44:35,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114719442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:35,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:35,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:44:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742565618] [2022-11-02 20:44:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:35,374 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:35,485 INFO L93 Difference]: Finished difference Result 632 states and 874 transitions. [2022-11-02 20:44:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:44:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:35,488 INFO L225 Difference]: With dead ends: 632 [2022-11-02 20:44:35,488 INFO L226 Difference]: Without dead ends: 459 [2022-11-02 20:44:35,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:35,490 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 180 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:35,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 226 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-11-02 20:44:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 336. [2022-11-02 20:44:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 335 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2022-11-02 20:44:35,511 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 83 [2022-11-02 20:44:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:35,512 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2022-11-02 20:44:35,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2022-11-02 20:44:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:44:35,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:35,514 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:35,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:44:35,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2022-11-02 20:44:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:35,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065324498] [2022-11-02 20:44:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-02 20:44:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065324498] [2022-11-02 20:44:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065324498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:35,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:35,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:35,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722888853] [2022-11-02 20:44:35,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:35,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:35,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:35,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:35,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:35,717 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:36,158 INFO L93 Difference]: Finished difference Result 1674 states and 2332 transitions. [2022-11-02 20:44:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:44:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 83 [2022-11-02 20:44:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:36,164 INFO L225 Difference]: With dead ends: 1674 [2022-11-02 20:44:36,164 INFO L226 Difference]: Without dead ends: 1360 [2022-11-02 20:44:36,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:36,166 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 308 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:36,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 542 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-11-02 20:44:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 336. [2022-11-02 20:44:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 335 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2022-11-02 20:44:36,190 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 83 [2022-11-02 20:44:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:36,191 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2022-11-02 20:44:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2022-11-02 20:44:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:44:36,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:36,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:44:36,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2022-11-02 20:44:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:36,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876926646] [2022-11-02 20:44:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:44:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876926646] [2022-11-02 20:44:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876926646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187590641] [2022-11-02 20:44:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:36,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:36,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:36,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:36,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:44:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:36,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:44:36,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:44:36,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:44:36,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187590641] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:36,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:36,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-11-02 20:44:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722478746] [2022-11-02 20:44:36,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:36,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:44:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:44:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:44:36,759 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:37,284 INFO L93 Difference]: Finished difference Result 1651 states and 2372 transitions. [2022-11-02 20:44:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:44:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 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 83 [2022-11-02 20:44:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:37,290 INFO L225 Difference]: With dead ends: 1651 [2022-11-02 20:44:37,290 INFO L226 Difference]: Without dead ends: 1327 [2022-11-02 20:44:37,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:44:37,292 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 476 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:37,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 394 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:44:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-11-02 20:44:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1127. [2022-11-02 20:44:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.3454706927175843) internal successors, (1515), 1126 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1515 transitions. [2022-11-02 20:44:37,360 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1515 transitions. Word has length 83 [2022-11-02 20:44:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:37,362 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1515 transitions. [2022-11-02 20:44:37,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1515 transitions. [2022-11-02 20:44:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:44:37,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:37,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:37,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:37,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:44:37,588 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash 6193209, now seen corresponding path program 1 times [2022-11-02 20:44:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:37,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647654346] [2022-11-02 20:44:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-02 20:44:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:37,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647654346] [2022-11-02 20:44:37,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647654346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:37,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:37,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049982322] [2022-11-02 20:44:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:37,831 INFO L87 Difference]: Start difference. First operand 1127 states and 1515 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:38,492 INFO L93 Difference]: Finished difference Result 2876 states and 3860 transitions. [2022-11-02 20:44:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:44:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 85 [2022-11-02 20:44:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:38,499 INFO L225 Difference]: With dead ends: 2876 [2022-11-02 20:44:38,499 INFO L226 Difference]: Without dead ends: 2210 [2022-11-02 20:44:38,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:44:38,501 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 409 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:38,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 812 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:44:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-11-02 20:44:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1120. [2022-11-02 20:44:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 1.3467381590705987) internal successors, (1507), 1119 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1507 transitions. [2022-11-02 20:44:38,565 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1507 transitions. Word has length 85 [2022-11-02 20:44:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:38,565 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1507 transitions. [2022-11-02 20:44:38,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1507 transitions. [2022-11-02 20:44:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:44:38,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:38,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:38,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:44:38,568 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2022-11-02 20:44:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:38,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375415804] [2022-11-02 20:44:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:44:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375415804] [2022-11-02 20:44:38,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375415804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166648434] [2022-11-02 20:44:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:38,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:38,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:44:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:39,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:44:39,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 20:44:39,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:40,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166648434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:40,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:40,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 11] total 21 [2022-11-02 20:44:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192941798] [2022-11-02 20:44:40,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:44:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:44:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:44:40,043 INFO L87 Difference]: Start difference. First operand 1120 states and 1507 transitions. Second operand has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:46,126 INFO L93 Difference]: Finished difference Result 4310 states and 5618 transitions. [2022-11-02 20:44:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-02 20:44:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 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 89 [2022-11-02 20:44:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:46,136 INFO L225 Difference]: With dead ends: 4310 [2022-11-02 20:44:46,137 INFO L226 Difference]: Without dead ends: 3213 [2022-11-02 20:44:46,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1093, Invalid=6389, Unknown=0, NotChecked=0, Total=7482 [2022-11-02 20:44:46,143 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1690 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:46,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 2165 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 20:44:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2022-11-02 20:44:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 1012. [2022-11-02 20:44:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.3333333333333333) internal successors, (1348), 1011 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1348 transitions. [2022-11-02 20:44:46,217 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1348 transitions. Word has length 89 [2022-11-02 20:44:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:46,217 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1348 transitions. [2022-11-02 20:44:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1348 transitions. [2022-11-02 20:44:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:44:46,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:46,219 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:46,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:44:46,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 365632685, now seen corresponding path program 1 times [2022-11-02 20:44:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511498395] [2022-11-02 20:44:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:44:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511498395] [2022-11-02 20:44:46,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511498395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275460231] [2022-11-02 20:44:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:46,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:46,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:44:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:47,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:44:47,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:44:47,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:44:47,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275460231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:47,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-11-02 20:44:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731427931] [2022-11-02 20:44:47,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:47,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:44:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:47,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:44:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:44:47,944 INFO L87 Difference]: Start difference. First operand 1012 states and 1348 transitions. Second operand has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:49,639 INFO L93 Difference]: Finished difference Result 5923 states and 7604 transitions. [2022-11-02 20:44:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:44:49,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 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 91 [2022-11-02 20:44:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:49,654 INFO L225 Difference]: With dead ends: 5923 [2022-11-02 20:44:49,655 INFO L226 Difference]: Without dead ends: 5832 [2022-11-02 20:44:49,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2022-11-02 20:44:49,657 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 752 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:49,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1311 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:44:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2022-11-02 20:44:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 1291. [2022-11-02 20:44:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.3666666666666667) internal successors, (1763), 1290 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1763 transitions. [2022-11-02 20:44:49,763 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1763 transitions. Word has length 91 [2022-11-02 20:44:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:49,764 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1763 transitions. [2022-11-02 20:44:49,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1763 transitions. [2022-11-02 20:44:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:44:49,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:49,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:49,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:49,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:44:49,972 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -502969241, now seen corresponding path program 1 times [2022-11-02 20:44:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806033232] [2022-11-02 20:44:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:44:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806033232] [2022-11-02 20:44:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806033232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:50,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038569053] [2022-11-02 20:44:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:50,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:50,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:44:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:50,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:44:50,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:44:50,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:44:50,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038569053] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:50,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:44:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-11-02 20:44:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809397779] [2022-11-02 20:44:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:50,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:50,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:50,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:50,458 INFO L87 Difference]: Start difference. First operand 1291 states and 1763 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:50,766 INFO L93 Difference]: Finished difference Result 3645 states and 4946 transitions. [2022-11-02 20:44:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 97 [2022-11-02 20:44:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:50,771 INFO L225 Difference]: With dead ends: 3645 [2022-11-02 20:44:50,771 INFO L226 Difference]: Without dead ends: 1547 [2022-11-02 20:44:50,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:44:50,774 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:50,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 142 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-11-02 20:44:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 833. [2022-11-02 20:44:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.3641826923076923) internal successors, (1135), 832 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1135 transitions. [2022-11-02 20:44:50,836 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1135 transitions. Word has length 97 [2022-11-02 20:44:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 1135 transitions. [2022-11-02 20:44:50,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1135 transitions. [2022-11-02 20:44:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:44:50,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:50,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:50,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:51,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:44:51,062 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -434064558, now seen corresponding path program 1 times [2022-11-02 20:44:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:51,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257752438] [2022-11-02 20:44:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:44:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257752438] [2022-11-02 20:44:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257752438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:51,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:51,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863097474] [2022-11-02 20:44:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:51,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:51,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:51,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:51,247 INFO L87 Difference]: Start difference. First operand 833 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:51,603 INFO L93 Difference]: Finished difference Result 1914 states and 2568 transitions. [2022-11-02 20:44:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:44:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 98 [2022-11-02 20:44:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:51,606 INFO L225 Difference]: With dead ends: 1914 [2022-11-02 20:44:51,607 INFO L226 Difference]: Without dead ends: 935 [2022-11-02 20:44:51,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:51,608 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 152 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:51,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 215 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-11-02 20:44:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 809. [2022-11-02 20:44:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.3440594059405941) internal successors, (1086), 808 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1086 transitions. [2022-11-02 20:44:51,659 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1086 transitions. Word has length 98 [2022-11-02 20:44:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:51,660 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1086 transitions. [2022-11-02 20:44:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1086 transitions. [2022-11-02 20:44:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:44:51,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:51,662 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:44:51,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:44:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2022-11-02 20:44:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108065033] [2022-11-02 20:44:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:51,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:51,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:51,807 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:44:51,808 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-11-02 20:44:51,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-11-02 20:44:51,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-11-02 20:44:51,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-11-02 20:44:51,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-11-02 20:44:51,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-11-02 20:44:51,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-11-02 20:44:51,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-11-02 20:44:51,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-11-02 20:44:51,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-11-02 20:44:51,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-11-02 20:44:51,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-11-02 20:44:51,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-11-02 20:44:51,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-11-02 20:44:51,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-11-02 20:44:51,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-11-02 20:44:51,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-11-02 20:44:51,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-11-02 20:44:51,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-11-02 20:44:51,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-11-02 20:44:51,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-11-02 20:44:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-11-02 20:44:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-11-02 20:44:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-11-02 20:44:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-11-02 20:44:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-11-02 20:44:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-11-02 20:44:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-11-02 20:44:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-11-02 20:44:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-11-02 20:44:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-11-02 20:44:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-11-02 20:44:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-11-02 20:44:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-11-02 20:44:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-11-02 20:44:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-11-02 20:44:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-11-02 20:44:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-11-02 20:44:51,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:44:51,822 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:51,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:44:51,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:44:51 BoogieIcfgContainer [2022-11-02 20:44:51,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:44:51,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:44:51,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:44:51,935 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:44:51,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:29" (3/4) ... [2022-11-02 20:44:51,938 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:44:51,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:44:51,939 INFO L158 Benchmark]: Toolchain (without parser) took 23658.62ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 84.3MB in the beginning and 178.3MB in the end (delta: -94.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,939 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:51,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.92ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 90.4MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.27ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 83.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,940 INFO L158 Benchmark]: Boogie Preprocessor took 90.93ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 79.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,940 INFO L158 Benchmark]: RCFGBuilder took 702.38ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 84.2MB in the end (delta: -4.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,941 INFO L158 Benchmark]: TraceAbstraction took 22351.86ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 83.2MB in the beginning and 178.3MB in the end (delta: -95.1MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. [2022-11-02 20:44:51,941 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 224.4MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:51,943 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.92ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 90.4MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.27ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 83.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.93ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 79.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 702.38ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 84.2MB in the end (delta: -4.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22351.86ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 83.2MB in the beginning and 178.3MB in the end (delta: -95.1MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 224.4MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4060086272] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4060086272] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4060086272] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4060086272] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4060086272] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086272] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086272] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086272] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086272] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086272] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086272, r1=1] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=4060086272, r1=1] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=4060086272, r1=1] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086272, r1=1, r2=1] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086272, r1=1, r2=1] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L116] r1 << 8U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L116] r2 << 16U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] [L116] r3 << 24U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086272, r1=1, r2=1, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5021 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5021 mSDsluCounter, 7698 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5806 mSDsCounter, 591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6099 IncrementalHoareTripleChecker+Invalid, 6690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 591 mSolverCounterUnsat, 1892 mSDtfsCounter, 6099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 806 SyntacticMatches, 12 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1291occurred in iteration=17, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 10771 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1852 ConstructedInterpolants, 0 QuantifiedInterpolants, 8939 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1001 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 1392/1591 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:44:51,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbf7a0c4-bb0f-4400-8f66-62306077b484/bin/uautomizer-Dbtcem3rbc/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample