./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- 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 10:40:15,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:40:15,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:40:15,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:40:15,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:40:15,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:40:15,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:40:15,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:40:15,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:40:15,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:40:15,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:40:15,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:40:15,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:40:15,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:40:15,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:40:15,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:40:15,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:40:15,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:40:15,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:40:15,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:40:15,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:40:15,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:40:15,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:40:15,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:40:15,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:40:15,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:40:15,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:40:15,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:40:15,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:40:15,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:40:15,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:40:15,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:40:15,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:40:15,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:40:15,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:40:15,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:40:15,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:40:15,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:40:15,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:40:15,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:40:15,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:40:15,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:40:15,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:40:15,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:40:15,234 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:40:15,234 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:40:15,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:40:15,235 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:40:15,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:40:15,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:40:15,236 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:40:15,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:40:15,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:40:15,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:40:15,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:40:15,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:40:15,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:40:15,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:40:15,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:40:15,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:40:15,239 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:40:15,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:40:15,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:40:15,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:40:15,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:40:15,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:40:15,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:40:15,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:40:15,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:40:15,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:40:15,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:40:15,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:40:15,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:40:15,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:40:15,242 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:40:15,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:40:15,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:40:15,242 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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2022-11-20 10:40:15,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:40:15,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:40:15,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:40:15,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:40:15,552 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:40:15,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-11-20 10:40:18,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:40:19,020 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:40:19,021 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-11-20 10:40:19,028 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/data/9e5c1ded4/ecc2ca790d1c4be38a8cd2c170cef82a/FLAG4d8835b3e [2022-11-20 10:40:19,075 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/data/9e5c1ded4/ecc2ca790d1c4be38a8cd2c170cef82a [2022-11-20 10:40:19,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:40:19,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:40:19,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:40:19,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:40:19,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:40:19,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c84474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19, skipping insertion in model container [2022-11-20 10:40:19,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:40:19,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:40:19,306 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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2022-11-20 10:40:19,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:40:19,397 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:40:19,423 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_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2022-11-20 10:40:19,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:40:19,475 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:40:19,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19 WrapperNode [2022-11-20 10:40:19,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:40:19,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:40:19,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:40:19,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:40:19,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,535 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 179 [2022-11-20 10:40:19,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:40:19,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:40:19,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:40:19,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:40:19,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,569 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:40:19,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:40:19,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:40:19,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:40:19,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (1/1) ... [2022-11-20 10:40:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:40:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:19,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:40:19,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:40:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:40:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:40:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:40:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:40:19,776 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:40:19,780 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:40:20,357 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:40:20,370 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:40:20,370 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:40:20,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:40:20 BoogieIcfgContainer [2022-11-20 10:40:20,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:40:20,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:40:20,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:40:20,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:40:20,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:40:19" (1/3) ... [2022-11-20 10:40:20,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40327a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:40:20, skipping insertion in model container [2022-11-20 10:40:20,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:40:19" (2/3) ... [2022-11-20 10:40:20,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40327a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:40:20, skipping insertion in model container [2022-11-20 10:40:20,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:40:20" (3/3) ... [2022-11-20 10:40:20,382 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2022-11-20 10:40:20,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:40:20,402 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-20 10:40:20,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:40:20,462 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;@30cf5225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:40:20,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-20 10:40:20,467 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 10:40:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 10:40:20,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:20,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 10:40:20,475 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 10:40:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-20 10:40:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666409290] [2022-11-20 10:40:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:20,666 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 10:40:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:20,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666409290] [2022-11-20 10:40:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666409290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:20,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:20,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:40:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972920826] [2022-11-20 10:40:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:20,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:40:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:40:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:40:20,721 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 10:40:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:20,746 INFO L93 Difference]: Finished difference Result 144 states and 192 transitions. [2022-11-20 10:40:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:40:20,748 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 10:40:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:20,760 INFO L225 Difference]: With dead ends: 144 [2022-11-20 10:40:20,766 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 10:40:20,770 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 10:40:20,777 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 10:40:20,780 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 10:40:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 10:40:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 10:40:20,826 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 10:40:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2022-11-20 10:40:20,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 4 [2022-11-20 10:40:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2022-11-20 10:40:20,837 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 10:40:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2022-11-20 10:40:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:40:20,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:20,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:20,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:40:20,842 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 10:40:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1995494874, now seen corresponding path program 1 times [2022-11-20 10:40:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810909067] [2022-11-20 10:40:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:21,100 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 10:40:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:21,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810909067] [2022-11-20 10:40:21,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810909067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:21,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:21,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:40:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37411965] [2022-11-20 10:40:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:40:21,106 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 10:40:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:21,270 INFO L93 Difference]: Finished difference Result 154 states and 227 transitions. [2022-11-20 10:40:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:21,271 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 10:40:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:21,273 INFO L225 Difference]: With dead ends: 154 [2022-11-20 10:40:21,273 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 10:40:21,274 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 10:40:21,275 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 10:40:21,276 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 10:40:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 10:40:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-11-20 10:40:21,289 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 10:40:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2022-11-20 10:40:21,290 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 13 [2022-11-20 10:40:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:21,291 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2022-11-20 10:40:21,291 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 10:40:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2022-11-20 10:40:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:40:21,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:21,293 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 10:40:21,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:40:21,293 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 10:40:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2081168916, now seen corresponding path program 1 times [2022-11-20 10:40:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:21,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731163534] [2022-11-20 10:40:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:21,633 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 10:40:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:21,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731163534] [2022-11-20 10:40:21,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731163534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:21,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:21,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:40:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364849879] [2022-11-20 10:40:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:21,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:40:21,640 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 10:40:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:21,974 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2022-11-20 10:40:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:21,974 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 10:40:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:21,976 INFO L225 Difference]: With dead ends: 239 [2022-11-20 10:40:21,976 INFO L226 Difference]: Without dead ends: 176 [2022-11-20 10:40:21,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:40:21,978 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:21,978 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.3s Time] [2022-11-20 10:40:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-20 10:40:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 110. [2022-11-20 10:40:21,987 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 10:40:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2022-11-20 10:40:21,988 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 145 transitions. Word has length 20 [2022-11-20 10:40:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:21,989 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 145 transitions. [2022-11-20 10:40:21,989 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 10:40:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 145 transitions. [2022-11-20 10:40:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:40:21,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:21,990 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 10:40:21,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:40:21,991 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 10:40:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 460336243, now seen corresponding path program 1 times [2022-11-20 10:40:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773937864] [2022-11-20 10:40:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,143 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 10:40:22,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:22,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773937864] [2022-11-20 10:40:22,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773937864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:22,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:22,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:40:22,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138980684] [2022-11-20 10:40:22,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:22,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:40:22,146 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 10:40:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:22,347 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2022-11-20 10:40:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:22,348 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 10:40:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:22,349 INFO L225 Difference]: With dead ends: 277 [2022-11-20 10:40:22,349 INFO L226 Difference]: Without dead ends: 206 [2022-11-20 10:40:22,350 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 10:40:22,351 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:22,352 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.2s Time] [2022-11-20 10:40:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-20 10:40:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2022-11-20 10:40:22,361 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 10:40:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2022-11-20 10:40:22,362 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 23 [2022-11-20 10:40:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:22,363 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2022-11-20 10:40:22,363 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 10:40:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2022-11-20 10:40:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:40:22,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:22,364 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 10:40:22,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:40:22,365 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 10:40:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -597656241, now seen corresponding path program 1 times [2022-11-20 10:40:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299312936] [2022-11-20 10:40:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,475 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 10:40:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299312936] [2022-11-20 10:40:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299312936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:40:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212938956] [2022-11-20 10:40:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:22,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:40:22,481 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 10:40:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:22,497 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2022-11-20 10:40:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 10:40:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:22,499 INFO L225 Difference]: With dead ends: 204 [2022-11-20 10:40:22,499 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 10:40:22,500 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 10:40:22,505 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:22,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 10:40:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-20 10:40:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-20 10:40:22,530 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 26 [2022-11-20 10:40:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:22,530 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-20 10:40:22,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 10:40:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-20 10:40:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 10:40:22,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:22,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:40:22,533 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 10:40:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2035545942, now seen corresponding path program 1 times [2022-11-20 10:40:22,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770153282] [2022-11-20 10:40:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,684 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 10:40:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770153282] [2022-11-20 10:40:22,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770153282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877978984] [2022-11-20 10:40:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:22,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:22,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:40:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:40:22,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:22,972 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 10:40:22,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:22,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877978984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:22,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:22,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-20 10:40:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740406176] [2022-11-20 10:40:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:22,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:22,975 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:23,188 INFO L93 Difference]: Finished difference Result 202 states and 294 transitions. [2022-11-20 10:40:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 10:40:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:23,190 INFO L225 Difference]: With dead ends: 202 [2022-11-20 10:40:23,190 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 10:40:23,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:23,191 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:23,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 152 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:40:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 10:40:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2022-11-20 10:40:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 127 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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 10:40:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 163 transitions. [2022-11-20 10:40:23,207 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 163 transitions. Word has length 32 [2022-11-20 10:40:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:23,208 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 163 transitions. [2022-11-20 10:40:23,208 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 10:40:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 163 transitions. [2022-11-20 10:40:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 10:40:23,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:23,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:23,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:23,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:40:23,418 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 10:40:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -242317236, now seen corresponding path program 1 times [2022-11-20 10:40:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:23,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080324510] [2022-11-20 10:40:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:23,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080324510] [2022-11-20 10:40:23,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080324510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:23,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941916629] [2022-11-20 10:40:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:23,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:23,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:23,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:40:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:23,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:40:23,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:40:24,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:24,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941916629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:24,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:24,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-20 10:40:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295550569] [2022-11-20 10:40:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:24,089 INFO L87 Difference]: Start difference. First operand 128 states and 163 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:24,216 INFO L93 Difference]: Finished difference Result 238 states and 317 transitions. [2022-11-20 10:40:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:40:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 10:40:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:24,218 INFO L225 Difference]: With dead ends: 238 [2022-11-20 10:40:24,218 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 10:40:24,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:24,220 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:24,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 122 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:40:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 10:40:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-11-20 10:40:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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 10:40:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2022-11-20 10:40:24,244 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 39 [2022-11-20 10:40:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:24,244 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2022-11-20 10:40:24,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2022-11-20 10:40:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:40:24,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:24,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:24,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:24,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:24,469 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 10:40:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash -800247111, now seen corresponding path program 1 times [2022-11-20 10:40:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328211804] [2022-11-20 10:40:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:24,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328211804] [2022-11-20 10:40:24,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328211804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901605424] [2022-11-20 10:40:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:24,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:24,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:24,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:24,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:40:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:24,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:40:24,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:40:24,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:24,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901605424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:24,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:24,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 10:40:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876039073] [2022-11-20 10:40:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:24,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:24,768 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 10:40:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:24,961 INFO L93 Difference]: Finished difference Result 275 states and 372 transitions. [2022-11-20 10:40:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-20 10:40:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:24,963 INFO L225 Difference]: With dead ends: 275 [2022-11-20 10:40:24,963 INFO L226 Difference]: Without dead ends: 167 [2022-11-20 10:40:24,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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 10:40:24,964 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 42 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:24,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:40:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-20 10:40:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2022-11-20 10:40:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 10:40:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 181 transitions. [2022-11-20 10:40:24,971 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 181 transitions. Word has length 48 [2022-11-20 10:40:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:24,972 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 181 transitions. [2022-11-20 10:40:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 10:40:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions. [2022-11-20 10:40:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 10:40:24,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:24,973 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 10:40:24,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:25,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:25,174 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 10:40:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1807635140, now seen corresponding path program 1 times [2022-11-20 10:40:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:25,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570438635] [2022-11-20 10:40:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:25,486 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 10:40:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:25,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570438635] [2022-11-20 10:40:25,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570438635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:25,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316374576] [2022-11-20 10:40:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:25,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:25,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:25,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:40:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:25,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:40:25,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:40:25,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:25,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316374576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:25,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:25,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-20 10:40:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985704424] [2022-11-20 10:40:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:25,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:25,737 INFO L87 Difference]: Start difference. First operand 145 states and 181 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 10:40:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:25,828 INFO L93 Difference]: Finished difference Result 282 states and 365 transitions. [2022-11-20 10:40:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 10:40:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:25,831 INFO L225 Difference]: With dead ends: 282 [2022-11-20 10:40:25,831 INFO L226 Difference]: Without dead ends: 163 [2022-11-20 10:40:25,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:25,835 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:25,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 175 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-11-20 10:40:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-20 10:40:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2022-11-20 10:40:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 10:40:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 181 transitions. [2022-11-20 10:40:25,844 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 181 transitions. Word has length 64 [2022-11-20 10:40:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:25,846 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 181 transitions. [2022-11-20 10:40:25,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 10:40:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions. [2022-11-20 10:40:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:40:25,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:25,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2022-11-20 10:40:25,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:40:26,061 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 10:40:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1136776271, now seen corresponding path program 1 times [2022-11-20 10:40:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:26,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587405040] [2022-11-20 10:40:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:40:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:26,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587405040] [2022-11-20 10:40:26,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587405040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:26,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754060463] [2022-11-20 10:40:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:26,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:26,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:40:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:40:26,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:40:26,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754060463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:26,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:26,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 10:40:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184102627] [2022-11-20 10:40:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:26,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:26,444 INFO L87 Difference]: Start difference. First operand 145 states and 181 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 10:40:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:26,576 INFO L93 Difference]: Finished difference Result 356 states and 450 transitions. [2022-11-20 10:40:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:40:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 74 [2022-11-20 10:40:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:26,580 INFO L225 Difference]: With dead ends: 356 [2022-11-20 10:40:26,580 INFO L226 Difference]: Without dead ends: 238 [2022-11-20 10:40:26,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:26,582 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 96 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:26,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 125 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:40:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-20 10:40:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 165. [2022-11-20 10:40:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.2621951219512195) internal successors, (207), 164 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 10:40:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2022-11-20 10:40:26,592 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 74 [2022-11-20 10:40:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:26,592 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2022-11-20 10:40:26,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 10:40:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2022-11-20 10:40:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 10:40:26,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:26,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-20 10:40:26,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:26,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:40:26,799 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 10:40:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2036468052, now seen corresponding path program 1 times [2022-11-20 10:40:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985430560] [2022-11-20 10:40:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 10:40:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985430560] [2022-11-20 10:40:26,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985430560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:26,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:26,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:40:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81927068] [2022-11-20 10:40:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:26,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:40:26,921 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 10:40:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:26,953 INFO L93 Difference]: Finished difference Result 303 states and 384 transitions. [2022-11-20 10:40:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 76 [2022-11-20 10:40:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:26,955 INFO L225 Difference]: With dead ends: 303 [2022-11-20 10:40:26,955 INFO L226 Difference]: Without dead ends: 165 [2022-11-20 10:40:26,955 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 10:40:26,956 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:26,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-20 10:40:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-20 10:40:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.201219512195122) internal successors, (197), 164 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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 10:40:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2022-11-20 10:40:26,963 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 76 [2022-11-20 10:40:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:26,964 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2022-11-20 10:40:26,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 10:40:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-11-20 10:40:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 10:40:26,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:26,965 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-20 10:40:26,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:40:26,966 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 10:40:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1696856020, now seen corresponding path program 1 times [2022-11-20 10:40:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:26,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913028878] [2022-11-20 10:40:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:27,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913028878] [2022-11-20 10:40:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913028878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097494971] [2022-11-20 10:40:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:27,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:27,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:27,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:27,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:40:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:27,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:40:27,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-20 10:40:27,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:27,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097494971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:27,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:27,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-11-20 10:40:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326393865] [2022-11-20 10:40:27,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:27,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:40:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:27,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:40:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:40:27,550 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 10:40:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:27,736 INFO L93 Difference]: Finished difference Result 583 states and 702 transitions. [2022-11-20 10:40:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:40:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 77 [2022-11-20 10:40:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:27,738 INFO L225 Difference]: With dead ends: 583 [2022-11-20 10:40:27,738 INFO L226 Difference]: Without dead ends: 445 [2022-11-20 10:40:27,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:40:27,739 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 210 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:27,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 429 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:40:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-11-20 10:40:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 300. [2022-11-20 10:40:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.2073578595317727) internal successors, (361), 299 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 10:40:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2022-11-20 10:40:27,756 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 77 [2022-11-20 10:40:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:27,756 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2022-11-20 10:40:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 10:40:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2022-11-20 10:40:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 10:40:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:27,758 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-20 10:40:27,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:27,963 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 10:40:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -745407646, now seen corresponding path program 1 times [2022-11-20 10:40:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109019719] [2022-11-20 10:40:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:28,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109019719] [2022-11-20 10:40:28,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109019719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:28,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647875204] [2022-11-20 10:40:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:28,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:28,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:40:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:28,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:40:28,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:40:28,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:40:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647875204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:28,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:40:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 8] total 18 [2022-11-20 10:40:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494485575] [2022-11-20 10:40:28,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:40:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:40:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:40:28,701 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 10:40:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:30,285 INFO L93 Difference]: Finished difference Result 1061 states and 1299 transitions. [2022-11-20 10:40:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 10:40:30,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 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 10:40:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:30,289 INFO L225 Difference]: With dead ends: 1061 [2022-11-20 10:40:30,289 INFO L226 Difference]: Without dead ends: 748 [2022-11-20 10:40:30,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=389, Invalid=1681, Unknown=0, NotChecked=0, Total=2070 [2022-11-20 10:40:30,291 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1049 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:30,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 480 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:40:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-20 10:40:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 492. [2022-11-20 10:40:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.1812627291242364) internal successors, (580), 491 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 10:40:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 580 transitions. [2022-11-20 10:40:30,317 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 580 transitions. Word has length 80 [2022-11-20 10:40:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:30,318 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 580 transitions. [2022-11-20 10:40:30,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 10:40:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 580 transitions. [2022-11-20 10:40:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:40:30,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:30,320 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 10:40:30,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:30,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:30,526 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 10:40:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash -112361859, now seen corresponding path program 1 times [2022-11-20 10:40:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851023101] [2022-11-20 10:40:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,783 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 10:40:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851023101] [2022-11-20 10:40:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851023101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:40:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956075281] [2022-11-20 10:40:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:30,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:40:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:40:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:30,786 INFO L87 Difference]: Start difference. First operand 492 states and 580 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 10:40:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:31,256 INFO L93 Difference]: Finished difference Result 1292 states and 1512 transitions. [2022-11-20 10:40:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:40:31,257 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 10:40:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:31,261 INFO L225 Difference]: With dead ends: 1292 [2022-11-20 10:40:31,262 INFO L226 Difference]: Without dead ends: 1055 [2022-11-20 10:40:31,262 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 10:40:31,263 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 313 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:31,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 556 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:40:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-20 10:40:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 492. [2022-11-20 10:40:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.1812627291242364) internal successors, (580), 491 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 10:40:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 580 transitions. [2022-11-20 10:40:31,302 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 580 transitions. Word has length 83 [2022-11-20 10:40:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:31,302 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 580 transitions. [2022-11-20 10:40:31,303 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 10:40:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 580 transitions. [2022-11-20 10:40:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:40:31,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:31,304 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:40:31,305 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 10:40:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 928368216, now seen corresponding path program 1 times [2022-11-20 10:40:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511936395] [2022-11-20 10:40:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:31,553 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 10:40:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:31,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511936395] [2022-11-20 10:40:31,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511936395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:31,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745419421] [2022-11-20 10:40:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:31,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:31,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:31,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:40:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:40:31,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:31,874 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 10:40:31,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:31,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745419421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:31,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:31,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-20 10:40:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201381866] [2022-11-20 10:40:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:31,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:40:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:31,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:40:31,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:31,877 INFO L87 Difference]: Start difference. First operand 492 states and 580 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 10:40:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:32,041 INFO L93 Difference]: Finished difference Result 976 states and 1150 transitions. [2022-11-20 10:40:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:40:32,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 10:40:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:32,045 INFO L225 Difference]: With dead ends: 976 [2022-11-20 10:40:32,045 INFO L226 Difference]: Without dead ends: 739 [2022-11-20 10:40:32,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:32,047 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:32,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:40:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-20 10:40:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 705. [2022-11-20 10:40:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.1832386363636365) internal successors, (833), 704 states have internal predecessors, (833), 0 states have call successors, (0), 0 states 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 10:40:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 833 transitions. [2022-11-20 10:40:32,087 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 833 transitions. Word has length 83 [2022-11-20 10:40:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:32,087 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 833 transitions. [2022-11-20 10:40:32,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 10:40:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 833 transitions. [2022-11-20 10:40:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:40:32,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:32,089 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 10:40:32,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:32,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:40:32,295 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 10:40:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash -853788807, now seen corresponding path program 1 times [2022-11-20 10:40:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:32,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277646520] [2022-11-20 10:40:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:32,528 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 10:40:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277646520] [2022-11-20 10:40:32,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277646520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:32,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:32,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:40:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705291609] [2022-11-20 10:40:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:32,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:40:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:40:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:32,531 INFO L87 Difference]: Start difference. First operand 705 states and 833 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 10:40:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:33,173 INFO L93 Difference]: Finished difference Result 1293 states and 1510 transitions. [2022-11-20 10:40:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:40:33,173 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 10:40:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:33,177 INFO L225 Difference]: With dead ends: 1293 [2022-11-20 10:40:33,177 INFO L226 Difference]: Without dead ends: 1056 [2022-11-20 10:40:33,178 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 10:40:33,178 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 415 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 839 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:33,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 839 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:40:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-20 10:40:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 701. [2022-11-20 10:40:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.1842857142857144) internal successors, (829), 700 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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 10:40:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 829 transitions. [2022-11-20 10:40:33,223 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 829 transitions. Word has length 85 [2022-11-20 10:40:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:33,223 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 829 transitions. [2022-11-20 10:40:33,223 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 10:40:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 829 transitions. [2022-11-20 10:40:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:40:33,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:33,225 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] [2022-11-20 10:40:33,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:40:33,226 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 10:40:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1873307673, now seen corresponding path program 1 times [2022-11-20 10:40:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:33,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412812180] [2022-11-20 10:40:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:33,489 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 10:40:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412812180] [2022-11-20 10:40:33,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412812180] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430485620] [2022-11-20 10:40:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:33,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:33,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:40:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:33,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:40:33,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:34,009 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 10:40:34,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:34,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430485620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:34,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:34,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-11-20 10:40:34,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71706056] [2022-11-20 10:40:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:34,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:40:34,015 INFO L87 Difference]: Start difference. First operand 701 states and 829 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 10:40:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:34,186 INFO L93 Difference]: Finished difference Result 946 states and 1113 transitions. [2022-11-20 10:40:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:40:34,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 86 [2022-11-20 10:40:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:34,189 INFO L225 Difference]: With dead ends: 946 [2022-11-20 10:40:34,190 INFO L226 Difference]: Without dead ends: 715 [2022-11-20 10:40:34,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:40:34,191 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:34,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 311 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:40:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-20 10:40:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 473. [2022-11-20 10:40:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.1843220338983051) internal successors, (559), 472 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 10:40:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 559 transitions. [2022-11-20 10:40:34,232 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 559 transitions. Word has length 86 [2022-11-20 10:40:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:34,233 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 559 transitions. [2022-11-20 10:40:34,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 10:40:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 559 transitions. [2022-11-20 10:40:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 10:40:34,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:34,237 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 10:40:34,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:34,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:40:34,444 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 10:40:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1173715893, now seen corresponding path program 1 times [2022-11-20 10:40:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:34,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621829550] [2022-11-20 10:40:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,740 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 10:40:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:34,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621829550] [2022-11-20 10:40:34,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621829550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950753561] [2022-11-20 10:40:34,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:34,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:34,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:34,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:34,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:40:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:40:34,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:40:35,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:40:35,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950753561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:35,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:40:35,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-11-20 10:40:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607534154] [2022-11-20 10:40:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:40:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:40:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:40:35,653 INFO L87 Difference]: Start difference. First operand 473 states and 559 transitions. Second operand has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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 10:40:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:47,802 INFO L93 Difference]: Finished difference Result 4284 states and 4912 transitions. [2022-11-20 10:40:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-20 10:40:47,802 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 0 states have call successors, (0), 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 10:40:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:47,817 INFO L225 Difference]: With dead ends: 4284 [2022-11-20 10:40:47,817 INFO L226 Difference]: Without dead ends: 3679 [2022-11-20 10:40:47,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14482 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4688, Invalid=31984, Unknown=0, NotChecked=0, Total=36672 [2022-11-20 10:40:47,831 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 2069 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 5232 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 5332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 5232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:47,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 2993 Invalid, 5332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 5232 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-20 10:40:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2022-11-20 10:40:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 1175. [2022-11-20 10:40:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.2427597955706984) internal successors, (1459), 1174 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states 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 10:40:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1459 transitions. [2022-11-20 10:40:47,950 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1459 transitions. Word has length 89 [2022-11-20 10:40:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:47,950 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1459 transitions. [2022-11-20 10:40:47,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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 10:40:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1459 transitions. [2022-11-20 10:40:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 10:40:47,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:47,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:47,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:48,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:40:48,159 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 10:40:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 93372685, now seen corresponding path program 1 times [2022-11-20 10:40:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:48,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687651001] [2022-11-20 10:40:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:40:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:48,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687651001] [2022-11-20 10:40:48,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687651001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:48,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988194094] [2022-11-20 10:40:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:48,335 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:48,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:40:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:48,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:40:48,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:40:48,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:40:48,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988194094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:48,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:40:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-11-20 10:40:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584599803] [2022-11-20 10:40:48,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:40:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:40:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:40:48,681 INFO L87 Difference]: Start difference. First operand 1175 states and 1459 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 10:40:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:49,601 INFO L93 Difference]: Finished difference Result 4050 states and 5089 transitions. [2022-11-20 10:40:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:40:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-20 10:40:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:49,610 INFO L225 Difference]: With dead ends: 4050 [2022-11-20 10:40:49,610 INFO L226 Difference]: Without dead ends: 2491 [2022-11-20 10:40:49,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:40:49,632 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 446 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:49,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 434 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:40:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2022-11-20 10:40:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1878. [2022-11-20 10:40:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 1.2061800745871072) internal successors, (2264), 1877 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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 10:40:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2264 transitions. [2022-11-20 10:40:49,748 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2264 transitions. Word has length 97 [2022-11-20 10:40:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:49,749 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2264 transitions. [2022-11-20 10:40:49,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 10:40:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2264 transitions. [2022-11-20 10:40:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 10:40:49,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:49,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:49,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:49,965 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 10:40:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash -459279758, now seen corresponding path program 1 times [2022-11-20 10:40:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:49,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692555148] [2022-11-20 10:40:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:49,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:40:50,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:40:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:40:50,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:40:50,112 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:40:50,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-11-20 10:40:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-11-20 10:40:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-11-20 10:40:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-11-20 10:40:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-11-20 10:40:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-11-20 10:40:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-11-20 10:40:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-11-20 10:40:50,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-11-20 10:40:50,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-11-20 10:40:50,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-11-20 10:40:50,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-11-20 10:40:50,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-11-20 10:40:50,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-11-20 10:40:50,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-11-20 10:40:50,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-11-20 10:40:50,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-11-20 10:40:50,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-11-20 10:40:50,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-11-20 10:40:50,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-11-20 10:40:50,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-11-20 10:40:50,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-11-20 10:40:50,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-11-20 10:40:50,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-11-20 10:40:50,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-11-20 10:40:50,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-11-20 10:40:50,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-11-20 10:40:50,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-11-20 10:40:50,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-11-20 10:40:50,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-11-20 10:40:50,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-11-20 10:40:50,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-11-20 10:40:50,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-11-20 10:40:50,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-11-20 10:40:50,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-11-20 10:40:50,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-11-20 10:40:50,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-11-20 10:40:50,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-11-20 10:40:50,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:40:50,129 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:50,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:40:50,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:40:50 BoogieIcfgContainer [2022-11-20 10:40:50,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:40:50,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:40:50,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:40:50,292 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:40:50,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:40:20" (3/4) ... [2022-11-20 10:40:50,295 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:40:50,382 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:40:50,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:40:50,383 INFO L158 Benchmark]: Toolchain (without parser) took 31303.60ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 126.1MB in the beginning and 168.7MB in the end (delta: -42.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,383 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:40:50,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.27ms. Allocated memory is still 153.1MB. Free memory was 125.7MB in the beginning and 113.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.13ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 110.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,384 INFO L158 Benchmark]: Boogie Preprocessor took 38.37ms. Allocated memory is still 153.1MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:40:50,385 INFO L158 Benchmark]: RCFGBuilder took 797.25ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 85.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,389 INFO L158 Benchmark]: TraceAbstraction took 29916.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 84.5MB in the beginning and 177.1MB in the end (delta: -92.6MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,390 INFO L158 Benchmark]: Witness Printer took 90.01ms. Allocated memory is still 323.0MB. Free memory was 177.1MB in the beginning and 168.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:40:50,393 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.31ms. Allocated memory is still 121.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.27ms. Allocated memory is still 153.1MB. Free memory was 125.7MB in the beginning and 113.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.13ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 110.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.37ms. Allocated memory is still 153.1MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 797.25ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 85.4MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29916.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 84.5MB in the beginning and 177.1MB in the end (delta: -92.6MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * Witness Printer took 90.01ms. Allocated memory is still 323.0MB. Free memory was 177.1MB in the beginning and 168.7MB in the end (delta: 8.4MB). 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] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] 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)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, 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: 29.7s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5407 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5407 mSDsluCounter, 8085 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 5969 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8702 IncrementalHoareTripleChecker+Invalid, 9203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 2116 mSDtfsCounter, 8702 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 1068 SyntacticMatches, 16 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15195 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1878occurred in iteration=19, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 5003 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1969 NumberOfCodeBlocks, 1969 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2101 ConstructedInterpolants, 2 QuantifiedInterpolants, 10450 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1752 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 1433/1807 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 10:40:50,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47cabf6-6a90-4e20-9f6a-42b9e9f8395f/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)