./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- 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-2329fc7 [2022-12-13 13:19:29,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:19:29,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:19:29,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:19:29,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:19:29,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:19:29,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:19:29,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:19:29,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:19:29,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:19:29,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:19:29,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:19:29,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:19:29,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:19:29,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:19:29,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:19:29,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:19:29,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:19:29,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:19:29,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:19:29,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:19:29,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:19:29,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:19:29,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:19:29,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:19:29,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:19:29,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:19:29,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:19:29,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:19:29,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:19:29,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:19:29,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:19:29,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:19:29,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:19:29,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:19:29,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:19:29,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:19:29,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:19:29,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:19:29,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:19:29,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:19:29,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:19:29,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:19:29,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:19:29,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:19:29,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:19:29,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:19:29,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:19:29,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:19:29,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:19:29,866 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:19:29,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:19:29,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:19:29,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:19:29,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:19:29,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:19:29,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:19:29,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:19:29,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:19:29,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:19:29,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:19:29,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:19:29,871 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:19:29,871 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/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_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-12-13 13:19:30,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:19:30,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:19:30,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:19:30,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:19:30,080 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:19:30,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 13:19:32,693 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:19:32,851 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:19:32,851 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 13:19:32,859 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/data/9c5b4cf51/3477a4e6a09943e994767d542b855114/FLAG54181fa1e [2022-12-13 13:19:32,873 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/data/9c5b4cf51/3477a4e6a09943e994767d542b855114 [2022-12-13 13:19:32,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:19:32,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:19:32,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:19:32,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:19:32,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:19:32,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:19:32" (1/1) ... [2022-12-13 13:19:32,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6908899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:32, skipping insertion in model container [2022-12-13 13:19:32,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:19:32" (1/1) ... [2022-12-13 13:19:32,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:19:32,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:19:33,092 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-12-13 13:19:33,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:19:33,121 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:19:33,154 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-12-13 13:19:33,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:19:33,182 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:19:33,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33 WrapperNode [2022-12-13 13:19:33,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:19:33,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:19:33,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:19:33,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:19:33,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,227 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-12-13 13:19:33,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:19:33,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:19:33,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:19:33,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:19:33,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,252 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:19:33,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:19:33,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:19:33,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:19:33,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (1/1) ... [2022-12-13 13:19:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:19:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:33,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:33,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:19:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:19:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:19:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:19:33,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:19:33,410 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:19:33,412 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:19:33,649 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:19:33,654 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:19:33,654 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:19:33,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:19:33 BoogieIcfgContainer [2022-12-13 13:19:33,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:19:33,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:19:33,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:19:33,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:19:33,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:19:32" (1/3) ... [2022-12-13 13:19:33,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bbe8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:19:33, skipping insertion in model container [2022-12-13 13:19:33,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:33" (2/3) ... [2022-12-13 13:19:33,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bbe8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:19:33, skipping insertion in model container [2022-12-13 13:19:33,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:19:33" (3/3) ... [2022-12-13 13:19:33,661 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 13:19:33,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:19:33,675 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-13 13:19:33,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:19:33,714 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;@13d6adb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:19:33,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-13 13:19:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 89 states have internal predecessors, (130), 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-12-13 13:19:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:19:33,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:33,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:33,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1523339456, now seen corresponding path program 1 times [2022-12-13 13:19:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:33,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001500694] [2022-12-13 13:19:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:33,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001500694] [2022-12-13 13:19:33,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001500694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:33,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:33,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:19:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152905942] [2022-12-13 13:19:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:33,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:19:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:19:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:19:33,944 INFO L87 Difference]: Start difference. First operand has 90 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 89 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:33,965 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2022-12-13 13:19:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:19:33,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 13:19:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:33,975 INFO L225 Difference]: With dead ends: 93 [2022-12-13 13:19:33,975 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 13:19:33,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:19:33,981 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:33,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 13:19:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-13 13:19:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 82 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-12-13 13:19:34,015 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 23 [2022-12-13 13:19:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:34,016 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-12-13 13:19:34,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-12-13 13:19:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:19:34,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:34,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:34,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:19:34,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1151032549, now seen corresponding path program 1 times [2022-12-13 13:19:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:34,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759846969] [2022-12-13 13:19:34,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759846969] [2022-12-13 13:19:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759846969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:34,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:34,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138235277] [2022-12-13 13:19:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:34,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:19:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:34,138 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-12-13 13:19:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:34,172 INFO L93 Difference]: Finished difference Result 203 states and 264 transitions. [2022-12-13 13:19:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2022-12-13 13:19:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:34,174 INFO L225 Difference]: With dead ends: 203 [2022-12-13 13:19:34,174 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 13:19:34,174 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-12-13 13:19:34,175 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:34,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 13:19:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2022-12-13 13:19:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 122 states have internal predecessors, (170), 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-12-13 13:19:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2022-12-13 13:19:34,196 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 34 [2022-12-13 13:19:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:34,196 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2022-12-13 13:19:34,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-12-13 13:19:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2022-12-13 13:19:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 13:19:34,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:34,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:34,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:19:34,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -576537676, now seen corresponding path program 1 times [2022-12-13 13:19:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023929728] [2022-12-13 13:19:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:34,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023929728] [2022-12-13 13:19:34,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023929728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:34,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800513048] [2022-12-13 13:19:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:34,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:19:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:34,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:34,289 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:34,328 INFO L93 Difference]: Finished difference Result 315 states and 446 transitions. [2022-12-13 13:19:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-13 13:19:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:34,330 INFO L225 Difference]: With dead ends: 315 [2022-12-13 13:19:34,330 INFO L226 Difference]: Without dead ends: 211 [2022-12-13 13:19:34,331 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-12-13 13:19:34,332 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:34,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-13 13:19:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2022-12-13 13:19:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.5628415300546448) internal successors, (286), 194 states have internal predecessors, (286), 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-12-13 13:19:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2022-12-13 13:19:34,351 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 35 [2022-12-13 13:19:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:34,351 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2022-12-13 13:19:34,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2022-12-13 13:19:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:19:34,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:34,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:34,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:19:34,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:34,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1557567312, now seen corresponding path program 1 times [2022-12-13 13:19:34,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:34,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056168037] [2022-12-13 13:19:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:34,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:34,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056168037] [2022-12-13 13:19:34,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056168037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:34,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:34,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196002057] [2022-12-13 13:19:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:34,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:34,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:34,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:34,439 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:34,542 INFO L93 Difference]: Finished difference Result 368 states and 553 transitions. [2022-12-13 13:19:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 13:19:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:34,545 INFO L225 Difference]: With dead ends: 368 [2022-12-13 13:19:34,545 INFO L226 Difference]: Without dead ends: 365 [2022-12-13 13:19:34,546 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-12-13 13:19:34,547 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:34,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-13 13:19:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2022-12-13 13:19:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.566860465116279) internal successors, (539), 355 states have internal predecessors, (539), 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-12-13 13:19:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2022-12-13 13:19:34,586 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 36 [2022-12-13 13:19:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:34,586 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2022-12-13 13:19:34,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2022-12-13 13:19:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:19:34,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:34,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:34,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:19:34,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1039946552, now seen corresponding path program 1 times [2022-12-13 13:19:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:34,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116865187] [2022-12-13 13:19:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:34,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116865187] [2022-12-13 13:19:34,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116865187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:34,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:34,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37049865] [2022-12-13 13:19:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:34,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:34,669 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-12-13 13:19:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:34,808 INFO L93 Difference]: Finished difference Result 702 states and 1055 transitions. [2022-12-13 13:19:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2022-12-13 13:19:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:34,811 INFO L225 Difference]: With dead ends: 702 [2022-12-13 13:19:34,812 INFO L226 Difference]: Without dead ends: 699 [2022-12-13 13:19:34,812 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-12-13 13:19:34,813 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 233 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:34,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 254 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-12-13 13:19:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2022-12-13 13:19:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 506 states have (on average 1.551383399209486) internal successors, (785), 517 states have internal predecessors, (785), 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-12-13 13:19:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 785 transitions. [2022-12-13 13:19:34,864 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 785 transitions. Word has length 37 [2022-12-13 13:19:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:34,865 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 785 transitions. [2022-12-13 13:19:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-12-13 13:19:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 785 transitions. [2022-12-13 13:19:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:19:34,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:34,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:34,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:19:34,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2121395118, now seen corresponding path program 1 times [2022-12-13 13:19:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:34,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711144734] [2022-12-13 13:19:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711144734] [2022-12-13 13:19:34,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711144734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:34,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:34,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475184559] [2022-12-13 13:19:34,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:34,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:34,928 INFO L87 Difference]: Start difference. First operand 518 states and 785 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-12-13 13:19:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:35,110 INFO L93 Difference]: Finished difference Result 864 states and 1315 transitions. [2022-12-13 13:19:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:19:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2022-12-13 13:19:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:35,113 INFO L225 Difference]: With dead ends: 864 [2022-12-13 13:19:35,113 INFO L226 Difference]: Without dead ends: 861 [2022-12-13 13:19:35,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:19:35,114 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 490 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:35,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 276 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-12-13 13:19:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 842. [2022-12-13 13:19:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 830 states have (on average 1.5409638554216867) internal successors, (1279), 841 states have internal predecessors, (1279), 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-12-13 13:19:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1279 transitions. [2022-12-13 13:19:35,160 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1279 transitions. Word has length 38 [2022-12-13 13:19:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:35,160 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1279 transitions. [2022-12-13 13:19:35,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-12-13 13:19:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1279 transitions. [2022-12-13 13:19:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 13:19:35,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:35,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:19:35,161 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1338739078, now seen corresponding path program 1 times [2022-12-13 13:19:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607639397] [2022-12-13 13:19:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:35,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607639397] [2022-12-13 13:19:35,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607639397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:35,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:35,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169866601] [2022-12-13 13:19:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:35,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:35,219 INFO L87 Difference]: Start difference. First operand 842 states and 1279 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:35,517 INFO L93 Difference]: Finished difference Result 2668 states and 4039 transitions. [2022-12-13 13:19:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:19:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-13 13:19:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:35,522 INFO L225 Difference]: With dead ends: 2668 [2022-12-13 13:19:35,522 INFO L226 Difference]: Without dead ends: 1837 [2022-12-13 13:19:35,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:19:35,524 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 485 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:35,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 577 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-12-13 13:19:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1325. [2022-12-13 13:19:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1313 states have (on average 1.5041888804265042) internal successors, (1975), 1324 states have internal predecessors, (1975), 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-12-13 13:19:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1975 transitions. [2022-12-13 13:19:35,597 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1975 transitions. Word has length 39 [2022-12-13 13:19:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:35,597 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1975 transitions. [2022-12-13 13:19:35,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1975 transitions. [2022-12-13 13:19:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 13:19:35,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:35,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:35,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:19:35,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1056432401, now seen corresponding path program 1 times [2022-12-13 13:19:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:35,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240283900] [2022-12-13 13:19:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:35,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240283900] [2022-12-13 13:19:35,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240283900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:35,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:35,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757731907] [2022-12-13 13:19:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:19:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:35,637 INFO L87 Difference]: Start difference. First operand 1325 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-12-13 13:19:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:35,819 INFO L93 Difference]: Finished difference Result 3585 states and 5343 transitions. [2022-12-13 13:19:35,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:35,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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) Word has length 40 [2022-12-13 13:19:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:35,828 INFO L225 Difference]: With dead ends: 3585 [2022-12-13 13:19:35,828 INFO L226 Difference]: Without dead ends: 2279 [2022-12-13 13:19:35,830 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-12-13 13:19:35,830 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:35,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-12-13 13:19:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2253. [2022-12-13 13:19:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2241 states have (on average 1.4881749219098617) internal successors, (3335), 2252 states have internal predecessors, (3335), 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-12-13 13:19:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3335 transitions. [2022-12-13 13:19:36,018 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3335 transitions. Word has length 40 [2022-12-13 13:19:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:36,019 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3335 transitions. [2022-12-13 13:19:36,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-12-13 13:19:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3335 transitions. [2022-12-13 13:19:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 13:19:36,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:36,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:19:36,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1189232762, now seen corresponding path program 1 times [2022-12-13 13:19:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084009280] [2022-12-13 13:19:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084009280] [2022-12-13 13:19:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084009280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:36,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:36,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228277430] [2022-12-13 13:19:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:36,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:19:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:36,090 INFO L87 Difference]: Start difference. First operand 2253 states and 3335 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-12-13 13:19:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:36,267 INFO L93 Difference]: Finished difference Result 5203 states and 7673 transitions. [2022-12-13 13:19:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-12-13 13:19:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:36,273 INFO L225 Difference]: With dead ends: 5203 [2022-12-13 13:19:36,273 INFO L226 Difference]: Without dead ends: 2969 [2022-12-13 13:19:36,275 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-12-13 13:19:36,275 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:36,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2022-12-13 13:19:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2923. [2022-12-13 13:19:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.467880453452422) internal successors, (4273), 2922 states have internal predecessors, (4273), 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-12-13 13:19:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4273 transitions. [2022-12-13 13:19:36,411 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4273 transitions. Word has length 62 [2022-12-13 13:19:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:36,411 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4273 transitions. [2022-12-13 13:19:36,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-12-13 13:19:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4273 transitions. [2022-12-13 13:19:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 13:19:36,412 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:36,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:36,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:19:36,412 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1441148811, now seen corresponding path program 1 times [2022-12-13 13:19:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:36,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315208097] [2022-12-13 13:19:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:36,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315208097] [2022-12-13 13:19:36,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315208097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:36,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:36,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:19:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195316675] [2022-12-13 13:19:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:36,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:36,544 INFO L87 Difference]: Start difference. First operand 2923 states and 4273 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-12-13 13:19:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:36,811 INFO L93 Difference]: Finished difference Result 5831 states and 8525 transitions. [2022-12-13 13:19:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:36,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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) Word has length 66 [2022-12-13 13:19:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:36,817 INFO L225 Difference]: With dead ends: 5831 [2022-12-13 13:19:36,817 INFO L226 Difference]: Without dead ends: 2929 [2022-12-13 13:19:36,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-13 13:19:36,820 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 145 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:36,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 217 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2022-12-13 13:19:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2923. [2022-12-13 13:19:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.456887667468224) internal successors, (4241), 2922 states have internal predecessors, (4241), 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-12-13 13:19:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4241 transitions. [2022-12-13 13:19:37,029 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4241 transitions. Word has length 66 [2022-12-13 13:19:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:37,029 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4241 transitions. [2022-12-13 13:19:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-12-13 13:19:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4241 transitions. [2022-12-13 13:19:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 13:19:37,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:37,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:19:37,030 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash -692803609, now seen corresponding path program 1 times [2022-12-13 13:19:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964265685] [2022-12-13 13:19:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:37,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:37,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964265685] [2022-12-13 13:19:37,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964265685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:37,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:37,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827489143] [2022-12-13 13:19:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:37,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:37,122 INFO L87 Difference]: Start difference. First operand 2923 states and 4241 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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-12-13 13:19:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:37,384 INFO L93 Difference]: Finished difference Result 3774 states and 5487 transitions. [2022-12-13 13:19:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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) Word has length 67 [2022-12-13 13:19:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:37,392 INFO L225 Difference]: With dead ends: 3774 [2022-12-13 13:19:37,392 INFO L226 Difference]: Without dead ends: 3769 [2022-12-13 13:19:37,393 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-12-13 13:19:37,393 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 280 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2022-12-13 13:19:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2933. [2022-12-13 13:19:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2921 states have (on average 1.4649092776446422) internal successors, (4279), 2932 states have internal predecessors, (4279), 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-12-13 13:19:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4279 transitions. [2022-12-13 13:19:37,579 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4279 transitions. Word has length 67 [2022-12-13 13:19:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:37,579 INFO L495 AbstractCegarLoop]: Abstraction has 2933 states and 4279 transitions. [2022-12-13 13:19:37,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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-12-13 13:19:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4279 transitions. [2022-12-13 13:19:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 13:19:37,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:37,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:37,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:19:37,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1013767766, now seen corresponding path program 1 times [2022-12-13 13:19:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:37,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939268895] [2022-12-13 13:19:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:37,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939268895] [2022-12-13 13:19:37,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939268895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:37,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:37,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261655499] [2022-12-13 13:19:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:37,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:37,643 INFO L87 Difference]: Start difference. First operand 2933 states and 4279 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-12-13 13:19:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:37,838 INFO L93 Difference]: Finished difference Result 2942 states and 4283 transitions. [2022-12-13 13:19:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 68 [2022-12-13 13:19:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:37,845 INFO L225 Difference]: With dead ends: 2942 [2022-12-13 13:19:37,845 INFO L226 Difference]: Without dead ends: 2939 [2022-12-13 13:19:37,846 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-12-13 13:19:37,846 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:37,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2022-12-13 13:19:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2927. [2022-12-13 13:19:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2918 states have (on average 1.447909527073338) internal successors, (4225), 2926 states have internal predecessors, (4225), 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-12-13 13:19:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4225 transitions. [2022-12-13 13:19:37,993 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4225 transitions. Word has length 68 [2022-12-13 13:19:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:37,993 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 4225 transitions. [2022-12-13 13:19:37,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-12-13 13:19:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4225 transitions. [2022-12-13 13:19:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 13:19:37,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:37,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:19:37,994 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2075261, now seen corresponding path program 1 times [2022-12-13 13:19:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036201229] [2022-12-13 13:19:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:38,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036201229] [2022-12-13 13:19:38,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036201229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:38,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:38,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:38,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326261517] [2022-12-13 13:19:38,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:38,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:38,076 INFO L87 Difference]: Start difference. First operand 2927 states and 4225 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-12-13 13:19:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:38,482 INFO L93 Difference]: Finished difference Result 8206 states and 11917 transitions. [2022-12-13 13:19:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 68 [2022-12-13 13:19:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:38,491 INFO L225 Difference]: With dead ends: 8206 [2022-12-13 13:19:38,491 INFO L226 Difference]: Without dead ends: 5300 [2022-12-13 13:19:38,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-13 13:19:38,495 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 274 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:38,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 279 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2022-12-13 13:19:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4581. [2022-12-13 13:19:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4572 states have (on average 1.4494750656167978) internal successors, (6627), 4580 states have internal predecessors, (6627), 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-12-13 13:19:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6627 transitions. [2022-12-13 13:19:38,752 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6627 transitions. Word has length 68 [2022-12-13 13:19:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:38,752 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 6627 transitions. [2022-12-13 13:19:38,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-12-13 13:19:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6627 transitions. [2022-12-13 13:19:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:19:38,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:38,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:38,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:19:38,753 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:38,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029810, now seen corresponding path program 1 times [2022-12-13 13:19:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:38,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583633128] [2022-12-13 13:19:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:38,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:38,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583633128] [2022-12-13 13:19:38,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583633128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:38,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:38,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038178201] [2022-12-13 13:19:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:38,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:38,837 INFO L87 Difference]: Start difference. First operand 4581 states and 6627 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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-12-13 13:19:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:39,163 INFO L93 Difference]: Finished difference Result 6262 states and 9107 transitions. [2022-12-13 13:19:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-12-13 13:19:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:39,176 INFO L225 Difference]: With dead ends: 6262 [2022-12-13 13:19:39,176 INFO L226 Difference]: Without dead ends: 6257 [2022-12-13 13:19:39,177 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-12-13 13:19:39,178 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 106 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:39,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 274 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2022-12-13 13:19:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6239. [2022-12-13 13:19:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6239 states, 6230 states have (on average 1.4415730337078652) internal successors, (8981), 6238 states have internal predecessors, (8981), 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-12-13 13:19:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8981 transitions. [2022-12-13 13:19:39,495 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8981 transitions. Word has length 69 [2022-12-13 13:19:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:39,495 INFO L495 AbstractCegarLoop]: Abstraction has 6239 states and 8981 transitions. [2022-12-13 13:19:39,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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-12-13 13:19:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8981 transitions. [2022-12-13 13:19:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:19:39,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:39,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:39,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:19:39,496 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1357684497, now seen corresponding path program 1 times [2022-12-13 13:19:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:39,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613970023] [2022-12-13 13:19:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:19:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:39,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613970023] [2022-12-13 13:19:39,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613970023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:39,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:39,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906893333] [2022-12-13 13:19:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:39,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:39,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:39,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:39,561 INFO L87 Difference]: Start difference. First operand 6239 states and 8981 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-12-13 13:19:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:39,973 INFO L93 Difference]: Finished difference Result 12880 states and 18481 transitions. [2022-12-13 13:19:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 69 [2022-12-13 13:19:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:39,981 INFO L225 Difference]: With dead ends: 12880 [2022-12-13 13:19:39,981 INFO L226 Difference]: Without dead ends: 6658 [2022-12-13 13:19:39,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-13 13:19:39,988 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 256 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:39,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 354 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2022-12-13 13:19:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6239. [2022-12-13 13:19:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6239 states, 6230 states have (on average 1.434510433386838) internal successors, (8937), 6238 states have internal predecessors, (8937), 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-12-13 13:19:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8937 transitions. [2022-12-13 13:19:40,367 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8937 transitions. Word has length 69 [2022-12-13 13:19:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:40,368 INFO L495 AbstractCegarLoop]: Abstraction has 6239 states and 8937 transitions. [2022-12-13 13:19:40,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-12-13 13:19:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8937 transitions. [2022-12-13 13:19:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:19:40,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:40,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:19:40,369 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash -64332951, now seen corresponding path program 1 times [2022-12-13 13:19:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376251367] [2022-12-13 13:19:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376251367] [2022-12-13 13:19:40,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376251367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:40,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:40,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155977646] [2022-12-13 13:19:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:40,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:40,436 INFO L87 Difference]: Start difference. First operand 6239 states and 8937 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-12-13 13:19:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:40,922 INFO L93 Difference]: Finished difference Result 10810 states and 15539 transitions. [2022-12-13 13:19:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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) Word has length 69 [2022-12-13 13:19:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:40,932 INFO L225 Difference]: With dead ends: 10810 [2022-12-13 13:19:40,932 INFO L226 Difference]: Without dead ends: 7066 [2022-12-13 13:19:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-13 13:19:40,935 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 251 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 383 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2022-12-13 13:19:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 7059. [2022-12-13 13:19:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7059 states, 7050 states have (on average 1.4180141843971632) internal successors, (9997), 7058 states have internal predecessors, (9997), 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-12-13 13:19:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 9997 transitions. [2022-12-13 13:19:41,296 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 9997 transitions. Word has length 69 [2022-12-13 13:19:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:41,296 INFO L495 AbstractCegarLoop]: Abstraction has 7059 states and 9997 transitions. [2022-12-13 13:19:41,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-12-13 13:19:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 9997 transitions. [2022-12-13 13:19:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 13:19:41,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:41,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:41,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:19:41,297 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -726748712, now seen corresponding path program 1 times [2022-12-13 13:19:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:41,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646634325] [2022-12-13 13:19:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:41,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646634325] [2022-12-13 13:19:41,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646634325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:41,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:41,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445063118] [2022-12-13 13:19:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:41,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:41,357 INFO L87 Difference]: Start difference. First operand 7059 states and 9997 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-12-13 13:19:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:42,002 INFO L93 Difference]: Finished difference Result 13320 states and 19251 transitions. [2022-12-13 13:19:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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) Word has length 70 [2022-12-13 13:19:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:42,018 INFO L225 Difference]: With dead ends: 13320 [2022-12-13 13:19:42,018 INFO L226 Difference]: Without dead ends: 8330 [2022-12-13 13:19:42,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-13 13:19:42,024 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 276 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:42,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 279 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2022-12-13 13:19:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6913. [2022-12-13 13:19:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6904 states have (on average 1.4216396292004636) internal successors, (9815), 6912 states have internal predecessors, (9815), 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-12-13 13:19:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 9815 transitions. [2022-12-13 13:19:42,417 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 9815 transitions. Word has length 70 [2022-12-13 13:19:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:42,417 INFO L495 AbstractCegarLoop]: Abstraction has 6913 states and 9815 transitions. [2022-12-13 13:19:42,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-12-13 13:19:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 9815 transitions. [2022-12-13 13:19:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 13:19:42,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:42,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:42,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:19:42,418 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1054373452, now seen corresponding path program 1 times [2022-12-13 13:19:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363507637] [2022-12-13 13:19:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363507637] [2022-12-13 13:19:42,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363507637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:42,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:42,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593634697] [2022-12-13 13:19:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:42,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:42,478 INFO L87 Difference]: Start difference. First operand 6913 states and 9815 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-12-13 13:19:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:42,963 INFO L93 Difference]: Finished difference Result 11636 states and 16733 transitions. [2022-12-13 13:19:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 71 [2022-12-13 13:19:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:42,973 INFO L225 Difference]: With dead ends: 11636 [2022-12-13 13:19:42,973 INFO L226 Difference]: Without dead ends: 7196 [2022-12-13 13:19:42,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-13 13:19:42,978 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 243 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:42,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 381 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-12-13 13:19:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7189. [2022-12-13 13:19:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7189 states, 7180 states have (on average 1.4171309192200556) internal successors, (10175), 7188 states have internal predecessors, (10175), 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-12-13 13:19:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 10175 transitions. [2022-12-13 13:19:43,385 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 10175 transitions. Word has length 71 [2022-12-13 13:19:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:43,385 INFO L495 AbstractCegarLoop]: Abstraction has 7189 states and 10175 transitions. [2022-12-13 13:19:43,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-12-13 13:19:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 10175 transitions. [2022-12-13 13:19:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 13:19:43,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:43,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:43,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:19:43,386 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash 816276294, now seen corresponding path program 1 times [2022-12-13 13:19:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:43,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699576062] [2022-12-13 13:19:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:43,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:43,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699576062] [2022-12-13 13:19:43,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699576062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:43,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:43,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722578701] [2022-12-13 13:19:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:43,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:43,433 INFO L87 Difference]: Start difference. First operand 7189 states and 10175 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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-12-13 13:19:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:44,167 INFO L93 Difference]: Finished difference Result 9422 states and 13471 transitions. [2022-12-13 13:19:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2022-12-13 13:19:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:44,177 INFO L225 Difference]: With dead ends: 9422 [2022-12-13 13:19:44,177 INFO L226 Difference]: Without dead ends: 9417 [2022-12-13 13:19:44,179 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-12-13 13:19:44,180 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 147 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:44,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 409 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2022-12-13 13:19:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8847. [2022-12-13 13:19:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8847 states, 8838 states have (on average 1.4049558723693143) internal successors, (12417), 8846 states have internal predecessors, (12417), 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-12-13 13:19:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 12417 transitions. [2022-12-13 13:19:44,903 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 12417 transitions. Word has length 71 [2022-12-13 13:19:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:44,904 INFO L495 AbstractCegarLoop]: Abstraction has 8847 states and 12417 transitions. [2022-12-13 13:19:44,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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-12-13 13:19:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 12417 transitions. [2022-12-13 13:19:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 13:19:44,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:44,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:44,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:19:44,905 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash -589694717, now seen corresponding path program 1 times [2022-12-13 13:19:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:44,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946202076] [2022-12-13 13:19:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:44,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946202076] [2022-12-13 13:19:44,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946202076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:44,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:44,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286699060] [2022-12-13 13:19:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:44,998 INFO L87 Difference]: Start difference. First operand 8847 states and 12417 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:45,821 INFO L93 Difference]: Finished difference Result 9269 states and 12997 transitions. [2022-12-13 13:19:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-12-13 13:19:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:45,830 INFO L225 Difference]: With dead ends: 9269 [2022-12-13 13:19:45,830 INFO L226 Difference]: Without dead ends: 9262 [2022-12-13 13:19:45,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:45,832 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 180 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:45,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 423 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2022-12-13 13:19:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 9255. [2022-12-13 13:19:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9255 states, 9246 states have (on average 1.3979017953709711) internal successors, (12925), 9254 states have internal predecessors, (12925), 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-12-13 13:19:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 12925 transitions. [2022-12-13 13:19:46,392 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 12925 transitions. Word has length 71 [2022-12-13 13:19:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:46,392 INFO L495 AbstractCegarLoop]: Abstraction has 9255 states and 12925 transitions. [2022-12-13 13:19:46,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 12925 transitions. [2022-12-13 13:19:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 13:19:46,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:46,393 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:46,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:19:46,393 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -465238524, now seen corresponding path program 1 times [2022-12-13 13:19:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:46,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276955737] [2022-12-13 13:19:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:46,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276955737] [2022-12-13 13:19:46,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276955737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:46,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:46,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763779931] [2022-12-13 13:19:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:46,465 INFO L87 Difference]: Start difference. First operand 9255 states and 12925 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:47,347 INFO L93 Difference]: Finished difference Result 11522 states and 16131 transitions. [2022-12-13 13:19:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-12-13 13:19:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:47,354 INFO L225 Difference]: With dead ends: 11522 [2022-12-13 13:19:47,354 INFO L226 Difference]: Without dead ends: 7645 [2022-12-13 13:19:47,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:47,358 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 178 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 391 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2022-12-13 13:19:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 5609. [2022-12-13 13:19:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 5600 states have (on average 1.383392857142857) internal successors, (7747), 5608 states have internal predecessors, (7747), 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-12-13 13:19:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 7747 transitions. [2022-12-13 13:19:47,846 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 7747 transitions. Word has length 72 [2022-12-13 13:19:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:47,846 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 7747 transitions. [2022-12-13 13:19:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:19:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 7747 transitions. [2022-12-13 13:19:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 13:19:47,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:47,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:19:47,847 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1464123534, now seen corresponding path program 1 times [2022-12-13 13:19:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:47,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771661907] [2022-12-13 13:19:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771661907] [2022-12-13 13:19:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771661907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:47,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334687347] [2022-12-13 13:19:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:47,912 INFO L87 Difference]: Start difference. First operand 5609 states and 7747 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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-12-13 13:19:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:48,451 INFO L93 Difference]: Finished difference Result 5899 states and 8147 transitions. [2022-12-13 13:19:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2022-12-13 13:19:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:48,456 INFO L225 Difference]: With dead ends: 5899 [2022-12-13 13:19:48,456 INFO L226 Difference]: Without dead ends: 5892 [2022-12-13 13:19:48,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:48,457 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 174 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:48,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 442 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2022-12-13 13:19:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5885. [2022-12-13 13:19:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5885 states, 5876 states have (on average 1.3810415248468346) internal successors, (8115), 5884 states have internal predecessors, (8115), 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-12-13 13:19:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5885 states to 5885 states and 8115 transitions. [2022-12-13 13:19:48,857 INFO L78 Accepts]: Start accepts. Automaton has 5885 states and 8115 transitions. Word has length 73 [2022-12-13 13:19:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:48,857 INFO L495 AbstractCegarLoop]: Abstraction has 5885 states and 8115 transitions. [2022-12-13 13:19:48,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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-12-13 13:19:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5885 states and 8115 transitions. [2022-12-13 13:19:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 13:19:48,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:48,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:48,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:19:48,858 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492216, now seen corresponding path program 1 times [2022-12-13 13:19:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:48,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149688356] [2022-12-13 13:19:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149688356] [2022-12-13 13:19:48,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149688356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:48,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:48,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440924929] [2022-12-13 13:19:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:48,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:48,916 INFO L87 Difference]: Start difference. First operand 5885 states and 8115 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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-12-13 13:19:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:49,433 INFO L93 Difference]: Finished difference Result 6952 states and 9663 transitions. [2022-12-13 13:19:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2022-12-13 13:19:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:49,439 INFO L225 Difference]: With dead ends: 6952 [2022-12-13 13:19:49,439 INFO L226 Difference]: Without dead ends: 6951 [2022-12-13 13:19:49,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:49,440 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 154 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:49,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 473 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2022-12-13 13:19:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 6933. [2022-12-13 13:19:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6924 states have (on average 1.3926920854997111) internal successors, (9643), 6932 states have internal predecessors, (9643), 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-12-13 13:19:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 9643 transitions. [2022-12-13 13:19:49,886 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 9643 transitions. Word has length 73 [2022-12-13 13:19:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:49,886 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 9643 transitions. [2022-12-13 13:19:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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-12-13 13:19:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 9643 transitions. [2022-12-13 13:19:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 13:19:49,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:49,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:49,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:19:49,887 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1043459298, now seen corresponding path program 1 times [2022-12-13 13:19:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930492206] [2022-12-13 13:19:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:49,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930492206] [2022-12-13 13:19:49,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930492206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:49,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:49,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222460676] [2022-12-13 13:19:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:49,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:49,953 INFO L87 Difference]: Start difference. First operand 6933 states and 9643 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 13:19:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:50,462 INFO L93 Difference]: Finished difference Result 7162 states and 9951 transitions. [2022-12-13 13:19:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 75 [2022-12-13 13:19:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:50,468 INFO L225 Difference]: With dead ends: 7162 [2022-12-13 13:19:50,468 INFO L226 Difference]: Without dead ends: 6721 [2022-12-13 13:19:50,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:50,470 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 181 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:50,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 517 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-12-13 13:19:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6713. [2022-12-13 13:19:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6713 states, 6704 states have (on average 1.3912589498806682) internal successors, (9327), 6712 states have internal predecessors, (9327), 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-12-13 13:19:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6713 states to 6713 states and 9327 transitions. [2022-12-13 13:19:50,928 INFO L78 Accepts]: Start accepts. Automaton has 6713 states and 9327 transitions. Word has length 75 [2022-12-13 13:19:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:50,928 INFO L495 AbstractCegarLoop]: Abstraction has 6713 states and 9327 transitions. [2022-12-13 13:19:50,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 13:19:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6713 states and 9327 transitions. [2022-12-13 13:19:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 13:19:50,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:50,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:50,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:19:50,931 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1395000573, now seen corresponding path program 1 times [2022-12-13 13:19:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:50,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350901905] [2022-12-13 13:19:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350901905] [2022-12-13 13:19:50,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350901905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:50,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:50,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73451475] [2022-12-13 13:19:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:50,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:19:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:19:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:19:50,992 INFO L87 Difference]: Start difference. First operand 6713 states and 9327 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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-12-13 13:19:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:51,681 INFO L93 Difference]: Finished difference Result 6945 states and 9633 transitions. [2022-12-13 13:19:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:19:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 96 [2022-12-13 13:19:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:51,689 INFO L225 Difference]: With dead ends: 6945 [2022-12-13 13:19:51,689 INFO L226 Difference]: Without dead ends: 6940 [2022-12-13 13:19:51,690 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-12-13 13:19:51,690 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 117 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:51,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 408 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2022-12-13 13:19:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6706. [2022-12-13 13:19:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6700 states have (on average 1.363731343283582) internal successors, (9137), 6705 states have internal predecessors, (9137), 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-12-13 13:19:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 9137 transitions. [2022-12-13 13:19:52,161 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 9137 transitions. Word has length 96 [2022-12-13 13:19:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:52,161 INFO L495 AbstractCegarLoop]: Abstraction has 6706 states and 9137 transitions. [2022-12-13 13:19:52,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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-12-13 13:19:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 9137 transitions. [2022-12-13 13:19:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 13:19:52,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:52,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:52,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:19:52,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 653198863, now seen corresponding path program 1 times [2022-12-13 13:19:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398314801] [2022-12-13 13:19:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:19:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398314801] [2022-12-13 13:19:52,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398314801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:52,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:52,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420010827] [2022-12-13 13:19:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:52,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:52,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:52,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:52,255 INFO L87 Difference]: Start difference. First operand 6706 states and 9137 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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-12-13 13:19:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:52,869 INFO L93 Difference]: Finished difference Result 7223 states and 9841 transitions. [2022-12-13 13:19:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:52,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 98 [2022-12-13 13:19:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:52,875 INFO L225 Difference]: With dead ends: 7223 [2022-12-13 13:19:52,875 INFO L226 Difference]: Without dead ends: 6450 [2022-12-13 13:19:52,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:52,876 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 174 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:52,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 514 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6450 states. [2022-12-13 13:19:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6450 to 6430. [2022-12-13 13:19:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 6424 states have (on average 1.3669053549190535) internal successors, (8781), 6429 states have internal predecessors, (8781), 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-12-13 13:19:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 8781 transitions. [2022-12-13 13:19:53,291 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 8781 transitions. Word has length 98 [2022-12-13 13:19:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:53,291 INFO L495 AbstractCegarLoop]: Abstraction has 6430 states and 8781 transitions. [2022-12-13 13:19:53,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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-12-13 13:19:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 8781 transitions. [2022-12-13 13:19:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 13:19:53,293 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:53,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:19:53,293 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1374191545, now seen corresponding path program 1 times [2022-12-13 13:19:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:53,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39135129] [2022-12-13 13:19:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:19:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:53,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39135129] [2022-12-13 13:19:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39135129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:53,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:53,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389654967] [2022-12-13 13:19:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:19:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:53,321 INFO L87 Difference]: Start difference. First operand 6430 states and 8781 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-12-13 13:19:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:53,728 INFO L93 Difference]: Finished difference Result 11947 states and 16373 transitions. [2022-12-13 13:19:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 98 [2022-12-13 13:19:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:53,734 INFO L225 Difference]: With dead ends: 11947 [2022-12-13 13:19:53,734 INFO L226 Difference]: Without dead ends: 6398 [2022-12-13 13:19:53,737 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-12-13 13:19:53,738 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 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-12-13 13:19:53,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6398 states. [2022-12-13 13:19:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6398 to 6320. [2022-12-13 13:19:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 6314 states have (on average 1.3492239467849223) internal successors, (8519), 6319 states have internal predecessors, (8519), 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-12-13 13:19:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 8519 transitions. [2022-12-13 13:19:54,134 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 8519 transitions. Word has length 98 [2022-12-13 13:19:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:54,134 INFO L495 AbstractCegarLoop]: Abstraction has 6320 states and 8519 transitions. [2022-12-13 13:19:54,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-12-13 13:19:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 8519 transitions. [2022-12-13 13:19:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 13:19:54,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:54,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:54,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:19:54,135 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 565758719, now seen corresponding path program 2 times [2022-12-13 13:19:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:54,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121560083] [2022-12-13 13:19:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121560083] [2022-12-13 13:19:54,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121560083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:54,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:54,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563835699] [2022-12-13 13:19:54,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:54,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:54,203 INFO L87 Difference]: Start difference. First operand 6320 states and 8519 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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-12-13 13:19:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:54,733 INFO L93 Difference]: Finished difference Result 9406 states and 12796 transitions. [2022-12-13 13:19:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 98 [2022-12-13 13:19:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:54,737 INFO L225 Difference]: With dead ends: 9406 [2022-12-13 13:19:54,738 INFO L226 Difference]: Without dead ends: 5007 [2022-12-13 13:19:54,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:54,741 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 202 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:54,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 408 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:19:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2022-12-13 13:19:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4984. [2022-12-13 13:19:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3457211731619123) internal successors, (6699), 4983 states have internal predecessors, (6699), 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-12-13 13:19:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6699 transitions. [2022-12-13 13:19:55,043 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6699 transitions. Word has length 98 [2022-12-13 13:19:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:55,044 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6699 transitions. [2022-12-13 13:19:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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-12-13 13:19:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6699 transitions. [2022-12-13 13:19:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 13:19:55,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:55,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:19:55,045 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1811958509, now seen corresponding path program 1 times [2022-12-13 13:19:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:55,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871611348] [2022-12-13 13:19:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:19:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871611348] [2022-12-13 13:19:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871611348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:55,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986839616] [2022-12-13 13:19:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:55,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:55,134 INFO L87 Difference]: Start difference. First operand 4984 states and 6699 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-12-13 13:19:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:55,478 INFO L93 Difference]: Finished difference Result 4992 states and 6704 transitions. [2022-12-13 13:19:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2022-12-13 13:19:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:55,482 INFO L225 Difference]: With dead ends: 4992 [2022-12-13 13:19:55,482 INFO L226 Difference]: Without dead ends: 4984 [2022-12-13 13:19:55,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:55,483 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 153 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:55,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 369 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-12-13 13:19:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4984. [2022-12-13 13:19:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3392928887103255) internal successors, (6667), 4983 states have internal predecessors, (6667), 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-12-13 13:19:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6667 transitions. [2022-12-13 13:19:55,781 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6667 transitions. Word has length 100 [2022-12-13 13:19:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:55,782 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6667 transitions. [2022-12-13 13:19:55,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-12-13 13:19:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6667 transitions. [2022-12-13 13:19:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 13:19:55,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:55,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 13:19:55,784 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1302363118, now seen corresponding path program 1 times [2022-12-13 13:19:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805841737] [2022-12-13 13:19:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:55,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805841737] [2022-12-13 13:19:55,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805841737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:55,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:55,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454749032] [2022-12-13 13:19:55,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:55,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:55,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:55,862 INFO L87 Difference]: Start difference. First operand 4984 states and 6667 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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-12-13 13:19:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:56,188 INFO L93 Difference]: Finished difference Result 6274 states and 8458 transitions. [2022-12-13 13:19:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 101 [2022-12-13 13:19:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:56,191 INFO L225 Difference]: With dead ends: 6274 [2022-12-13 13:19:56,191 INFO L226 Difference]: Without dead ends: 3603 [2022-12-13 13:19:56,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:56,193 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 132 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:56,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 322 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2022-12-13 13:19:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3201. [2022-12-13 13:19:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3200 states have internal predecessors, (4190), 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-12-13 13:19:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4190 transitions. [2022-12-13 13:19:56,425 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4190 transitions. Word has length 101 [2022-12-13 13:19:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:56,425 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 4190 transitions. [2022-12-13 13:19:56,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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-12-13 13:19:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4190 transitions. [2022-12-13 13:19:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-13 13:19:56,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:56,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 13:19:56,426 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -971866840, now seen corresponding path program 1 times [2022-12-13 13:19:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:56,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805713010] [2022-12-13 13:19:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:19:56,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:56,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805713010] [2022-12-13 13:19:56,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805713010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:56,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:56,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:56,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132766141] [2022-12-13 13:19:56,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:56,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:56,488 INFO L87 Difference]: Start difference. First operand 3201 states and 4190 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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-12-13 13:19:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:56,789 INFO L93 Difference]: Finished difference Result 3202 states and 4190 transitions. [2022-12-13 13:19:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:56,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2022-12-13 13:19:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:56,791 INFO L225 Difference]: With dead ends: 3202 [2022-12-13 13:19:56,791 INFO L226 Difference]: Without dead ends: 3194 [2022-12-13 13:19:56,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:56,792 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:56,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-12-13 13:19:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2022-12-13 13:19:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.303163169433135) internal successors, (4161), 3193 states have internal predecessors, (4161), 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-12-13 13:19:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4161 transitions. [2022-12-13 13:19:57,018 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4161 transitions. Word has length 102 [2022-12-13 13:19:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:57,018 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4161 transitions. [2022-12-13 13:19:57,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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-12-13 13:19:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4161 transitions. [2022-12-13 13:19:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-13 13:19:57,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:57,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:57,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 13:19:57,020 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1718550854, now seen corresponding path program 1 times [2022-12-13 13:19:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:57,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705858048] [2022-12-13 13:19:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705858048] [2022-12-13 13:19:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705858048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707354130] [2022-12-13 13:19:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:57,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:57,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:57,082 INFO L87 Difference]: Start difference. First operand 3194 states and 4161 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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-12-13 13:19:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:57,357 INFO L93 Difference]: Finished difference Result 3195 states and 4161 transitions. [2022-12-13 13:19:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 102 [2022-12-13 13:19:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:57,360 INFO L225 Difference]: With dead ends: 3195 [2022-12-13 13:19:57,360 INFO L226 Difference]: Without dead ends: 3194 [2022-12-13 13:19:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:57,361 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:57,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 381 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-12-13 13:19:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2022-12-13 13:19:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.3006576886940182) internal successors, (4153), 3193 states have internal predecessors, (4153), 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-12-13 13:19:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4153 transitions. [2022-12-13 13:19:57,601 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4153 transitions. Word has length 102 [2022-12-13 13:19:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:57,602 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4153 transitions. [2022-12-13 13:19:57,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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-12-13 13:19:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4153 transitions. [2022-12-13 13:19:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 13:19:57,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:57,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:19:57,603 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1861706580, now seen corresponding path program 1 times [2022-12-13 13:19:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:57,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476505513] [2022-12-13 13:19:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:19:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476505513] [2022-12-13 13:19:57,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476505513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:57,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:57,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140002907] [2022-12-13 13:19:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:57,661 INFO L87 Difference]: Start difference. First operand 3194 states and 4153 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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-12-13 13:19:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:57,986 INFO L93 Difference]: Finished difference Result 3416 states and 4449 transitions. [2022-12-13 13:19:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:57,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 104 [2022-12-13 13:19:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:57,989 INFO L225 Difference]: With dead ends: 3416 [2022-12-13 13:19:57,989 INFO L226 Difference]: Without dead ends: 2927 [2022-12-13 13:19:57,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:57,990 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 153 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:57,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 508 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2022-12-13 13:19:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2706. [2022-12-13 13:19:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.2913123844731977) internal successors, (3493), 2705 states have internal predecessors, (3493), 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-12-13 13:19:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3493 transitions. [2022-12-13 13:19:58,163 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3493 transitions. Word has length 104 [2022-12-13 13:19:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:58,163 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 3493 transitions. [2022-12-13 13:19:58,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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-12-13 13:19:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3493 transitions. [2022-12-13 13:19:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 13:19:58,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:58,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:58,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 13:19:58,164 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1155199980, now seen corresponding path program 2 times [2022-12-13 13:19:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:58,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579136140] [2022-12-13 13:19:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 13:19:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579136140] [2022-12-13 13:19:58,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579136140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:58,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:58,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004993558] [2022-12-13 13:19:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:58,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:58,222 INFO L87 Difference]: Start difference. First operand 2706 states and 3493 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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-12-13 13:19:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:58,485 INFO L93 Difference]: Finished difference Result 2707 states and 3493 transitions. [2022-12-13 13:19:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 104 [2022-12-13 13:19:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:58,487 INFO L225 Difference]: With dead ends: 2707 [2022-12-13 13:19:58,487 INFO L226 Difference]: Without dead ends: 1866 [2022-12-13 13:19:58,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:58,488 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 137 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:58,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 486 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-12-13 13:19:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2022-12-13 13:19:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.2809651474530832) internal successors, (2389), 1865 states have internal predecessors, (2389), 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-12-13 13:19:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2389 transitions. [2022-12-13 13:19:58,614 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2389 transitions. Word has length 104 [2022-12-13 13:19:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:58,614 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2389 transitions. [2022-12-13 13:19:58,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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-12-13 13:19:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2389 transitions. [2022-12-13 13:19:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-13 13:19:58,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:19:58,616 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:58,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 13:19:58,616 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:19:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 214144641, now seen corresponding path program 1 times [2022-12-13 13:19:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:58,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293107483] [2022-12-13 13:19:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:19:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293107483] [2022-12-13 13:19:58,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293107483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:58,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:58,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:19:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746111951] [2022-12-13 13:19:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:58,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:19:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:19:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:58,698 INFO L87 Difference]: Start difference. First operand 1866 states and 2389 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-12-13 13:19:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:58,906 INFO L93 Difference]: Finished difference Result 1866 states and 2389 transitions. [2022-12-13 13:19:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:19:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 126 [2022-12-13 13:19:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:19:58,907 INFO L225 Difference]: With dead ends: 1866 [2022-12-13 13:19:58,907 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 13:19:58,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:19:58,909 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 127 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:19:58,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:19:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 13:19:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 13:19:58,909 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-12-13 13:19:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 13:19:58,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2022-12-13 13:19:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:19:58,909 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:19:58,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-12-13 13:19:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:19:58,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 13:19:58,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-13 13:19:58,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-13 13:19:58,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-13 13:19:58,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 13:19:58,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 13:20:06,360 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 678 DAG size of output: 662 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:20:11,994 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 710 DAG size of output: 694 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:20:19,453 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 738 DAG size of output: 722 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:20:35,040 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 706 DAG size of output: 690 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:20:47,881 WARN L233 SmtUtils]: Spent 12.84s on a formula simplification. DAG size of input: 616 DAG size of output: 617 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:20:53,837 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 679 DAG size of output: 663 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:21:33,310 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 617 DAG size of output: 44 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 13:21:40,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 13:21:40,998 INFO L895 garLoopResultBuilder]: At program point L366(lines 363 376) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse11 (+ ~st3~0 ~st1~0))) (let ((.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (<= ~st1~0 0)) (.cse10 (<= 0 .cse11)) (.cse6 (<= 0 ~st1~0)) (.cse2 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse9 (<= 0 ~st2~0)) (.cse12 (= ~st3~0 1)) (.cse13 (<= ~st2~0 0)) (.cse7 (<= .cse14 0)) (.cse8 (<= 0 .cse14))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse2 .cse5 (<= .cse4 0) .cse6 .cse7 .cse8)) (and .cse0 .cse2 .cse9 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (and .cse1 .cse2 .cse10 .cse6 (<= .cse11 0) .cse3) (and .cse12 (or (and .cse0 .cse2 .cse9 .cse13) (and .cse0 .cse1 .cse2))) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse2 .cse9 .cse12 .cse13 .cse7 .cse8)))) [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 351) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 13:21:40,999 INFO L895 garLoopResultBuilder]: At program point L170(lines 165 260) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:40,999 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 346) no Hoare annotation was computed. [2022-12-13 13:21:41,000 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-12-13 13:21:41,000 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-12-13 13:21:41,000 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 345) no Hoare annotation was computed. [2022-12-13 13:21:41,000 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (let ((.cse8 (+ ~st2~0 ~st1~0))) (let ((.cse1 (<= 0 ~st1~0)) (.cse3 (<= (+ ~st3~0 ~st1~0) 0)) (.cse4 (<= 0 .cse8)) (.cse5 (<= 0 ~st3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= ~st2~0 0)) (.cse6 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (= ~st3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 (<= ~st3~0 0) .cse2 .cse5) (and (let ((.cse7 (<= ~st1~0 0))) (or (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse2 (<= .cse8 0) .cse4))) .cse9) (and .cse6 .cse2 .cse10 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (and .cse2 .cse11 .cse3 .cse4 .cse5) (and (or (and .cse6 .cse2 .cse10 .cse11) (and .cse6 .cse0 .cse2)) .cse9)))) [2022-12-13 13:21:41,000 INFO L895 garLoopResultBuilder]: At program point L155(lines 150 305) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,000 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 384) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,000 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,000 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-12-13 13:21:41,000 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,001 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse8 (<= 0 ~st1~0)) (.cse7 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse0 (= ~st1~0 1)) (.cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0)) (.cse2 (= ~st3~0 1)) (.cse6 (let ((.cse9 (<= 0 .cse7)) (.cse10 (<= ~st1~0 0))) (or (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse9 .cse10 .cse8 (<= .cse11 0) (<= 0 .cse11))) (and (= ~st2~0 1) .cse9 .cse10 .cse8)))) (.cse1 (<= 0 ~st2~0)) (.cse3 (<= 0 ~st3~0))) (or (and .cse0 .cse1 .cse2 (<= ~st2~0 0)) (and .cse0 .cse1 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (let ((.cse5 (+ ~st3~0 ~st1~0))) (and .cse4 (<= 0 .cse5) .cse6 (<= .cse5 0))) (and .cse4 .cse2 .cse6) (and (<= .cse7 0) .cse8 .cse1 .cse3)))) [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L895 garLoopResultBuilder]: At program point L140(lines 135 351) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,001 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0))) (let ((.cse12 (+ ~st3~0 ~st2~0)) (.cse1 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= 0 .cse14))) (let ((.cse9 (= ~st3~0 1)) (.cse11 (let ((.cse13 (<= ~st1~0 0))) (or (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse2 .cse3 .cse13 .cse4 (<= .cse14 0) .cse5)))) (.cse7 (<= 0 .cse12)) (.cse0 (= ~st1~0 1)) (.cse8 (<= 0 ~st2~0)) (.cse6 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (or (and .cse7 .cse0 .cse2 .cse8 (<= ~st2~0 0)) (and .cse7 .cse0 .cse1 .cse2 .cse8)) .cse9) (let ((.cse10 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse10) (<= .cse10 0) .cse11)) (and .cse9 .cse11) (and .cse7 .cse0 .cse2 .cse8 (<= .cse12 0) .cse6))))) [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-12-13 13:21:41,001 INFO L895 garLoopResultBuilder]: At program point L373(lines 361 381) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse11 (+ ~st3~0 ~st1~0))) (let ((.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (<= ~st1~0 0)) (.cse10 (<= 0 .cse11)) (.cse6 (<= 0 ~st1~0)) (.cse2 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse9 (<= 0 ~st2~0)) (.cse12 (= ~st3~0 1)) (.cse13 (<= ~st2~0 0)) (.cse7 (<= .cse14 0)) (.cse8 (<= 0 .cse14))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse2 .cse5 (<= .cse4 0) .cse6 .cse7 .cse8)) (and .cse0 .cse2 .cse9 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (and .cse1 .cse2 .cse10 .cse6 (<= .cse11 0) .cse3) (and .cse12 (or (and .cse0 .cse2 .cse9 .cse13) (and .cse0 .cse1 .cse2))) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse2 .cse9 .cse12 .cse13 .cse7 .cse8)))) [2022-12-13 13:21:41,002 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 382) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 470) the Hoare annotation is: true [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 356) no Hoare annotation was computed. [2022-12-13 13:21:41,002 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: (let ((.cse8 (+ ~st2~0 ~st1~0))) (let ((.cse1 (<= 0 ~st1~0)) (.cse3 (<= (+ ~st3~0 ~st1~0) 0)) (.cse4 (<= 0 .cse8)) (.cse5 (<= 0 ~st3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= ~st2~0 0)) (.cse6 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (= ~st3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 (<= ~st3~0 0) .cse2 .cse5) (and (let ((.cse7 (<= ~st1~0 0))) (or (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse2 (<= .cse8 0) .cse4))) .cse9) (and .cse6 .cse2 .cse10 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (and .cse2 .cse11 .cse3 .cse4 .cse5) (and (or (and .cse6 .cse2 .cse10 .cse11) (and .cse6 .cse0 .cse2)) .cse9)))) [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 356) the Hoare annotation is: (let ((.cse3 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse2 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse3 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 (<= ~st2~0 0)) (and .cse1 .cse3))) (and .cse0 .cse4) (and .cse1 .cse2 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse3 (<= ~st3~0 0) .cse5)))) [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,003 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0))) (let ((.cse12 (+ ~st3~0 ~st2~0)) (.cse1 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= 0 .cse14))) (let ((.cse9 (= ~st3~0 1)) (.cse11 (let ((.cse13 (<= ~st1~0 0))) (or (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse2 .cse3 .cse13 .cse4 (<= .cse14 0) .cse5)))) (.cse7 (<= 0 .cse12)) (.cse0 (= ~st1~0 1)) (.cse8 (<= 0 ~st2~0)) (.cse6 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (or (and .cse7 .cse0 .cse2 .cse8 (<= ~st2~0 0)) (and .cse7 .cse0 .cse1 .cse2 .cse8)) .cse9) (let ((.cse10 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse10) (<= .cse10 0) .cse11)) (and .cse9 .cse11) (and .cse7 .cse0 .cse2 .cse8 (<= .cse12 0) .cse6))))) [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-12-13 13:21:41,004 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2022-12-13 13:21:41,007 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:41,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:21:41,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:21:41 BoogieIcfgContainer [2022-12-13 13:21:41,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:21:41,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:21:41,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:21:41,032 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:21:41,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:19:33" (3/4) ... [2022-12-13 13:21:41,034 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 13:21:41,044 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 13:21:41,044 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 13:21:41,044 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 13:21:41,044 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 13:21:41,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:21:41,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:21:41,085 INFO L158 Benchmark]: Toolchain (without parser) took 128209.95ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 91.5MB in the beginning and 813.1MB in the end (delta: -721.6MB). Peak memory consumption was 536.8MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.42ms. Allocated memory is still 132.1MB. Free memory was 91.5MB in the beginning and 77.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 132.1MB. Free memory was 77.5MB in the beginning and 75.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: Boogie Preprocessor took 29.54ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 73.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: RCFGBuilder took 397.10ms. Allocated memory is still 132.1MB. Free memory was 73.8MB in the beginning and 98.4MB in the end (delta: -24.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: TraceAbstraction took 127374.02ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 97.7MB in the beginning and 818.4MB in the end (delta: -720.6MB). Peak memory consumption was 857.3MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,086 INFO L158 Benchmark]: Witness Printer took 53.72ms. Allocated memory is still 1.4GB. Free memory was 818.4MB in the beginning and 813.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 13:21:41,087 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.12ms. Allocated memory is still 104.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.42ms. Allocated memory is still 132.1MB. Free memory was 91.5MB in the beginning and 77.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 132.1MB. Free memory was 77.5MB in the beginning and 75.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.54ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 73.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 397.10ms. Allocated memory is still 132.1MB. Free memory was 73.8MB in the beginning and 98.4MB in the end (delta: -24.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 127374.02ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 97.7MB in the beginning and 818.4MB in the end (delta: -720.6MB). Peak memory consumption was 857.3MB. Max. memory is 16.1GB. * Witness Printer took 53.72ms. Allocated memory is still 1.4GB. Free memory was 818.4MB in the beginning and 813.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 89 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 127.3s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 102.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5964 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5964 mSDsluCounter, 12029 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6274 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 5755 mSDtfsCounter, 2988 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9255occurred in iteration=20, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 7890 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 1725 NumberOfFragments, 2735 HoareAnnotationTreeSize, 17 FomulaSimplifications, 184331 FormulaSimplificationTreeSizeReduction, 58.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 640605 FormulaSimplificationTreeSizeReductionInter, 43.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 9860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 773/773 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 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && 0 <= st1) && 0 <= st2 + st1) && 0 <= st3) || ((((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((((0 <= st3 + st2 && st1 == 1) && st2 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2)) && st3 == 1)) || ((0 <= st3 + st1 && st3 + st1 <= 0) && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3) || ((((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st3 + st1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1)))) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st3 + st1) && 0 <= st1) && st3 == 1)) || (((((256 * (mode1 / 256) == mode1 && 0 <= st2) && st3 == 1) && st2 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st3)) || ((((((st2 == 1 && st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2 + st1) || ((((st1 <= 0 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st2 + st1 <= 0) && 0 <= st2 + st1)) && st3 == 1)) || ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((((256 * (mode3 / 256) == mode3 && st2 <= 0) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3)) || (((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3)) && st3 == 1) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && 0 <= st1) && 0 <= st2 + st1) && 0 <= st3) || ((((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((((0 <= st3 + st2 && st1 == 1) && st2 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2)) && st3 == 1)) || ((0 <= st3 + st1 && st3 + st1 <= 0) && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st3)) || ((((((st2 == 1 && st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2 + st1) || ((((st1 <= 0 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st2 + st1 <= 0) && 0 <= st2 + st1)) && st3 == 1)) || ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((((256 * (mode3 / 256) == mode3 && st2 <= 0) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3)) || (((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3)) && st3 == 1) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((r1 / 256 * 256 + 2 < r1 && 0 <= st3 + st1) && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || ((r1 / 256 * 256 + 2 < r1 && st3 == 1) && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st3 + st2 + st1 <= 0 && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3) || ((((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st3 + st1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1)))) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st3 + st1) && 0 <= st1) && st3 == 1)) || (((((256 * (mode1 / 256) == mode1 && 0 <= st2) && st3 == 1) && st2 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) RESULT: Ultimate proved your program to be correct! [2022-12-13 13:21:41,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_848a5e65-d6b3-4718-a829-1d6e2922e28e/bin/uautomizer-uyxdKDjOR8/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