./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a --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 64bit --witnessprinter.graph.data.programhash fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f --- 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-b5237d8 [2022-11-21 17:21:19,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:21:19,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:21:19,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:21:19,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:21:19,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:21:19,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:21:19,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:21:19,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:21:19,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:21:19,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:21:19,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:21:19,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:21:19,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:21:19,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:21:19,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:21:19,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:21:19,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:21:19,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:21:19,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:21:19,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:21:19,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:21:19,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:21:19,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:21:19,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:21:19,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:21:19,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:21:19,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:21:19,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:21:19,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:21:19,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:21:19,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:21:19,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:21:19,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:21:19,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:21:19,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:21:19,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:21:19,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:21:19,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:21:19,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:21:19,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:21:19,326 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 17:21:19,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:21:19,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:21:19,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:21:19,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:21:19,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:21:19,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:21:19,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:21:19,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:21:19,377 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:21:19,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:21:19,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:21:19,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:21:19,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:21:19,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:21:19,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:21:19,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:21:19,381 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:21:19,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:21:19,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:21:19,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:21:19,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:21:19,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:21:19,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:21:19,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:21:19,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:21:19,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:21:19,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:21:19,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:21:19,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:21:19,385 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:21:19,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:21:19,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:21:19,386 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_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/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_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f [2022-11-21 17:21:19,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:21:19,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:21:19,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:21:19,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:21:19,781 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:21:19,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2022-11-21 17:21:23,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:21:23,975 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:21:23,975 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2022-11-21 17:21:24,017 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/data/7054ddde7/b0a6d62a7ceb4dfcaba7d274db48ea2c/FLAG60c5b993e [2022-11-21 17:21:24,035 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/data/7054ddde7/b0a6d62a7ceb4dfcaba7d274db48ea2c [2022-11-21 17:21:24,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:21:24,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:21:24,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:21:24,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:21:24,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:21:24,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:21:24" (1/1) ... [2022-11-21 17:21:24,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a64c48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:24, skipping insertion in model container [2022-11-21 17:21:24,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:21:24" (1/1) ... [2022-11-21 17:21:24,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:21:24,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:21:24,635 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 17:21:25,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:21:25,488 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:21:25,536 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 17:21:25,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:21:25,831 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:21:25,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25 WrapperNode [2022-11-21 17:21:25,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:21:25,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:21:25,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:21:25,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:21:25,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:25,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:25,955 INFO L138 Inliner]: procedures = 503, calls = 69, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 117 [2022-11-21 17:21:25,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:21:25,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:21:25,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:21:25,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:21:25,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:25,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,031 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:21:26,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:21:26,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:21:26,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:21:26,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (1/1) ... [2022-11-21 17:21:26,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:21:26,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:21:26,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:21:26,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:21:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-21 17:21:26,146 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-21 17:21:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-21 17:21:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-21 17:21:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:21:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:21:26,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:21:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-21 17:21:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:21:26,348 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:21:26,350 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:21:26,862 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:21:26,871 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:21:26,872 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:21:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:21:26 BoogieIcfgContainer [2022-11-21 17:21:26,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:21:26,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:21:26,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:21:26,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:21:26,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:21:24" (1/3) ... [2022-11-21 17:21:26,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142bca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:21:26, skipping insertion in model container [2022-11-21 17:21:26,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:21:25" (2/3) ... [2022-11-21 17:21:26,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142bca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:21:26, skipping insertion in model container [2022-11-21 17:21:26,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:21:26" (3/3) ... [2022-11-21 17:21:26,886 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2022-11-21 17:21:26,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:21:26,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-21 17:21:27,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:21:27,014 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;@5e7fd1ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:21:27,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-21 17:21:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 58 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-21 17:21:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 17:21:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:27,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:21:27,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1360265392, now seen corresponding path program 1 times [2022-11-21 17:21:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:27,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668558287] [2022-11-21 17:21:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:27,476 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-21 17:21:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:27,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668558287] [2022-11-21 17:21:27,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668558287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:27,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:27,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:21:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801822065] [2022-11-21 17:21:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:27,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:27,521 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 58 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:27,610 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2022-11-21 17:21:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-21 17:21:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:27,624 INFO L225 Difference]: With dead ends: 119 [2022-11-21 17:21:27,625 INFO L226 Difference]: Without dead ends: 55 [2022-11-21 17:21:27,628 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-21 17:21:27,632 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:27,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-21 17:21:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-21 17:21:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 51 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-21 17:21:27,685 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 13 [2022-11-21 17:21:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:27,687 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-21 17:21:27,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-21 17:21:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 17:21:27,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:27,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:21:27,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:21:27,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1763942635, now seen corresponding path program 1 times [2022-11-21 17:21:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:27,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672636432] [2022-11-21 17:21:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:27,857 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-21 17:21:27,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:27,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672636432] [2022-11-21 17:21:27,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672636432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:27,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:27,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590208063] [2022-11-21 17:21:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:27,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:27,862 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:27,894 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-11-21 17:21:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-21 17:21:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:27,896 INFO L225 Difference]: With dead ends: 86 [2022-11-21 17:21:27,896 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 17:21:27,897 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-21 17:21:27,899 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:27,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 165 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 17:21:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 54. [2022-11-21 17:21:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 50 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-21 17:21:27,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 15 [2022-11-21 17:21:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:27,913 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-21 17:21:27,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-21 17:21:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:21:27,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:27,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:21:27,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:21:27,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1152353090, now seen corresponding path program 1 times [2022-11-21 17:21:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:27,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582955946] [2022-11-21 17:21:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:27,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,002 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-21 17:21:28,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582955946] [2022-11-21 17:21:28,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582955946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046034930] [2022-11-21 17:21:28,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,006 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:28,039 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-11-21 17:21:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-21 17:21:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:28,042 INFO L225 Difference]: With dead ends: 85 [2022-11-21 17:21:28,043 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 17:21:28,043 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-21 17:21:28,045 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:28,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 126 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 17:21:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2022-11-21 17:21:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 49 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-21 17:21:28,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 16 [2022-11-21 17:21:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:28,061 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-21 17:21:28,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-21 17:21:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 17:21:28,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:28,062 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] [2022-11-21 17:21:28,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:21:28,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 426875171, now seen corresponding path program 1 times [2022-11-21 17:21:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:28,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357937831] [2022-11-21 17:21:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,223 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-21 17:21:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357937831] [2022-11-21 17:21:28,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357937831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909500529] [2022-11-21 17:21:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,234 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:28,293 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-11-21 17:21:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-21 17:21:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:28,301 INFO L225 Difference]: With dead ends: 71 [2022-11-21 17:21:28,301 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 17:21:28,302 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-21 17:21:28,304 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:28,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 141 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 17:21:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2022-11-21 17:21:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-11-21 17:21:28,329 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 21 [2022-11-21 17:21:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:28,330 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-21 17:21:28,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-11-21 17:21:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:21:28,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:28,334 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] [2022-11-21 17:21:28,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:21:28,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 348228521, now seen corresponding path program 1 times [2022-11-21 17:21:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607838399] [2022-11-21 17:21:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,483 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-21 17:21:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607838399] [2022-11-21 17:21:28,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607838399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330031995] [2022-11-21 17:21:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,490 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:28,537 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-11-21 17:21:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-21 17:21:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:28,547 INFO L225 Difference]: With dead ends: 70 [2022-11-21 17:21:28,547 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 17:21:28,548 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-21 17:21:28,551 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:28,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 17:21:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-11-21 17:21:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 47 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-11-21 17:21:28,584 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 22 [2022-11-21 17:21:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:28,584 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-21 17:21:28,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-11-21 17:21:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 17:21:28,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:28,589 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] [2022-11-21 17:21:28,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:21:28,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash 56365263, now seen corresponding path program 1 times [2022-11-21 17:21:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:28,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296210817] [2022-11-21 17:21:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,697 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-21 17:21:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296210817] [2022-11-21 17:21:28,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296210817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077077679] [2022-11-21 17:21:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,701 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:28,729 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-11-21 17:21:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:28,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-21 17:21:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:28,731 INFO L225 Difference]: With dead ends: 73 [2022-11-21 17:21:28,732 INFO L226 Difference]: Without dead ends: 64 [2022-11-21 17:21:28,732 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-21 17:21:28,734 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:28,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-21 17:21:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-11-21 17:21:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.325) internal successors, (53), 49 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-21 17:21:28,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2022-11-21 17:21:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:28,747 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-21 17:21:28,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-21 17:21:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:21:28,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:28,749 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] [2022-11-21 17:21:28,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:21:28,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1747323290, now seen corresponding path program 1 times [2022-11-21 17:21:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:28,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010476963] [2022-11-21 17:21:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,819 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-21 17:21:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010476963] [2022-11-21 17:21:28,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010476963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301346364] [2022-11-21 17:21:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,824 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:28,855 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-11-21 17:21:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-21 17:21:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:28,858 INFO L225 Difference]: With dead ends: 54 [2022-11-21 17:21:28,859 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 17:21:28,859 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-21 17:21:28,863 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:28,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 17:21:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-21 17:21:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.3) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:21:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-21 17:21:28,881 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 25 [2022-11-21 17:21:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:28,881 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-21 17:21:28,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:21:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-21 17:21:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 17:21:28,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:28,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:21:28,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:21:28,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1531791043, now seen corresponding path program 1 times [2022-11-21 17:21:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454245609] [2022-11-21 17:21:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 17:21:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 17:21:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:28,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454245609] [2022-11-21 17:21:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454245609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:28,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:28,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:21:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509447279] [2022-11-21 17:21:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:28,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:28,997 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:21:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:29,017 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-11-21 17:21:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-21 17:21:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:29,020 INFO L225 Difference]: With dead ends: 86 [2022-11-21 17:21:29,020 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 17:21:29,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 17:21:29,022 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:29,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 17:21:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-21 17:21:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 17:21:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-11-21 17:21:29,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 29 [2022-11-21 17:21:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:29,032 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-11-21 17:21:29,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:21:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-11-21 17:21:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 17:21:29,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:29,034 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] [2022-11-21 17:21:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:21:29,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1429473631, now seen corresponding path program 1 times [2022-11-21 17:21:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846506217] [2022-11-21 17:21:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 17:21:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,108 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-21 17:21:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:29,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846506217] [2022-11-21 17:21:29,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846506217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:29,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:29,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729714509] [2022-11-21 17:21:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:29,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:29,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:29,111 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:21:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:29,123 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-21 17:21:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-21 17:21:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:29,128 INFO L225 Difference]: With dead ends: 47 [2022-11-21 17:21:29,129 INFO L226 Difference]: Without dead ends: 46 [2022-11-21 17:21:29,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 17:21:29,133 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:29,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-21 17:21:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-21 17:21:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 17:21:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-21 17:21:29,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 34 [2022-11-21 17:21:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:29,147 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-21 17:21:29,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:21:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-21 17:21:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 17:21:29,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:29,150 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] [2022-11-21 17:21:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:21:29,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:21:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1364009762, now seen corresponding path program 1 times [2022-11-21 17:21:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667142075] [2022-11-21 17:21:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 17:21:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:29,251 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-21 17:21:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:29,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667142075] [2022-11-21 17:21:29,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667142075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:21:29,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:21:29,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:21:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558836729] [2022-11-21 17:21:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:21:29,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:21:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:21:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:21:29,255 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:21:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:29,268 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-21 17:21:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:21:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 17:21:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:29,272 INFO L225 Difference]: With dead ends: 46 [2022-11-21 17:21:29,272 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 17:21:29,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 17:21:29,275 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:29,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:21:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 17:21:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 17:21:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:21:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 17:21:29,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-21 17:21:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:29,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 17:21:29,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:21:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 17:21:29,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 17:21:29,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-21 17:21:29,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-21 17:21:29,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-21 17:21:29,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-21 17:21:29,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-21 17:21:29,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-21 17:21:29,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-21 17:21:29,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-21 17:21:29,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:21:29,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 17:21:29,425 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-21 17:21:29,425 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 17:21:29,428 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-21 17:21:29,428 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 17:21:29,429 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 17:21:29,429 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-21 17:21:29,429 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 17:21:29,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1590) no Hoare annotation was computed. [2022-11-21 17:21:29,430 INFO L899 garLoopResultBuilder]: For program point L1621(lines 1621 1637) no Hoare annotation was computed. [2022-11-21 17:21:29,430 INFO L899 garLoopResultBuilder]: For program point L1588(lines 1588 1596) no Hoare annotation was computed. [2022-11-21 17:21:29,430 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1583) no Hoare annotation was computed. [2022-11-21 17:21:29,430 INFO L899 garLoopResultBuilder]: For program point L1580-2(lines 1577 1599) no Hoare annotation was computed. [2022-11-21 17:21:29,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-11-21 17:21:29,431 INFO L899 garLoopResultBuilder]: For program point L1638(lines 1638 1644) no Hoare annotation was computed. [2022-11-21 17:21:29,431 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1566) no Hoare annotation was computed. [2022-11-21 17:21:29,431 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 17:21:29,431 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 17:21:29,431 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1572) no Hoare annotation was computed. [2022-11-21 17:21:29,432 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1618) no Hoare annotation was computed. [2022-11-21 17:21:29,432 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2022-11-21 17:21:29,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1566) no Hoare annotation was computed. [2022-11-21 17:21:29,432 INFO L899 garLoopResultBuilder]: For program point L1631(lines 1631 1635) no Hoare annotation was computed. [2022-11-21 17:21:29,433 INFO L899 garLoopResultBuilder]: For program point L1590(line 1590) no Hoare annotation was computed. [2022-11-21 17:21:29,433 INFO L899 garLoopResultBuilder]: For program point L1590-1(line 1590) no Hoare annotation was computed. [2022-11-21 17:21:29,433 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1)) [2022-11-21 17:21:29,433 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-11-21 17:21:29,434 INFO L899 garLoopResultBuilder]: For program point L1582(line 1582) no Hoare annotation was computed. [2022-11-21 17:21:29,434 INFO L899 garLoopResultBuilder]: For program point L1582-2(line 1582) no Hoare annotation was computed. [2022-11-21 17:21:29,434 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-21 17:21:29,434 INFO L899 garLoopResultBuilder]: For program point L1566-1(line 1566) no Hoare annotation was computed. [2022-11-21 17:21:29,435 INFO L895 garLoopResultBuilder]: At program point L1591(line 1591) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (= ~GLOBAL_CONST_TRUE~0 1) (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0)) [2022-11-21 17:21:29,435 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-21 17:21:29,435 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2022-11-21 17:21:29,435 INFO L899 garLoopResultBuilder]: For program point L1616-1(line 1616) no Hoare annotation was computed. [2022-11-21 17:21:29,435 INFO L899 garLoopResultBuilder]: For program point L1633(line 1633) no Hoare annotation was computed. [2022-11-21 17:21:29,436 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1620) no Hoare annotation was computed. [2022-11-21 17:21:29,436 INFO L899 garLoopResultBuilder]: For program point L1633-1(line 1633) no Hoare annotation was computed. [2022-11-21 17:21:29,436 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 0 (+ 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= ~GLOBAL_CONST_TRUE~0 1)) [2022-11-21 17:21:29,436 INFO L899 garLoopResultBuilder]: For program point L1625(lines 1625 1628) no Hoare annotation was computed. [2022-11-21 17:21:29,437 INFO L899 garLoopResultBuilder]: For program point L1625-2(lines 1622 1637) no Hoare annotation was computed. [2022-11-21 17:21:29,437 INFO L895 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:21:29,437 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-21 17:21:29,438 INFO L899 garLoopResultBuilder]: For program point L1650-1(line 1650) no Hoare annotation was computed. [2022-11-21 17:21:29,438 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1599) no Hoare annotation was computed. [2022-11-21 17:21:29,438 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:21:29,438 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 17:21:29,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1616) no Hoare annotation was computed. [2022-11-21 17:21:29,439 INFO L895 garLoopResultBuilder]: At program point L1651(lines 1645 1652) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:21:29,439 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1555) no Hoare annotation was computed. [2022-11-21 17:21:29,439 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1549 1575) no Hoare annotation was computed. [2022-11-21 17:21:29,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 17:21:29,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1616) no Hoare annotation was computed. [2022-11-21 17:21:29,440 INFO L899 garLoopResultBuilder]: For program point L1586(lines 1586 1597) no Hoare annotation was computed. [2022-11-21 17:21:29,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1590) no Hoare annotation was computed. [2022-11-21 17:21:29,440 INFO L895 garLoopResultBuilder]: At program point L1595(line 1595) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0)) [2022-11-21 17:21:29,441 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 1573) no Hoare annotation was computed. [2022-11-21 17:21:29,441 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1574) no Hoare annotation was computed. [2022-11-21 17:21:29,441 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-21 17:21:29,441 INFO L899 garLoopResultBuilder]: For program point L1554-2(line 1554) no Hoare annotation was computed. [2022-11-21 17:21:29,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-11-21 17:21:29,442 INFO L899 garLoopResultBuilder]: For program point L1604(lines 1604 1611) no Hoare annotation was computed. [2022-11-21 17:21:29,442 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= ~GLOBAL_CONST_TRUE~0 1)) [2022-11-21 17:21:29,442 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1601 1620) no Hoare annotation was computed. [2022-11-21 17:21:29,446 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:21:29,449 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:21:29,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:21:29 BoogieIcfgContainer [2022-11-21 17:21:29,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:21:29,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:21:29,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:21:29,475 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:21:29,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:21:26" (3/4) ... [2022-11-21 17:21:29,480 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 17:21:29,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-21 17:21:29,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-21 17:21:29,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-21 17:21:29,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-21 17:21:29,496 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 17:21:29,496 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 17:21:29,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:21:29,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:21:29,586 INFO L158 Benchmark]: Toolchain (without parser) took 5545.68ms. Allocated memory was 136.3MB in the beginning and 211.8MB in the end (delta: 75.5MB). Free memory was 88.9MB in the beginning and 83.6MB in the end (delta: 5.3MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,587 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 136.3MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:21:29,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1790.90ms. Allocated memory was 136.3MB in the beginning and 211.8MB in the end (delta: 75.5MB). Free memory was 88.9MB in the beginning and 140.4MB in the end (delta: -51.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.61ms. Allocated memory is still 211.8MB. Free memory was 140.4MB in the beginning and 136.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,588 INFO L158 Benchmark]: Boogie Preprocessor took 71.31ms. Allocated memory is still 211.8MB. Free memory was 136.3MB in the beginning and 135.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:21:29,588 INFO L158 Benchmark]: RCFGBuilder took 837.10ms. Allocated memory is still 211.8MB. Free memory was 135.1MB in the beginning and 116.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,589 INFO L158 Benchmark]: TraceAbstraction took 2596.22ms. Allocated memory is still 211.8MB. Free memory was 116.3MB in the beginning and 87.8MB in the end (delta: 28.5MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,590 INFO L158 Benchmark]: Witness Printer took 110.59ms. Allocated memory is still 211.8MB. Free memory was 87.8MB in the beginning and 83.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:21:29,592 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.39ms. Allocated memory is still 136.3MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1790.90ms. Allocated memory was 136.3MB in the beginning and 211.8MB in the end (delta: 75.5MB). Free memory was 88.9MB in the beginning and 140.4MB in the end (delta: -51.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.61ms. Allocated memory is still 211.8MB. Free memory was 140.4MB in the beginning and 136.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.31ms. Allocated memory is still 211.8MB. Free memory was 136.3MB in the beginning and 135.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 837.10ms. Allocated memory is still 211.8MB. Free memory was 135.1MB in the beginning and 116.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2596.22ms. Allocated memory is still 211.8MB. Free memory was 116.3MB in the beginning and 87.8MB in the end (delta: 28.5MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 110.59ms. Allocated memory is still 211.8MB. Free memory was 87.8MB in the beginning and 83.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 435 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 681 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 108 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 33 PreInvPairs, 41 NumberOfFragments, 90 HoareAnnotationTreeSize, 33 FomulaSimplifications, 353 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: GLOBAL_CONST_TRUE == 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 17:21:29,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58895c07-162c-460b-99d8-e1d7136fd66f/bin/uautomizer-vX5HgA9Q3a/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 Result: TRUE