./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-restricted-15/a.06.c --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_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/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_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-restricted-15/a.06.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/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_8ca89e87-d76e-4338-99b9-c373c37b860e/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 90244b6c2e1b1f029f80e9cfc86fb57c09347d52a85284d5d619fffbbf31f641 --- 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 11:31:28,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:31:28,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:31:28,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:31:28,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:31:28,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:31:28,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:31:28,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:31:28,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:31:28,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:31:28,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:31:28,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:31:28,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:31:28,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:31:28,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:31:28,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:31:28,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:31:28,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:31:28,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:31:28,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:31:28,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:31:28,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:31:28,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:31:28,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:31:28,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:31:28,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:31:28,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:31:28,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:31:28,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:31:28,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:31:28,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:31:28,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:31:28,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:31:28,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:31:28,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:31:28,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:31:28,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:31:28,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:31:28,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:31:28,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:31:28,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:31:28,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 11:31:28,504 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:31:28,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:31:28,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:31:28,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:31:28,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:31:28,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:31:28,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:31:28,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:31:28,509 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:31:28,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:31:28,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:31:28,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:31:28,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:31:28,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:31:28,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:31:28,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:31:28,512 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 11:31:28,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:31:28,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:31:28,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:31:28,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:31:28,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:31:28,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:31:28,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:31:28,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:31:28,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:31:28,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:31:28,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:31:28,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:31:28,516 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:31:28,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:31:28,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:31:28,517 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_8ca89e87-d76e-4338-99b9-c373c37b860e/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_8ca89e87-d76e-4338-99b9-c373c37b860e/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 -> 90244b6c2e1b1f029f80e9cfc86fb57c09347d52a85284d5d619fffbbf31f641 [2022-11-20 11:31:28,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:31:28,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:31:28,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:31:28,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:31:28,913 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:31:28,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-restricted-15/a.06.c [2022-11-20 11:31:32,010 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:31:32,219 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:31:32,220 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/sv-benchmarks/c/termination-restricted-15/a.06.c [2022-11-20 11:31:32,225 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/data/1ab79947a/9198ae0572fa485d89790d7eb69cc82a/FLAG7862ca1b5 [2022-11-20 11:31:32,240 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/data/1ab79947a/9198ae0572fa485d89790d7eb69cc82a [2022-11-20 11:31:32,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:31:32,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:31:32,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:31:32,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:31:32,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:31:32,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384025c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32, skipping insertion in model container [2022-11-20 11:31:32,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:31:32,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:31:32,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:31:32,425 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:31:32,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:31:32,451 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:31:32,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32 WrapperNode [2022-11-20 11:31:32,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:31:32,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:31:32,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:31:32,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:31:32,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,486 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-20 11:31:32,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:31:32,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:31:32,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:31:32,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:31:32,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:31:32,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:31:32,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:31:32,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:31:32,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (1/1) ... [2022-11-20 11:31:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:31:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:31:32,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:31:32,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:31:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:31:32,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:31:32,664 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:31:32,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:31:32,892 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:31:32,899 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:31:32,900 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:31:32,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:32 BoogieIcfgContainer [2022-11-20 11:31:32,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:31:32,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:31:32,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:31:32,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:31:32,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:31:32" (1/3) ... [2022-11-20 11:31:32,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef44902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:32, skipping insertion in model container [2022-11-20 11:31:32,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:32" (2/3) ... [2022-11-20 11:31:32,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef44902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:32, skipping insertion in model container [2022-11-20 11:31:32,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:32" (3/3) ... [2022-11-20 11:31:32,917 INFO L112 eAbstractionObserver]: Analyzing ICFG a.06.c [2022-11-20 11:31:32,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:31:32,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-20 11:31:33,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:31:33,062 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;@d03e79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:31:33,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-20 11:31:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 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 11:31:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:31:33,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:33,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:31:33,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 28695781, now seen corresponding path program 1 times [2022-11-20 11:31:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358334047] [2022-11-20 11:31:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:33,396 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 11:31:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:33,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358334047] [2022-11-20 11:31:33,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358334047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:33,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:33,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:31:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740464515] [2022-11-20 11:31:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:31:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:31:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:33,468 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 11:31:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:33,629 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-20 11:31:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:31:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 11:31:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:33,644 INFO L225 Difference]: With dead ends: 66 [2022-11-20 11:31:33,644 INFO L226 Difference]: Without dead ends: 51 [2022-11-20 11:31:33,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:33,653 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:33,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 53 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-20 11:31:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-11-20 11:31:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.605263157894737) internal successors, (61), 46 states have internal predecessors, (61), 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 11:31:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-11-20 11:31:33,702 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 5 [2022-11-20 11:31:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:33,703 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-11-20 11:31:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 11:31:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-11-20 11:31:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:31:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:33,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:31:33,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:31:33,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 889569255, now seen corresponding path program 1 times [2022-11-20 11:31:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:33,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544425779] [2022-11-20 11:31:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:33,751 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 11:31:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:33,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544425779] [2022-11-20 11:31:33,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544425779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:33,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:33,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:31:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261686254] [2022-11-20 11:31:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:31:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:31:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:33,758 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 11:31:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:33,819 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-11-20 11:31:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:31:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 11:31:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:33,821 INFO L225 Difference]: With dead ends: 77 [2022-11-20 11:31:33,822 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 11:31:33,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:33,824 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:33,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 11:31:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-11-20 11:31:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 60 states have internal predecessors, (81), 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 11:31:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-20 11:31:33,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 6 [2022-11-20 11:31:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:33,834 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-20 11:31:33,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 11:31:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-20 11:31:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:31:33,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:33,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:31:33,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 183292466, now seen corresponding path program 1 times [2022-11-20 11:31:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997689620] [2022-11-20 11:31:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:33,884 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 11:31:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:33,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997689620] [2022-11-20 11:31:33,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997689620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:33,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:33,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:31:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225303199] [2022-11-20 11:31:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:31:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:31:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:33,888 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:31:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:33,949 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-11-20 11:31:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:31:33,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 11:31:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:33,953 INFO L225 Difference]: With dead ends: 61 [2022-11-20 11:31:33,954 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 11:31:33,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:33,957 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:33,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 11:31:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2022-11-20 11:31:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 36 states have internal predecessors, (44), 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 11:31:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-20 11:31:33,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 8 [2022-11-20 11:31:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:33,990 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-20 11:31:33,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:31:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-20 11:31:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:31:33,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:33,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:33,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:31:33,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1387049590, now seen corresponding path program 1 times [2022-11-20 11:31:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:33,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87659750] [2022-11-20 11:31:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,084 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 11:31:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87659750] [2022-11-20 11:31:34,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87659750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:31:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840772078] [2022-11-20 11:31:34,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:31:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:31:34,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:34,088 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11:31:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,119 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-11-20 11:31:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:31:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 11:31:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,120 INFO L225 Difference]: With dead ends: 82 [2022-11-20 11:31:34,121 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 11:31:34,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,122 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:34,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 11:31:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2022-11-20 11:31:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.411764705882353) internal successors, (48), 40 states have internal predecessors, (48), 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 11:31:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-11-20 11:31:34,129 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 9 [2022-11-20 11:31:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,130 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-11-20 11:31:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11:31:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-11-20 11:31:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:31:34,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:31:34,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1568206898, now seen corresponding path program 1 times [2022-11-20 11:31:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719356518] [2022-11-20 11:31:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,242 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 11:31:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719356518] [2022-11-20 11:31:34,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719356518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:31:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186735524] [2022-11-20 11:31:34,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:31:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:31:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,248 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11:31:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,328 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-11-20 11:31:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:31:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:31:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,329 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:31:34,330 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 11:31:34,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:31:34,331 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:34,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 11:31:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-20 11:31:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 48 states have internal predecessors, (59), 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 11:31:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-11-20 11:31:34,338 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 11 [2022-11-20 11:31:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,338 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-11-20 11:31:34,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11:31:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-11-20 11:31:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:31:34,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:31:34,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1599754246, now seen corresponding path program 1 times [2022-11-20 11:31:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189989178] [2022-11-20 11:31:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,422 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 11:31:34,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189989178] [2022-11-20 11:31:34,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189989178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:31:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689737100] [2022-11-20 11:31:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:31:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:31:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,426 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11:31:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,514 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-11-20 11:31:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:31:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:31:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,516 INFO L225 Difference]: With dead ends: 58 [2022-11-20 11:31:34,516 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 11:31:34,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:31:34,518 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:34,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 33 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 11:31:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-11-20 11:31:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.4) internal successors, (63), 51 states have internal predecessors, (63), 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 11:31:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-11-20 11:31:34,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2022-11-20 11:31:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,525 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-11-20 11:31:34,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11:31:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-11-20 11:31:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:31:34,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:31:34,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1947225999, now seen corresponding path program 1 times [2022-11-20 11:31:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167423884] [2022-11-20 11:31:34,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,570 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 11:31:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167423884] [2022-11-20 11:31:34,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167423884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:31:34,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300937108] [2022-11-20 11:31:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:31:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:31:34,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:34,573 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 11:31:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,640 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-11-20 11:31:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:31:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:31:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,642 INFO L225 Difference]: With dead ends: 72 [2022-11-20 11:31:34,642 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 11:31:34,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,643 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:34,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 11:31:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-11-20 11:31:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 67 states have internal predecessors, (82), 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 11:31:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-11-20 11:31:34,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 12 [2022-11-20 11:31:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,652 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2022-11-20 11:31:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 11:31:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2022-11-20 11:31:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:31:34,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:31:34,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1947232085, now seen corresponding path program 1 times [2022-11-20 11:31:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738458062] [2022-11-20 11:31:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:31:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738458062] [2022-11-20 11:31:34,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738458062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:31:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700474328] [2022-11-20 11:31:34,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:31:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:31:34,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:34,700 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 11:31:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,710 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-11-20 11:31:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:31:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:31:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,715 INFO L225 Difference]: With dead ends: 121 [2022-11-20 11:31:34,715 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:31:34,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:34,716 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 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 11:31:34,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:31:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-20 11:31:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 60 states have internal predecessors, (69), 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 11:31:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-11-20 11:31:34,722 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 12 [2022-11-20 11:31:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,722 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-11-20 11:31:34,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 11:31:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-11-20 11:31:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:31:34,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:31:34,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1694214290, now seen corresponding path program 1 times [2022-11-20 11:31:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157434157] [2022-11-20 11:31:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,820 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 11:31:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157434157] [2022-11-20 11:31:34,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157434157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:31:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094014819] [2022-11-20 11:31:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:31:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:31:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,823 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,907 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-11-20 11:31:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:31:34,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:31:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,909 INFO L225 Difference]: With dead ends: 75 [2022-11-20 11:31:34,909 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 11:31:34,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:31:34,910 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:34,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 11:31:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2022-11-20 11:31:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-20 11:31:34,916 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 13 [2022-11-20 11:31:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:34,917 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-20 11:31:34,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-20 11:31:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:31:34,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:34,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:34,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:31:34,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 287874230, now seen corresponding path program 1 times [2022-11-20 11:31:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509598056] [2022-11-20 11:31:34,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:34,957 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 11:31:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:34,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509598056] [2022-11-20 11:31:34,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509598056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:34,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:34,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:31:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239036084] [2022-11-20 11:31:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:34,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:31:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:34,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:31:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:34,960 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:34,998 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-11-20 11:31:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:31:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:31:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:34,999 INFO L225 Difference]: With dead ends: 103 [2022-11-20 11:31:34,999 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:31:35,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:31:35,001 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:31:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-20 11:31:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2) internal successors, (66), 60 states have internal predecessors, (66), 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 11:31:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-20 11:31:35,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 13 [2022-11-20 11:31:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-20 11:31:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-20 11:31:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:31:35,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:31:35,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash -981035365, now seen corresponding path program 1 times [2022-11-20 11:31:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561419920] [2022-11-20 11:31:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,088 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 11:31:35,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561419920] [2022-11-20 11:31:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561419920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:31:35,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914708521] [2022-11-20 11:31:35,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:31:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:31:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:31:35,091 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 11:31:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,233 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-20 11:31:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:31:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:31:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,235 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:31:35,235 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 11:31:35,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:31:35,236 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 56 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 11:31:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2022-11-20 11:31:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-20 11:31:35,242 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 14 [2022-11-20 11:31:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,242 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-20 11:31:35,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 11:31:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-20 11:31:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:31:35,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:31:35,245 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1321553423, now seen corresponding path program 1 times [2022-11-20 11:31:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478020845] [2022-11-20 11:31:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,288 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 11:31:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478020845] [2022-11-20 11:31:35,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478020845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:31:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800598428] [2022-11-20 11:31:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:31:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:31:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:35,290 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 11:31:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,315 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-11-20 11:31:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:31:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:31:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,316 INFO L225 Difference]: With dead ends: 59 [2022-11-20 11:31:35,316 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 11:31:35,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:35,318 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 11:31:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-20 11:31:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-20 11:31:35,323 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 14 [2022-11-20 11:31:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,323 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-20 11:31:35,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 11:31:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-20 11:31:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:31:35,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:31:35,325 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash 561705714, now seen corresponding path program 1 times [2022-11-20 11:31:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501039189] [2022-11-20 11:31:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,384 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 11:31:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501039189] [2022-11-20 11:31:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501039189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:31:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832272303] [2022-11-20 11:31:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:31:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:31:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:35,387 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 11:31:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,459 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-20 11:31:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:31:35,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 11:31:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,460 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:31:35,460 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 11:31:35,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:31:35,462 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:31:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 11:31:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-11-20 11:31:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-20 11:31:35,472 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2022-11-20 11:31:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-20 11:31:35,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 11:31:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-20 11:31:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:31:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:31:35,474 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1297482835, now seen corresponding path program 1 times [2022-11-20 11:31:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488770531] [2022-11-20 11:31:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,502 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 11:31:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488770531] [2022-11-20 11:31:35,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488770531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:31:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111443339] [2022-11-20 11:31:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:31:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:31:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:35,507 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:31:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,529 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-11-20 11:31:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:31:35,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 11:31:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,530 INFO L225 Difference]: With dead ends: 50 [2022-11-20 11:31:35,531 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 11:31:35,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:31:35,532 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 11:31:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-20 11:31:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-11-20 11:31:35,551 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2022-11-20 11:31:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,551 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-11-20 11:31:35,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:31:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-11-20 11:31:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:31:35,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:31:35,553 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -26849141, now seen corresponding path program 1 times [2022-11-20 11:31:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857258327] [2022-11-20 11:31:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:31:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857258327] [2022-11-20 11:31:35,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857258327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:31:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807523064] [2022-11-20 11:31:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:31:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:31:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:35,627 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 11:31:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,654 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-20 11:31:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:31:35,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:31:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,655 INFO L225 Difference]: With dead ends: 49 [2022-11-20 11:31:35,655 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:31:35,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:31:35,658 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:31:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-20 11:31:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 11:31:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-11-20 11:31:35,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 21 [2022-11-20 11:31:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,668 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-11-20 11:31:35,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 11:31:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-11-20 11:31:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:31:35,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:35,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:31:35,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:31:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1159804246, now seen corresponding path program 1 times [2022-11-20 11:31:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245810057] [2022-11-20 11:31:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:31:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:35,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245810057] [2022-11-20 11:31:35,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245810057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:31:35,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:31:35,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:31:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690521817] [2022-11-20 11:31:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:31:35,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:31:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:35,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:31:35,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:31:35,758 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 11:31:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:35,812 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-20 11:31:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:31:35,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:31:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:35,813 INFO L225 Difference]: With dead ends: 31 [2022-11-20 11:31:35,813 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:31:35,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:31:35,814 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:35,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:31:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:31:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:31:35,815 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 11:31:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:31:35,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-11-20 11:31:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:35,816 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:31:35,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 11:31:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:31:35,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:31:35,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-20 11:31:35,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-20 11:31:35,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-20 11:31:35,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-20 11:31:35,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-20 11:31:35,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-20 11:31:35,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-20 11:31:35,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-20 11:31:35,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-20 11:31:35,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-20 11:31:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:31:35,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:31:35,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L902 garLoopResultBuilder]: At program point L16(lines 5 17) the Hoare annotation is: true [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,918 INFO L899 garLoopResultBuilder]: For program point L12-5(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point L12-6(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point L12-8(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point L12-9(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point L12-10(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:31:35,919 INFO L899 garLoopResultBuilder]: For program point L12-12(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point L12-13(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point L12-14(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point L12-15(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point L12-16(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L899 garLoopResultBuilder]: For program point L12-18(lines 12 15) no Hoare annotation was computed. [2022-11-20 11:31:35,920 INFO L895 garLoopResultBuilder]: At program point L12-20(lines 12 15) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_main_~z~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 2147483647))) (or (and .cse0 (not (<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)) .cse1) (and (<= |ULTIMATE.start_main_~z~0#1| 2147483647) .cse0 (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648)) .cse1))) [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point L12-21(lines 12 15) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-11-20 11:31:35,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2022-11-20 11:31:35,925 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:31:35,927 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:31:35,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:31:35 BoogieIcfgContainer [2022-11-20 11:31:35,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:31:35,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:31:35,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:31:35,944 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:31:35,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:32" (3/4) ... [2022-11-20 11:31:35,950 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:31:35,964 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 11:31:35,964 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 11:31:35,964 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:31:36,001 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:31:36,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:31:36,002 INFO L158 Benchmark]: Toolchain (without parser) took 3757.86ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 112.8MB in the beginning and 103.1MB in the end (delta: 9.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,002 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:31:36,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.87ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 103.0MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 101.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:31:36,003 INFO L158 Benchmark]: Boogie Preprocessor took 21.18ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,003 INFO L158 Benchmark]: RCFGBuilder took 398.42ms. Allocated memory is still 153.1MB. Free memory was 100.4MB in the beginning and 89.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,004 INFO L158 Benchmark]: TraceAbstraction took 3032.91ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 88.9MB in the beginning and 105.2MB in the end (delta: -16.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,004 INFO L158 Benchmark]: Witness Printer took 58.01ms. Allocated memory is still 190.8MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:31:36,005 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.22ms. Allocated memory is still 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.87ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 103.0MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 101.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.18ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.42ms. Allocated memory is still 153.1MB. Free memory was 100.4MB in the beginning and 89.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3032.91ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 88.9MB in the beginning and 105.2MB in the end (delta: -16.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Witness Printer took 58.01ms. Allocated memory is still 190.8MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). 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: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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 1 procedures, 35 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 712 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 347 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 365 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 134 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 34 HoareAnnotationTreeSize, 2 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 15/15 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 10 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((0 <= z + 2147483648 && !(y + 1 <= 0)) && y <= 2147483647) || (((z <= 2147483647 && 0 <= z + 2147483648) && 0 <= y + 2147483648) && y <= 2147483647) RESULT: Ultimate proved your program to be correct! [2022-11-20 11:31:36,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ca89e87-d76e-4338-99b9-c373c37b860e/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