./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN --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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:21:14,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:21:14,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:21:14,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:21:14,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:21:14,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:21:14,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:21:14,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:21:14,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:21:14,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:21:14,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:21:14,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:21:14,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:21:14,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:21:14,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:21:14,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:21:14,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:21:14,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:21:14,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:21:14,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:21:14,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:21:14,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:21:14,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:21:14,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:21:14,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:21:14,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:21:14,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:21:14,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:21:14,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:21:14,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:21:14,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:21:14,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:21:14,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:21:14,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:21:14,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:21:14,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:21:14,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:21:14,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:21:14,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:21:14,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:21:14,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:21:14,151 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 12:21:14,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:21:14,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:21:14,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:21:14,207 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:21:14,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:21:14,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:21:14,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:21:14,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:21:14,209 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:21:14,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:21:14,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:21:14,212 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:21:14,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:21:14,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:21:14,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:21:14,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:21:14,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:21:14,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:21:14,213 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:21:14,214 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:21:14,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:21:14,214 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:21:14,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:21:14,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:21:14,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:21:14,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:21:14,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:21:14,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:21:14,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:21:14,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:21:14,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:21:14,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:21:14,218 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:21:14,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:21:14,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:21:14,219 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_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2022-11-20 12:21:14,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:21:14,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:21:14,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:21:14,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:21:14,681 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:21:14,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/bitvector/byte_add-2.i [2022-11-20 12:21:18,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:21:18,614 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:21:18,614 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/sv-benchmarks/c/bitvector/byte_add-2.i [2022-11-20 12:21:18,623 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/data/fdc361327/49ced9b7d2a7454fb7222ec1f78b96fb/FLAGaf886344c [2022-11-20 12:21:18,648 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/data/fdc361327/49ced9b7d2a7454fb7222ec1f78b96fb [2022-11-20 12:21:18,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:21:18,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:21:18,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:21:18,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:21:18,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:21:18,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:18" (1/1) ... [2022-11-20 12:21:18,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bae1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:18, skipping insertion in model container [2022-11-20 12:21:18,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:18" (1/1) ... [2022-11-20 12:21:18,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:21:18,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:21:18,935 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-11-20 12:21:18,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:21:19,014 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:21:19,027 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2022-11-20 12:21:19,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:21:19,076 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:21:19,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19 WrapperNode [2022-11-20 12:21:19,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:21:19,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:21:19,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:21:19,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:21:19,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,147 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 180 [2022-11-20 12:21:19,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:21:19,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:21:19,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:21:19,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:21:19,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,208 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:21:19,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:21:19,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:21:19,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:21:19,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (1/1) ... [2022-11-20 12:21:19,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:21:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:19,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:21:19,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:21:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:21:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:21:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:21:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:21:19,463 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:21:19,467 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:21:20,205 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:21:20,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:21:20,215 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:21:20,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:20 BoogieIcfgContainer [2022-11-20 12:21:20,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:21:20,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:21:20,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:21:20,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:21:20,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:21:18" (1/3) ... [2022-11-20 12:21:20,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f5bd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:20, skipping insertion in model container [2022-11-20 12:21:20,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:19" (2/3) ... [2022-11-20 12:21:20,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f5bd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:20, skipping insertion in model container [2022-11-20 12:21:20,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:20" (3/3) ... [2022-11-20 12:21:20,231 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2022-11-20 12:21:20,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:21:20,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-20 12:21:20,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:21:20,331 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=PETRI_NET, 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;@dbfc9d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:21:20,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-20 12:21:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 81 states have (on average 1.8888888888888888) internal successors, (153), 119 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 12:21:20,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:20,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 12:21:20,354 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-20 12:21:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-20 12:21:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:20,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949037045] [2022-11-20 12:21:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:20,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949037045] [2022-11-20 12:21:20,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949037045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:20,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:20,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:21:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449934325] [2022-11-20 12:21:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:20,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:21:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:21:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:21:20,670 INFO L87 Difference]: Start difference. First operand has 120 states, 81 states have (on average 1.8888888888888888) internal successors, (153), 119 states have internal predecessors, (153), 0 states have call successors, (0), 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-20 12:21:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:20,718 INFO L93 Difference]: Finished difference Result 144 states and 192 transitions. [2022-11-20 12:21:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:21:20,721 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-20 12:21:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:20,734 INFO L225 Difference]: With dead ends: 144 [2022-11-20 12:21:20,734 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 12:21:20,737 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-20 12:21:20,742 INFO L413 NwaCegarLoop]: 113 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, 113 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-20 12:21:20,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:21:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 12:21:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 12:21:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2022-11-20 12:21:20,788 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 4 [2022-11-20 12:21:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:20,789 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2022-11-20 12:21:20,789 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-20 12:21:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2022-11-20 12:21:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:21:20,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:20,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:20,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:21:20,792 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-20 12:21:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1995494874, now seen corresponding path program 1 times [2022-11-20 12:21:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:20,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778729595] [2022-11-20 12:21:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:21,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778729595] [2022-11-20 12:21:21,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778729595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:21,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:21,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:21:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717901393] [2022-11-20 12:21:21,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:21,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:21:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:21:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:21:21,072 INFO L87 Difference]: Start difference. First operand 72 states and 100 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-20 12:21:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:21,242 INFO L93 Difference]: Finished difference Result 154 states and 227 transitions. [2022-11-20 12:21:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:21:21,243 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-20 12:21:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:21,245 INFO L225 Difference]: With dead ends: 154 [2022-11-20 12:21:21,245 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 12:21:21,246 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-20 12:21:21,248 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 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-20 12:21:21,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:21:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 12:21:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-11-20 12:21:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2022-11-20 12:21:21,262 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 13 [2022-11-20 12:21:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:21,263 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2022-11-20 12:21:21,263 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-20 12:21:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2022-11-20 12:21:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:21:21,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:21,265 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-20 12:21:21,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:21:21,266 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-20 12:21:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2081168916, now seen corresponding path program 1 times [2022-11-20 12:21:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:21,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997522524] [2022-11-20 12:21:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:21,573 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-20 12:21:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:21,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997522524] [2022-11-20 12:21:21,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997522524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:21,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:21,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:21:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218312410] [2022-11-20 12:21:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:21,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:21,577 INFO L87 Difference]: Start difference. First operand 100 states and 134 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-20 12:21:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:21,871 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2022-11-20 12:21:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:21,872 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-20 12:21:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:21,874 INFO L225 Difference]: With dead ends: 239 [2022-11-20 12:21:21,874 INFO L226 Difference]: Without dead ends: 176 [2022-11-20 12:21:21,875 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-20 12:21:21,877 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 132 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:21,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 306 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:21:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-20 12:21:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 110. [2022-11-20 12:21:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2022-11-20 12:21:21,897 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 145 transitions. Word has length 20 [2022-11-20 12:21:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:21,897 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 145 transitions. [2022-11-20 12:21:21,897 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-20 12:21:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 145 transitions. [2022-11-20 12:21:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:21:21,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:21,898 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-20 12:21:21,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:21:21,903 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-20 12:21:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash 460336243, now seen corresponding path program 1 times [2022-11-20 12:21:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:21,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678410167] [2022-11-20 12:21:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:22,191 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-20 12:21:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:22,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678410167] [2022-11-20 12:21:22,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678410167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:22,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:22,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:21:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526561883] [2022-11-20 12:21:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:22,197 INFO L87 Difference]: Start difference. First operand 110 states and 145 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-20 12:21:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:22,550 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2022-11-20 12:21:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-20 12:21:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:22,553 INFO L225 Difference]: With dead ends: 277 [2022-11-20 12:21:22,554 INFO L226 Difference]: Without dead ends: 206 [2022-11-20 12:21:22,555 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-20 12:21:22,556 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:22,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 316 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:21:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-20 12:21:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2022-11-20 12:21:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2022-11-20 12:21:22,586 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 23 [2022-11-20 12:21:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:22,587 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2022-11-20 12:21:22,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-20 12:21:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2022-11-20 12:21:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:21:22,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:22,593 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] [2022-11-20 12:21:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:21:22,594 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-20 12:21:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -597656241, now seen corresponding path program 1 times [2022-11-20 12:21:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139073659] [2022-11-20 12:21:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139073659] [2022-11-20 12:21:22,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139073659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005077534] [2022-11-20 12:21:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:22,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:22,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:22,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:21:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:22,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:21:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:22,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:22,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005077534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:22,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:22,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-20 12:21:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26206024] [2022-11-20 12:21:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:23,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:23,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:23,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:23,002 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:23,280 INFO L93 Difference]: Finished difference Result 231 states and 332 transitions. [2022-11-20 12:21:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:23,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-20 12:21:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:23,283 INFO L225 Difference]: With dead ends: 231 [2022-11-20 12:21:23,283 INFO L226 Difference]: Without dead ends: 181 [2022-11-20 12:21:23,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:23,285 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:23,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 184 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:21:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-20 12:21:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2022-11-20 12:21:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.2941176470588236) internal successors, (198), 153 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2022-11-20 12:21:23,316 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 26 [2022-11-20 12:21:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:23,322 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2022-11-20 12:21:23,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2022-11-20 12:21:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 12:21:23,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:23,325 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:21:23,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:23,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:23,532 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-20 12:21:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2049867769, now seen corresponding path program 1 times [2022-11-20 12:21:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:23,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107187299] [2022-11-20 12:21:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:23,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:23,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107187299] [2022-11-20 12:21:23,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107187299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:23,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967848465] [2022-11-20 12:21:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:23,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:23,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:23,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:21:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:23,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:21:23,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:21:23,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:23,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967848465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:23,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:23,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 12:21:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357994454] [2022-11-20 12:21:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:23,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:23,974 INFO L87 Difference]: Start difference. First operand 154 states and 198 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-20 12:21:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:24,300 INFO L93 Difference]: Finished difference Result 317 states and 436 transitions. [2022-11-20 12:21:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:24,301 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 33 [2022-11-20 12:21:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:24,302 INFO L225 Difference]: With dead ends: 317 [2022-11-20 12:21:24,302 INFO L226 Difference]: Without dead ends: 216 [2022-11-20 12:21:24,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:24,304 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:24,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 240 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:21:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-20 12:21:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2022-11-20 12:21:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.281767955801105) internal successors, (232), 181 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2022-11-20 12:21:24,326 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 33 [2022-11-20 12:21:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:24,326 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2022-11-20 12:21:24,327 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-20 12:21:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2022-11-20 12:21:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:21:24,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:24,329 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:21:24,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:24,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:24,535 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-20 12:21:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 950600083, now seen corresponding path program 1 times [2022-11-20 12:21:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:24,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622662301] [2022-11-20 12:21:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622662301] [2022-11-20 12:21:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622662301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373092639] [2022-11-20 12:21:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:24,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:24,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:24,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:21:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:24,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:21:24,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:21:27,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:27,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373092639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:27,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:27,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-20 12:21:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607561945] [2022-11-20 12:21:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:27,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2022-11-20 12:21:27,072 INFO L87 Difference]: Start difference. First operand 182 states and 232 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-20 12:21:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:27,248 INFO L93 Difference]: Finished difference Result 357 states and 468 transitions. [2022-11-20 12:21:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:27,249 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 40 [2022-11-20 12:21:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:27,251 INFO L225 Difference]: With dead ends: 357 [2022-11-20 12:21:27,251 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 12:21:27,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2022-11-20 12:21:27,253 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 30 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:27,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 228 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-11-20 12:21:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 12:21:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 184. [2022-11-20 12:21:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.289617486338798) internal successors, (236), 183 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2022-11-20 12:21:27,269 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 40 [2022-11-20 12:21:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:27,270 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2022-11-20 12:21:27,270 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-20 12:21:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2022-11-20 12:21:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 12:21:27,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:27,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-20 12:21:27,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 12:21:27,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:21:27,488 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-20 12:21:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -54726973, now seen corresponding path program 1 times [2022-11-20 12:21:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:27,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579656639] [2022-11-20 12:21:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 12:21:27,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:27,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579656639] [2022-11-20 12:21:27,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579656639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:27,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:27,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:21:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068841057] [2022-11-20 12:21:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:27,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:21:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:21:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:21:27,623 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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-20 12:21:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:27,640 INFO L93 Difference]: Finished difference Result 220 states and 278 transitions. [2022-11-20 12:21:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:21:27,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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 47 [2022-11-20 12:21:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:27,643 INFO L225 Difference]: With dead ends: 220 [2022-11-20 12:21:27,643 INFO L226 Difference]: Without dead ends: 184 [2022-11-20 12:21:27,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:21:27,648 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:27,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:21:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-20 12:21:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-11-20 12:21:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.284153005464481) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2022-11-20 12:21:27,660 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 47 [2022-11-20 12:21:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:27,661 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2022-11-20 12:21:27,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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-20 12:21:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2022-11-20 12:21:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 12:21:27,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:27,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-11-20 12:21:27,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:21:27,667 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-20 12:21:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 625331397, now seen corresponding path program 2 times [2022-11-20 12:21:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:27,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764632447] [2022-11-20 12:21:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:21:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:27,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764632447] [2022-11-20 12:21:27,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764632447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:27,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:27,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:21:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462481556] [2022-11-20 12:21:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:27,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:21:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:21:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:27,946 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:28,293 INFO L93 Difference]: Finished difference Result 350 states and 460 transitions. [2022-11-20 12:21:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:21:28,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-20 12:21:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:28,295 INFO L225 Difference]: With dead ends: 350 [2022-11-20 12:21:28,295 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 12:21:28,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:28,296 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:28,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 219 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:21:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 12:21:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 166. [2022-11-20 12:21:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.284848484848485) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-11-20 12:21:28,305 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 47 [2022-11-20 12:21:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:28,306 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-11-20 12:21:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-11-20 12:21:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 12:21:28,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:28,308 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:21:28,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:21:28,308 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-20 12:21:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash -929873342, now seen corresponding path program 1 times [2022-11-20 12:21:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955634546] [2022-11-20 12:21:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 12:21:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:28,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955634546] [2022-11-20 12:21:28,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955634546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:28,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:28,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:21:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235436355] [2022-11-20 12:21:28,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:28,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:21:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:21:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:21:28,510 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:28,737 INFO L93 Difference]: Finished difference Result 454 states and 589 transitions. [2022-11-20 12:21:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:21:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-20 12:21:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:28,740 INFO L225 Difference]: With dead ends: 454 [2022-11-20 12:21:28,740 INFO L226 Difference]: Without dead ends: 339 [2022-11-20 12:21:28,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:21:28,742 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 217 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:28,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:21:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-20 12:21:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 201. [2022-11-20 12:21:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2022-11-20 12:21:28,754 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 49 [2022-11-20 12:21:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:28,754 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2022-11-20 12:21:28,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2022-11-20 12:21:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 12:21:28,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:28,756 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:21:28,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:21:28,756 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-20 12:21:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1545895919, now seen corresponding path program 1 times [2022-11-20 12:21:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:28,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466502796] [2022-11-20 12:21:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:21:28,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466502796] [2022-11-20 12:21:28,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466502796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:28,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:28,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:21:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482330017] [2022-11-20 12:21:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:28,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:28,854 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:28,968 INFO L93 Difference]: Finished difference Result 422 states and 537 transitions. [2022-11-20 12:21:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 56 [2022-11-20 12:21:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:28,971 INFO L225 Difference]: With dead ends: 422 [2022-11-20 12:21:28,971 INFO L226 Difference]: Without dead ends: 272 [2022-11-20 12:21:28,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:28,973 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 48 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:28,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 318 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:21:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-20 12:21:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-11-20 12:21:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3037383177570094) internal successors, (279), 214 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2022-11-20 12:21:28,984 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 56 [2022-11-20 12:21:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:28,984 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2022-11-20 12:21:28,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2022-11-20 12:21:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 12:21:28,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:28,986 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-20 12:21:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:21:28,986 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-20 12:21:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1680236206, now seen corresponding path program 1 times [2022-11-20 12:21:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452379738] [2022-11-20 12:21:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:21:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452379738] [2022-11-20 12:21:29,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452379738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:29,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:29,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:21:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872139799] [2022-11-20 12:21:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:29,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:21:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:21:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:21:29,101 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-20 12:21:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:29,148 INFO L93 Difference]: Finished difference Result 379 states and 496 transitions. [2022-11-20 12:21:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:21:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 60 [2022-11-20 12:21:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:29,150 INFO L225 Difference]: With dead ends: 379 [2022-11-20 12:21:29,150 INFO L226 Difference]: Without dead ends: 215 [2022-11-20 12:21:29,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:21:29,151 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:29,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 153 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:21:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-20 12:21:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-11-20 12:21:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.280373831775701) internal successors, (274), 214 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2022-11-20 12:21:29,161 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 60 [2022-11-20 12:21:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:29,162 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2022-11-20 12:21:29,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-20 12:21:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2022-11-20 12:21:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 12:21:29,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:29,164 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-11-20 12:21:29,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:21:29,164 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-20 12:21:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 39247320, now seen corresponding path program 1 times [2022-11-20 12:21:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:29,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684161313] [2022-11-20 12:21:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:29,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684161313] [2022-11-20 12:21:29,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684161313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:29,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930700133] [2022-11-20 12:21:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:29,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:29,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:29,536 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:29,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:21:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:21:29,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:21:29,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:21:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:21:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930700133] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:21:30,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:21:30,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 12 [2022-11-20 12:21:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792029427] [2022-11-20 12:21:30,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:21:30,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:21:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:21:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:21:30,341 INFO L87 Difference]: Start difference. First operand 215 states and 274 transitions. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:31,423 INFO L93 Difference]: Finished difference Result 967 states and 1255 transitions. [2022-11-20 12:21:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:21:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 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 61 [2022-11-20 12:21:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:31,427 INFO L225 Difference]: With dead ends: 967 [2022-11-20 12:21:31,427 INFO L226 Difference]: Without dead ends: 782 [2022-11-20 12:21:31,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:21:31,429 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 644 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:31,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 470 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:21:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-11-20 12:21:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 654. [2022-11-20 12:21:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.2955589586523737) internal successors, (846), 653 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 846 transitions. [2022-11-20 12:21:31,460 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 846 transitions. Word has length 61 [2022-11-20 12:21:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:31,462 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 846 transitions. [2022-11-20 12:21:31,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 846 transitions. [2022-11-20 12:21:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 12:21:31,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:31,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 12:21:31,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 12:21:31,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 12:21:31,672 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-20 12:21:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1701075621, now seen corresponding path program 1 times [2022-11-20 12:21:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:31,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119283676] [2022-11-20 12:21:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:32,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119283676] [2022-11-20 12:21:32,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119283676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:32,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129009978] [2022-11-20 12:21:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:32,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:32,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:32,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:32,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:21:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:32,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:21:32,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 12:21:32,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:32,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129009978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:32,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-11-20 12:21:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733880509] [2022-11-20 12:21:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:32,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:21:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:21:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:21:32,322 INFO L87 Difference]: Start difference. First operand 654 states and 846 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:32,685 INFO L93 Difference]: Finished difference Result 2758 states and 3624 transitions. [2022-11-20 12:21:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:21:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 64 [2022-11-20 12:21:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:32,694 INFO L225 Difference]: With dead ends: 2758 [2022-11-20 12:21:32,694 INFO L226 Difference]: Without dead ends: 2073 [2022-11-20 12:21:32,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:21:32,697 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 205 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:32,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 552 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:21:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2022-11-20 12:21:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1262. [2022-11-20 12:21:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.295003965107058) internal successors, (1633), 1261 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1633 transitions. [2022-11-20 12:21:32,789 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1633 transitions. Word has length 64 [2022-11-20 12:21:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:32,789 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1633 transitions. [2022-11-20 12:21:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1633 transitions. [2022-11-20 12:21:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 12:21:32,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:32,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-11-20 12:21:32,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:32,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:21:32,999 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-20 12:21:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2128602386, now seen corresponding path program 1 times [2022-11-20 12:21:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:33,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83414443] [2022-11-20 12:21:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83414443] [2022-11-20 12:21:33,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83414443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258855218] [2022-11-20 12:21:33,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:33,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:33,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:33,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:33,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:21:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:33,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:21:33,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:33,526 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-20 12:21:33,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:33,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258855218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:33,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:33,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-11-20 12:21:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911652045] [2022-11-20 12:21:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:21:33,529 INFO L87 Difference]: Start difference. First operand 1262 states and 1633 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:33,804 INFO L93 Difference]: Finished difference Result 2903 states and 3795 transitions. [2022-11-20 12:21:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 67 [2022-11-20 12:21:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:33,812 INFO L225 Difference]: With dead ends: 2903 [2022-11-20 12:21:33,812 INFO L226 Difference]: Without dead ends: 1686 [2022-11-20 12:21:33,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:21:33,815 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 40 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:33,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 215 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:21:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2022-11-20 12:21:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1370. [2022-11-20 12:21:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.2863403944485026) internal successors, (1761), 1369 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1761 transitions. [2022-11-20 12:21:33,925 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1761 transitions. Word has length 67 [2022-11-20 12:21:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:33,925 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1761 transitions. [2022-11-20 12:21:33,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1761 transitions. [2022-11-20 12:21:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 12:21:33,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:33,929 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-11-20 12:21:33,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:21:34,137 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-20 12:21:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -492929246, now seen corresponding path program 1 times [2022-11-20 12:21:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974281893] [2022-11-20 12:21:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:21:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:34,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974281893] [2022-11-20 12:21:34,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974281893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259441487] [2022-11-20 12:21:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:34,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:34,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:21:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:34,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:21:34,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:21:34,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:21:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:21:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259441487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:21:34,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:21:34,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2022-11-20 12:21:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211851114] [2022-11-20 12:21:34,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:21:34,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:21:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:21:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:21:34,744 INFO L87 Difference]: Start difference. First operand 1370 states and 1761 transitions. Second operand has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 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-20 12:21:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:37,589 INFO L93 Difference]: Finished difference Result 8383 states and 10111 transitions. [2022-11-20 12:21:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 12:21:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 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) Word has length 80 [2022-11-20 12:21:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:37,612 INFO L225 Difference]: With dead ends: 8383 [2022-11-20 12:21:37,612 INFO L226 Difference]: Without dead ends: 7045 [2022-11-20 12:21:37,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 12:21:37,618 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 510 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:37,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1034 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-20 12:21:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states. [2022-11-20 12:21:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 1821. [2022-11-20 12:21:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 1.3373626373626373) internal successors, (2434), 1820 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2434 transitions. [2022-11-20 12:21:37,798 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2434 transitions. Word has length 80 [2022-11-20 12:21:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:37,798 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 2434 transitions. [2022-11-20 12:21:37,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 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-20 12:21:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2434 transitions. [2022-11-20 12:21:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 12:21:37,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:37,802 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-20 12:21:37,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:38,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:38,009 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-20 12:21:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2082738387, now seen corresponding path program 1 times [2022-11-20 12:21:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:38,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232050630] [2022-11-20 12:21:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:38,332 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-20 12:21:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232050630] [2022-11-20 12:21:38,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232050630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:38,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:38,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:21:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157265300] [2022-11-20 12:21:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:38,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:21:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:38,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:21:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:38,335 INFO L87 Difference]: Start difference. First operand 1821 states and 2434 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-20 12:21:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:39,079 INFO L93 Difference]: Finished difference Result 4739 states and 6283 transitions. [2022-11-20 12:21:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:21:39,080 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-20 12:21:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:39,098 INFO L225 Difference]: With dead ends: 4739 [2022-11-20 12:21:39,098 INFO L226 Difference]: Without dead ends: 3884 [2022-11-20 12:21:39,101 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-20 12:21:39,101 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 386 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:39,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 745 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:21:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-11-20 12:21:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 1840. [2022-11-20 12:21:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3355084284937466) internal successors, (2456), 1839 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2456 transitions. [2022-11-20 12:21:39,259 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2456 transitions. Word has length 83 [2022-11-20 12:21:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:39,259 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2456 transitions. [2022-11-20 12:21:39,260 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-20 12:21:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2456 transitions. [2022-11-20 12:21:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 12:21:39,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:39,263 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-11-20 12:21:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:21:39,263 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-20 12:21:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2096876809, now seen corresponding path program 1 times [2022-11-20 12:21:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3849186] [2022-11-20 12:21:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:21:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:39,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3849186] [2022-11-20 12:21:39,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3849186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:39,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213816665] [2022-11-20 12:21:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:39,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:39,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:21:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:39,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:21:39,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:21:39,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:21:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:21:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213816665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:21:39,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:21:39,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2022-11-20 12:21:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702135530] [2022-11-20 12:21:39,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:21:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:21:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:21:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:21:39,900 INFO L87 Difference]: Start difference. First operand 1840 states and 2456 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:40,934 INFO L93 Difference]: Finished difference Result 5320 states and 7278 transitions. [2022-11-20 12:21:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:21:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-20 12:21:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:40,949 INFO L225 Difference]: With dead ends: 5320 [2022-11-20 12:21:40,950 INFO L226 Difference]: Without dead ends: 3973 [2022-11-20 12:21:40,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:21:40,953 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 492 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:40,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 313 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:21:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2022-11-20 12:21:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3112. [2022-11-20 12:21:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 3111 states have (on average 1.3288331726133076) internal successors, (4134), 3111 states have internal predecessors, (4134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4134 transitions. [2022-11-20 12:21:41,166 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4134 transitions. Word has length 83 [2022-11-20 12:21:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4134 transitions. [2022-11-20 12:21:41,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4134 transitions. [2022-11-20 12:21:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 12:21:41,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:41,170 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-20 12:21:41,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:41,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:21:41,386 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-20 12:21:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -112361859, now seen corresponding path program 1 times [2022-11-20 12:21:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350877356] [2022-11-20 12:21:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 12:21:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:41,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350877356] [2022-11-20 12:21:41,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350877356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:41,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:41,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:21:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204677513] [2022-11-20 12:21:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:41,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:21:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:21:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:41,638 INFO L87 Difference]: Start difference. First operand 3112 states and 4134 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:42,549 INFO L93 Difference]: Finished difference Result 7187 states and 9489 transitions. [2022-11-20 12:21:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:21:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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-20 12:21:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:42,599 INFO L225 Difference]: With dead ends: 7187 [2022-11-20 12:21:42,608 INFO L226 Difference]: Without dead ends: 6848 [2022-11-20 12:21:42,611 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-20 12:21:42,612 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 328 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:42,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 612 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:21:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2022-11-20 12:21:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 3134. [2022-11-20 12:21:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 3133 states have (on average 1.3268432812001276) internal successors, (4157), 3133 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 4157 transitions. [2022-11-20 12:21:42,924 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 4157 transitions. Word has length 83 [2022-11-20 12:21:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:42,925 INFO L495 AbstractCegarLoop]: Abstraction has 3134 states and 4157 transitions. [2022-11-20 12:21:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 4157 transitions. [2022-11-20 12:21:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 12:21:42,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:42,930 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-20 12:21:42,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:21:42,932 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-20 12:21:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2030636919, now seen corresponding path program 1 times [2022-11-20 12:21:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:42,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062959120] [2022-11-20 12:21:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:43,250 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-20 12:21:43,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:43,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062959120] [2022-11-20 12:21:43,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062959120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:43,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:43,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:21:43,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310264895] [2022-11-20 12:21:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:43,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:21:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:43,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:21:43,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:21:43,252 INFO L87 Difference]: Start difference. First operand 3134 states and 4157 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-20 12:21:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:44,409 INFO L93 Difference]: Finished difference Result 8019 states and 10586 transitions. [2022-11-20 12:21:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:21:44,410 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-20 12:21:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:44,426 INFO L225 Difference]: With dead ends: 8019 [2022-11-20 12:21:44,426 INFO L226 Difference]: Without dead ends: 6555 [2022-11-20 12:21:44,430 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-20 12:21:44,431 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 513 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:44,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1096 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:21:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2022-11-20 12:21:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 3112. [2022-11-20 12:21:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 3111 states have (on average 1.3269045323047253) internal successors, (4128), 3111 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4128 transitions. [2022-11-20 12:21:44,765 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4128 transitions. Word has length 85 [2022-11-20 12:21:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:44,765 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4128 transitions. [2022-11-20 12:21:44,765 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-20 12:21:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4128 transitions. [2022-11-20 12:21:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 12:21:44,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:44,771 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-20 12:21:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:21:44,772 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-20 12:21:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -853788807, now seen corresponding path program 1 times [2022-11-20 12:21:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:44,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407712706] [2022-11-20 12:21:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 12:21:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407712706] [2022-11-20 12:21:45,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407712706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:45,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:21:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912118241] [2022-11-20 12:21:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:45,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:21:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:21:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:21:45,116 INFO L87 Difference]: Start difference. First operand 3112 states and 4128 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:46,279 INFO L93 Difference]: Finished difference Result 7213 states and 9512 transitions. [2022-11-20 12:21:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:21:46,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 85 [2022-11-20 12:21:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:46,295 INFO L225 Difference]: With dead ends: 7213 [2022-11-20 12:21:46,295 INFO L226 Difference]: Without dead ends: 6874 [2022-11-20 12:21:46,297 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-20 12:21:46,298 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 427 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:46,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 925 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:21:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6874 states. [2022-11-20 12:21:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6874 to 3104. [2022-11-20 12:21:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 3103 states have (on average 1.3277473412826297) internal successors, (4120), 3103 states have internal predecessors, (4120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4120 transitions. [2022-11-20 12:21:46,567 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4120 transitions. Word has length 85 [2022-11-20 12:21:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:46,567 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4120 transitions. [2022-11-20 12:21:46,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4120 transitions. [2022-11-20 12:21:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 12:21:46,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:46,571 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:21:46,571 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-20 12:21:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash -653467681, now seen corresponding path program 1 times [2022-11-20 12:21:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046813146] [2022-11-20 12:21:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:46,885 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-20 12:21:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:46,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046813146] [2022-11-20 12:21:46,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046813146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714368188] [2022-11-20 12:21:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:46,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:46,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:21:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:47,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:21:47,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:48,378 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-20 12:21:48,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:21:48,708 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-20 12:21:48,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714368188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:21:48,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:21:48,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-11-20 12:21:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138369176] [2022-11-20 12:21:48,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:21:48,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 12:21:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 12:21:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:21:48,711 INFO L87 Difference]: Start difference. First operand 3104 states and 4120 transitions. Second operand has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 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-20 12:21:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:50,379 INFO L93 Difference]: Finished difference Result 7719 states and 10092 transitions. [2022-11-20 12:21:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:21:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 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) Word has length 89 [2022-11-20 12:21:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:50,394 INFO L225 Difference]: With dead ends: 7719 [2022-11-20 12:21:50,394 INFO L226 Difference]: Without dead ends: 6236 [2022-11-20 12:21:50,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:21:50,400 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 511 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:50,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1281 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 554 Invalid, 0 Unknown, 115 Unchecked, 0.9s Time] [2022-11-20 12:21:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2022-11-20 12:21:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 3212. [2022-11-20 12:21:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3211 states have (on average 1.319526627218935) internal successors, (4237), 3211 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4237 transitions. [2022-11-20 12:21:50,809 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4237 transitions. Word has length 89 [2022-11-20 12:21:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:50,810 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 4237 transitions. [2022-11-20 12:21:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 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-20 12:21:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4237 transitions. [2022-11-20 12:21:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 12:21:50,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:50,814 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:50,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:21:51,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:51,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-20 12:21:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1173715893, now seen corresponding path program 1 times [2022-11-20 12:21:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:51,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715099568] [2022-11-20 12:21:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 12:21:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715099568] [2022-11-20 12:21:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715099568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:21:51,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684894090] [2022-11-20 12:21:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:51,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:51,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:21:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:51,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 12:21:51,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:21:51,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:21:51,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684894090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:51,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:21:51,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-20 12:21:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219518405] [2022-11-20 12:21:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:21:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:21:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:21:51,998 INFO L87 Difference]: Start difference. First operand 3212 states and 4237 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:52,714 INFO L93 Difference]: Finished difference Result 7740 states and 10223 transitions. [2022-11-20 12:21:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:21:52,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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-20 12:21:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:52,729 INFO L225 Difference]: With dead ends: 7740 [2022-11-20 12:21:52,729 INFO L226 Difference]: Without dead ends: 6687 [2022-11-20 12:21:52,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:21:52,733 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 182 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:52,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 656 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:21:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2022-11-20 12:21:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 4542. [2022-11-20 12:21:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4542 states, 4541 states have (on average 1.3223959480290686) internal successors, (6005), 4541 states have internal predecessors, (6005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 6005 transitions. [2022-11-20 12:21:53,238 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 6005 transitions. Word has length 89 [2022-11-20 12:21:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:53,238 INFO L495 AbstractCegarLoop]: Abstraction has 4542 states and 6005 transitions. [2022-11-20 12:21:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 6005 transitions. [2022-11-20 12:21:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 12:21:53,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:53,244 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:53,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-20 12:21:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:53,450 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-20 12:21:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -991925189, now seen corresponding path program 1 times [2022-11-20 12:21:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:53,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537140038] [2022-11-20 12:21:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:21:53,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:21:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:21:53,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:21:53,576 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:21:53,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-11-20 12:21:53,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-11-20 12:21:53,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-11-20 12:21:53,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-11-20 12:21:53,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-11-20 12:21:53,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-11-20 12:21:53,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-11-20 12:21:53,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-11-20 12:21:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-11-20 12:21:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-11-20 12:21:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-11-20 12:21:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-11-20 12:21:53,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-11-20 12:21:53,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-11-20 12:21:53,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-11-20 12:21:53,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-11-20 12:21:53,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-11-20 12:21:53,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-11-20 12:21:53,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-11-20 12:21:53,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-11-20 12:21:53,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-11-20 12:21:53,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-11-20 12:21:53,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-11-20 12:21:53,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-11-20 12:21:53,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-11-20 12:21:53,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-11-20 12:21:53,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-11-20 12:21:53,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-11-20 12:21:53,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-11-20 12:21:53,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-11-20 12:21:53,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-11-20 12:21:53,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-11-20 12:21:53,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-11-20 12:21:53,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-11-20 12:21:53,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-11-20 12:21:53,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-11-20 12:21:53,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-11-20 12:21:53,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-11-20 12:21:53,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:21:53,596 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:53,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:21:53,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:21:53 BoogieIcfgContainer [2022-11-20 12:21:53,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:21:53,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:21:53,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:21:53,750 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:21:53,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:20" (3/4) ... [2022-11-20 12:21:53,753 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:21:53,892 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:21:53,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:21:53,893 INFO L158 Benchmark]: Toolchain (without parser) took 35240.26ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 138.0MB in the beginning and 307.0MB in the end (delta: -169.0MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,894 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 94.4MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:21:53,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.90ms. Allocated memory is still 167.8MB. Free memory was 138.0MB in the beginning and 129.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.52ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 127.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,894 INFO L158 Benchmark]: Boogie Preprocessor took 67.04ms. Allocated memory is still 167.8MB. Free memory was 126.2MB in the beginning and 124.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:21:53,895 INFO L158 Benchmark]: RCFGBuilder took 1002.38ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 102.3MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,899 INFO L158 Benchmark]: TraceAbstraction took 33527.67ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 101.8MB in the beginning and 314.3MB in the end (delta: -212.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,899 INFO L158 Benchmark]: Witness Printer took 143.19ms. Allocated memory is still 423.6MB. Free memory was 314.3MB in the beginning and 307.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:21:53,908 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.34ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 94.4MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.90ms. Allocated memory is still 167.8MB. Free memory was 138.0MB in the beginning and 129.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.52ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 127.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.04ms. Allocated memory is still 167.8MB. Free memory was 126.2MB in the beginning and 124.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1002.38ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 102.3MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 33527.67ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 101.8MB in the beginning and 314.3MB in the end (delta: -212.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 143.19ms. Allocated memory is still 423.6MB. Free memory was 314.3MB in the beginning and 307.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [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)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, 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)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r1 << 8U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r2 << 16U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - 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, 120 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5095 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5095 mSDsluCounter, 10461 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 191 IncrementalHoareTripleChecker+Unchecked, 7457 mSDsCounter, 362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5583 IncrementalHoareTripleChecker+Invalid, 6136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 362 mSolverCounterUnsat, 3004 mSDtfsCounter, 5583 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 993 SyntacticMatches, 20 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4542occurred in iteration=23, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 25954 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 2010 NumberOfCodeBlocks, 2010 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2195 ConstructedInterpolants, 29 QuantifiedInterpolants, 10959 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1474 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 1531/1806 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 proved your program to be incorrect! [2022-11-20 12:21:53,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b57a1a70-a094-49c1-9d88-af02bb951465/bin/uautomizer-ug76WZFUDN/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)