./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:35:06,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:35:06,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:35:06,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:35:06,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:35:06,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:35:06,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:35:06,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:35:06,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:35:06,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:35:06,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:35:06,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:35:06,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:35:06,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:35:06,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:35:06,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:35:06,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:35:06,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:35:06,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:35:06,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:35:06,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:35:06,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:35:06,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:35:06,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:35:06,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:35:06,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:35:06,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:35:06,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:35:06,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:35:06,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:35:06,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:35:06,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:35:06,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:35:06,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:35:06,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:35:06,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:35:06,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:35:06,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:35:06,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:35:06,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:35:06,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:35:06,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 10:35:06,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:35:06,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:35:06,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:35:06,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:35:06,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:35:06,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:35:06,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:35:06,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:35:06,281 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:35:06,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:35:06,283 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:35:06,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:35:06,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:35:06,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:35:06,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:35:06,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:35:06,285 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:35:06,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:35:06,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:35:06,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:35:06,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:35:06,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:35:06,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:35:06,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:06,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:35:06,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:35:06,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:35:06,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:35:06,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:35:06,288 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:35:06,288 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:35:06,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:35:06,289 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_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb [2022-11-20 10:35:06,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:35:06,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:35:06,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:35:06,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:35:06,637 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:35:06,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-20 10:35:10,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:35:10,431 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:35:10,432 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-20 10:35:10,453 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/data/001f09254/33bf4cf4ae3b49c38da882749949c5ac/FLAG8d851358d [2022-11-20 10:35:10,467 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/data/001f09254/33bf4cf4ae3b49c38da882749949c5ac [2022-11-20 10:35:10,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:35:10,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:35:10,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:10,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:35:10,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:35:10,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:10" (1/1) ... [2022-11-20 10:35:10,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3caf5a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:10, skipping insertion in model container [2022-11-20 10:35:10,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:10" (1/1) ... [2022-11-20 10:35:10,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:35:10,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:35:10,956 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 10:35:11,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:11,560 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:35:11,596 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 10:35:11,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:11,863 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:35:11,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11 WrapperNode [2022-11-20 10:35:11,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:11,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:11,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:35:11,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:35:11,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,918 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-11-20 10:35:11,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:11,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:35:11,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:35:11,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:35:11,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,969 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:35:11,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:35:11,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:35:11,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:35:11,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (1/1) ... [2022-11-20 10:35:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:12,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:35:12,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:35:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-20 10:35:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-20 10:35:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-20 10:35:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-20 10:35:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:35:12,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:35:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:35:12,077 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-20 10:35:12,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:35:12,244 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:35:12,247 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:35:12,602 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:35:12,610 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:35:12,610 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:35:12,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:12 BoogieIcfgContainer [2022-11-20 10:35:12,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:35:12,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:35:12,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:35:12,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:35:12,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:35:10" (1/3) ... [2022-11-20 10:35:12,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b6b670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:12, skipping insertion in model container [2022-11-20 10:35:12,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:11" (2/3) ... [2022-11-20 10:35:12,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b6b670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:12, skipping insertion in model container [2022-11-20 10:35:12,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:12" (3/3) ... [2022-11-20 10:35:12,623 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-20 10:35:12,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:35:12,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-20 10:35:12,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:35:12,718 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;@9e50d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:35:12,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 10:35:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-20 10:35:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:35:12,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:12,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:12,746 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-20 10:35:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-11-20 10:35:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:12,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240038349] [2022-11-20 10:35:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:13,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240038349] [2022-11-20 10:35:13,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240038349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:13,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598380914] [2022-11-20 10:35:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:13,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:13,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,167 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.333333333333333) 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-20 10:35:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:13,251 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2022-11-20 10:35:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-20 10:35:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:13,265 INFO L225 Difference]: With dead ends: 210 [2022-11-20 10:35:13,265 INFO L226 Difference]: Without dead ends: 121 [2022-11-20 10:35:13,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,281 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:13,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-20 10:35:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2022-11-20 10:35:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 10:35:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2022-11-20 10:35:13,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 15 [2022-11-20 10:35:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:13,364 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2022-11-20 10:35:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-20 10:35:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2022-11-20 10:35:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:35:13,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:13,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:13,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:35:13,368 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-20 10:35:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1033231396, now seen corresponding path program 1 times [2022-11-20 10:35:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68274761] [2022-11-20 10:35:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:13,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68274761] [2022-11-20 10:35:13,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68274761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:13,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:13,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827272348] [2022-11-20 10:35:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:13,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,525 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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-20 10:35:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:13,542 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-11-20 10:35:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-20 10:35:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:13,544 INFO L225 Difference]: With dead ends: 128 [2022-11-20 10:35:13,544 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:35:13,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,547 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:13,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:35:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 10:35:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 59 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:35:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-20 10:35:13,580 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 16 [2022-11-20 10:35:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:13,580 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-20 10:35:13,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-20 10:35:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-20 10:35:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:35:13,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:13,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:13,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:35:13,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-11-20 10:35:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:13,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099832327] [2022-11-20 10:35:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099832327] [2022-11-20 10:35:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099832327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:13,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:13,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536727631] [2022-11-20 10:35:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,695 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-20 10:35:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:13,717 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-11-20 10:35:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-11-20 10:35:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:13,719 INFO L225 Difference]: With dead ends: 114 [2022-11-20 10:35:13,720 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:35:13,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,722 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:13,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:35:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 10:35:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 58 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:35:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-11-20 10:35:13,734 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 20 [2022-11-20 10:35:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:13,734 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-11-20 10:35:13,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-20 10:35:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-11-20 10:35:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:35:13,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:13,737 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] [2022-11-20 10:35:13,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:35:13,738 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-20 10:35:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 433245301, now seen corresponding path program 1 times [2022-11-20 10:35:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735016309] [2022-11-20 10:35:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:35:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,807 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-20 10:35:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735016309] [2022-11-20 10:35:13,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735016309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:13,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:13,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358328477] [2022-11-20 10:35:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:13,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:13,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:13,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:13,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,811 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-20 10:35:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:13,830 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-11-20 10:35:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 24 [2022-11-20 10:35:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:13,832 INFO L225 Difference]: With dead ends: 114 [2022-11-20 10:35:13,832 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 10:35:13,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,835 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:13,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 10:35:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-20 10:35:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 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-20 10:35:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-20 10:35:13,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2022-11-20 10:35:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:13,845 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-20 10:35:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-20 10:35:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-20 10:35:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:35:13,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:13,847 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] [2022-11-20 10:35:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:35:13,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 406206194, now seen corresponding path program 1 times [2022-11-20 10:35:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174366836] [2022-11-20 10:35:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:13,933 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-20 10:35:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174366836] [2022-11-20 10:35:13,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174366836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:13,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:13,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8294162] [2022-11-20 10:35:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:13,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,938 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-20 10:35:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:13,972 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-11-20 10:35:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 27 [2022-11-20 10:35:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:13,976 INFO L225 Difference]: With dead ends: 135 [2022-11-20 10:35:13,976 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:35:13,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:13,978 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:13,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:35:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-11-20 10:35:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 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-20 10:35:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-20 10:35:13,990 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 27 [2022-11-20 10:35:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:13,991 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-20 10:35:13,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-20 10:35:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-20 10:35:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 10:35:13,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:13,993 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] [2022-11-20 10:35:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:35:13,994 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1422376419, now seen corresponding path program 1 times [2022-11-20 10:35:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690959078] [2022-11-20 10:35:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,051 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-20 10:35:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690959078] [2022-11-20 10:35:14,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690959078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240007516] [2022-11-20 10:35:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,055 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 10:35:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,066 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-11-20 10:35:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2022-11-20 10:35:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,068 INFO L225 Difference]: With dead ends: 103 [2022-11-20 10:35:14,068 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 10:35:14,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,070 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:14,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 10:35:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-20 10:35:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:35:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-20 10:35:14,079 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 28 [2022-11-20 10:35:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,079 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-20 10:35:14,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 10:35:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-20 10:35:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:35:14,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,081 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, 1, 1, 1, 1] [2022-11-20 10:35:14,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:35:14,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 91290941, now seen corresponding path program 1 times [2022-11-20 10:35:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617348280] [2022-11-20 10:35:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,138 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-20 10:35:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617348280] [2022-11-20 10:35:14,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617348280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239383978] [2022-11-20 10:35:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,142 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-20 10:35:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,153 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-11-20 10:35:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 33 [2022-11-20 10:35:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,156 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:35:14,156 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 10:35:14,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,158 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:14,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 10:35:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-20 10:35:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.275) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:35:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-11-20 10:35:14,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2022-11-20 10:35:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,166 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-11-20 10:35:14,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-20 10:35:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-11-20 10:35:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 10:35:14,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:35:14,169 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-20 10:35:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1997145350, now seen corresponding path program 1 times [2022-11-20 10:35:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712970859] [2022-11-20 10:35:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:14,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712970859] [2022-11-20 10:35:14,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712970859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954687254] [2022-11-20 10:35:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,246 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,271 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-11-20 10:35:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-20 10:35:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,274 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:35:14,274 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:35:14,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,276 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 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-20 10:35:14,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:35:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-11-20 10:35:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 51 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:35:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-11-20 10:35:14,290 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 39 [2022-11-20 10:35:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,291 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-11-20 10:35:14,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-11-20 10:35:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 10:35:14,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:35:14,293 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1995298308, now seen corresponding path program 1 times [2022-11-20 10:35:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324301617] [2022-11-20 10:35:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324301617] [2022-11-20 10:35:14,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324301617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949190919] [2022-11-20 10:35:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,390 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,401 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-11-20 10:35:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-20 10:35:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,420 INFO L225 Difference]: With dead ends: 86 [2022-11-20 10:35:14,420 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 10:35:14,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,422 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:14,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 10:35:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-20 10:35:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:35:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-11-20 10:35:14,430 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 39 [2022-11-20 10:35:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,430 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-11-20 10:35:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-11-20 10:35:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:35:14,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:35:14,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1781963547, now seen corresponding path program 1 times [2022-11-20 10:35:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971026908] [2022-11-20 10:35:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971026908] [2022-11-20 10:35:14,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971026908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271304455] [2022-11-20 10:35:14,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,504 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,532 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-11-20 10:35:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-20 10:35:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,534 INFO L225 Difference]: With dead ends: 57 [2022-11-20 10:35:14,535 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 10:35:14,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,536 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 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-20 10:35:14,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 10:35:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-20 10:35:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:35:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-11-20 10:35:14,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 40 [2022-11-20 10:35:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,563 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-11-20 10:35:14,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-11-20 10:35:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 10:35:14,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:35:14,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1519209323, now seen corresponding path program 1 times [2022-11-20 10:35:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667578603] [2022-11-20 10:35:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:35:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:35:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667578603] [2022-11-20 10:35:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667578603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493367595] [2022-11-20 10:35:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,672 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:35:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,690 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-11-20 10:35:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-20 10:35:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,693 INFO L225 Difference]: With dead ends: 79 [2022-11-20 10:35:14,693 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:35:14,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,697 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 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-20 10:35:14,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:35:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 10:35:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:35:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-20 10:35:14,717 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-11-20 10:35:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,717 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-20 10:35:14,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:35:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-20 10:35:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 10:35:14,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:35:14,719 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1151157231, now seen corresponding path program 1 times [2022-11-20 10:35:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801644597] [2022-11-20 10:35:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801644597] [2022-11-20 10:35:14,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801644597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494339062] [2022-11-20 10:35:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,790 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,800 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-20 10:35:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-11-20 10:35:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,802 INFO L225 Difference]: With dead ends: 66 [2022-11-20 10:35:14,802 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 10:35:14,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,803 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:14,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 10:35:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-20 10:35:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:35:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-20 10:35:14,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-11-20 10:35:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,820 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-20 10:35:14,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:35:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-20 10:35:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:35:14,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:35:14,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1850334672, now seen corresponding path program 1 times [2022-11-20 10:35:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:14,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908041001] [2022-11-20 10:35:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:35:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:14,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908041001] [2022-11-20 10:35:14,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908041001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081326464] [2022-11-20 10:35:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:14,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:14,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:14,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:14,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,961 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:14,978 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-20 10:35:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-20 10:35:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:14,980 INFO L225 Difference]: With dead ends: 54 [2022-11-20 10:35:14,980 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 10:35:14,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:14,981 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:14,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 10:35:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-20 10:35:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:35:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-20 10:35:14,994 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 51 [2022-11-20 10:35:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:14,995 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-20 10:35:14,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-20 10:35:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:35:14,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:14,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:14,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:35:14,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1525799786, now seen corresponding path program 1 times [2022-11-20 10:35:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845141667] [2022-11-20 10:35:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:35:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:15,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845141667] [2022-11-20 10:35:15,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845141667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:15,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:15,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846324358] [2022-11-20 10:35:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:15,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:15,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:15,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:15,089 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:15,099 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-11-20 10:35:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-20 10:35:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:15,102 INFO L225 Difference]: With dead ends: 52 [2022-11-20 10:35:15,102 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 10:35:15,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:15,103 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:15,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 10:35:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 10:35:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:35:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-20 10:35:15,120 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 52 [2022-11-20 10:35:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:15,120 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-20 10:35:15,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-20 10:35:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:35:15,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:15,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:15,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:35:15,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:35:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1470480846, now seen corresponding path program 1 times [2022-11-20 10:35:15,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778082864] [2022-11-20 10:35:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:35:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:35:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:35:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:35:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:35:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:15,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778082864] [2022-11-20 10:35:15,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778082864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:15,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:15,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116504778] [2022-11-20 10:35:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:15,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:15,201 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:15,204 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-11-20 10:35:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-20 10:35:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:15,204 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:35:15,204 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:35:15,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:15,206 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:15,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:35:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:35:15,207 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-20 10:35:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:35:15,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-20 10:35:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:15,207 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:35:15,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:35:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:35:15,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:35:15,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-20 10:35:15,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-20 10:35:15,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-20 10:35:15,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-20 10:35:15,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-20 10:35:15,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-20 10:35:15,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-20 10:35:15,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-20 10:35:15,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:35:15,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:35:15,319 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-20 10:35:15,319 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 10:35:15,319 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-20 10:35:15,319 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 10:35:15,320 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 10:35:15,320 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-20 10:35:15,320 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 10:35:15,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-20 10:35:15,320 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-20 10:35:15,320 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-20 10:35:15,321 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-20 10:35:15,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:35:15,322 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-20 10:35:15,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:35:15,322 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-20 10:35:15,322 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-20 10:35:15,322 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-11-20 10:35:15,322 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-11-20 10:35:15,323 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-11-20 10:35:15,323 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-11-20 10:35:15,323 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-20 10:35:15,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-20 10:35:15,323 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-20 10:35:15,323 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-11-20 10:35:15,324 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-11-20 10:35:15,324 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-11-20 10:35:15,324 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-20 10:35:15,324 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-11-20 10:35:15,324 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-20 10:35:15,324 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-20 10:35:15,324 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-11-20 10:35:15,325 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-20 10:35:15,325 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-11-20 10:35:15,325 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-20 10:35:15,325 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-20 10:35:15,325 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-20 10:35:15,325 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-11-20 10:35:15,325 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-11-20 10:35:15,326 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-20 10:35:15,326 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-11-20 10:35:15,326 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-11-20 10:35:15,326 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-11-20 10:35:15,326 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-20 10:35:15,326 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2022-11-20 10:35:15,326 INFO L902 garLoopResultBuilder]: At program point L1683(lines 1677 1684) the Hoare annotation is: true [2022-11-20 10:35:15,327 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-20 10:35:15,327 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-20 10:35:15,327 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-11-20 10:35:15,327 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:35:15,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-20 10:35:15,327 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-11-20 10:35:15,328 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-11-20 10:35:15,328 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-11-20 10:35:15,328 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-20 10:35:15,328 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-20 10:35:15,328 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-11-20 10:35:15,328 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-11-20 10:35:15,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:35:15,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-20 10:35:15,329 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-20 10:35:15,329 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-11-20 10:35:15,329 INFO L895 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch94#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-11-20 10:35:15,329 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-11-20 10:35:15,330 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2022-11-20 10:35:15,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-20 10:35:15,330 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-20 10:35:15,330 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-11-20 10:35:15,330 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-20 10:35:15,330 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-11-20 10:35:15,331 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and |ULTIMATE.start_goodG2B1_#t~switch96#1| (<= .cse0 0) (<= 0 .cse0))) [2022-11-20 10:35:15,331 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-20 10:35:15,331 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-11-20 10:35:15,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-20 10:35:15,331 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-11-20 10:35:15,331 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-11-20 10:35:15,331 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-11-20 10:35:15,335 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:15,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:35:15,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:35:15 BoogieIcfgContainer [2022-11-20 10:35:15,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:35:15,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:35:15,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:35:15,358 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:35:15,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:12" (3/4) ... [2022-11-20 10:35:15,362 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:35:15,369 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-20 10:35:15,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-20 10:35:15,375 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 10:35:15,376 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-20 10:35:15,376 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:35:15,377 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:35:15,377 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:35:15,454 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:35:15,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:35:15,455 INFO L158 Benchmark]: Toolchain (without parser) took 4984.34ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 120.7MB in the beginning and 166.0MB in the end (delta: -45.3MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,456 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:15,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1391.35ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 119.9MB in the end (delta: 770.7kB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.10ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 116.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,457 INFO L158 Benchmark]: Boogie Preprocessor took 46.25ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:15,457 INFO L158 Benchmark]: RCFGBuilder took 638.90ms. Allocated memory is still 161.5MB. Free memory was 115.3MB in the beginning and 98.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,458 INFO L158 Benchmark]: TraceAbstraction took 2741.33ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 98.5MB in the beginning and 68.6MB in the end (delta: 29.9MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,458 INFO L158 Benchmark]: Witness Printer took 97.40ms. Allocated memory is still 199.2MB. Free memory was 68.6MB in the beginning and 166.0MB in the end (delta: -97.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:15,460 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.27ms. Allocated memory is still 102.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1391.35ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 119.9MB in the end (delta: 770.7kB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.10ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 116.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.25ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 638.90ms. Allocated memory is still 161.5MB. Free memory was 115.3MB in the beginning and 98.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2741.33ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 98.5MB in the beginning and 68.6MB in the end (delta: 29.9MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. * Witness Printer took 97.40ms. Allocated memory is still 199.2MB. Free memory was 68.6MB in the beginning and 166.0MB in the end (delta: -97.4MB). Peak memory consumption was 2.1MB. 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: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 1953 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 918 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1035 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 15 MinimizatonAttempts, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 105 PreInvPairs, 125 NumberOfFragments, 77 HoareAnnotationTreeSize, 105 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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: 1595]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1629]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: if(data < 0) { int result = data * 2; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= 2 + data - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux && 2 + data <= 0) && 0 <= 2 + data - InvariantResult [Line: 1647]: Loop Invariant Derived loop invariant: (0 <= data + 2 && data + 2 <= 0) && 0 <= 2 + data - InvariantResult [Line: 1677]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 10:35:15,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf92e48-63d7-468a-8432-d2edf5867f9b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE