./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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:41:46,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:41:46,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:41:46,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:41:46,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:41:46,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:41:46,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:41:46,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:41:46,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:41:46,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:41:46,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:41:46,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:41:46,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:41:46,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:41:46,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:41:46,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:41:46,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:41:46,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:41:46,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:41:46,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:41:46,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:41:46,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:41:46,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:41:46,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:41:46,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:41:46,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:41:46,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:41:46,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:41:46,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:41:46,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:41:46,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:41:46,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:41:46,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:41:46,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:41:46,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:41:46,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:41:46,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:41:46,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:41:46,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:41:46,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:41:46,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:41:46,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:41:46,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:41:46,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:41:46,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:41:46,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:41:46,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:41:46,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:41:46,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:41:46,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:41:46,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:41:46,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:41:46,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:41:46,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:41:46,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:41:46,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:41:46,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:41:46,648 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:41:46,648 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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-12-13 13:41:46,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:41:46,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:41:46,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:41:46,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:41:46,825 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:41:46,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-12-13 13:41:49,424 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:41:49,581 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:41:49,581 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-12-13 13:41:49,589 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/data/c2f77d852/bb5c7510d819446197de3773092c2545/FLAG5d2b93a81 [2022-12-13 13:41:49,600 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/data/c2f77d852/bb5c7510d819446197de3773092c2545 [2022-12-13 13:41:49,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:41:49,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:41:49,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:41:49,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:41:49,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:41:49,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a612ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49, skipping insertion in model container [2022-12-13 13:41:49,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:41:49,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:41:49,760 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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-12-13 13:41:49,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:41:49,768 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:41:49,793 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_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-12-13 13:41:49,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:41:49,804 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:41:49,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49 WrapperNode [2022-12-13 13:41:49,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:41:49,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:41:49,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:41:49,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:41:49,811 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:41:49" (1/1) ... [2022-12-13 13:41:49,818 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:41:49" (1/1) ... [2022-12-13 13:41:49,837 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2022-12-13 13:41:49,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:41:49,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:41:49,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:41:49,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:41:49,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:41:49,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:41:49,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:41:49,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:41:49,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (1/1) ... [2022-12-13 13:41:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:41:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:49,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:41:49,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:41:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:41:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:41:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:41:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:41:49,987 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:41:49,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:41:50,227 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:41:50,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:41:50,232 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 13:41:50,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:41:50 BoogieIcfgContainer [2022-12-13 13:41:50,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:41:50,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:41:50,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:41:50,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:41:50,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:41:49" (1/3) ... [2022-12-13 13:41:50,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ece81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:41:50, skipping insertion in model container [2022-12-13 13:41:50,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:49" (2/3) ... [2022-12-13 13:41:50,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ece81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:41:50, skipping insertion in model container [2022-12-13 13:41:50,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:41:50" (3/3) ... [2022-12-13 13:41:50,245 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-12-13 13:41:50,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:41:50,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-13 13:41:50,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:41:50,319 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;@66ea0b97, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:41:50,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-13 13:41:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 83 states have internal predecessors, (121), 0 states have call successors, (0), 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:41:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 13:41:50,329 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:50,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:50,331 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:41:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -524468693, now seen corresponding path program 1 times [2022-12-13 13:41:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547176688] [2022-12-13 13:41:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547176688] [2022-12-13 13:41:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547176688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:50,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:50,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:41:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624451860] [2022-12-13 13:41:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:50,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:41:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:41:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:41:50,531 INFO L87 Difference]: Start difference. First operand has 84 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 83 states have internal predecessors, (121), 0 states have call successors, (0), 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, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:50,548 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2022-12-13 13:41:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:41:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 13:41:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:50,556 INFO L225 Difference]: With dead ends: 141 [2022-12-13 13:41:50,557 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 13:41:50,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:41:50,561 INFO L413 NwaCegarLoop]: 112 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, 112 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:41:50,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 13:41:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 13:41:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 76 states have internal predecessors, (111), 0 states have call successors, (0), 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:41:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2022-12-13 13:41:50,587 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 11 [2022-12-13 13:41:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:50,588 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2022-12-13 13:41:50,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2022-12-13 13:41:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 13:41:50,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:50,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:50,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:41:50,589 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:41:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -133016270, now seen corresponding path program 1 times [2022-12-13 13:41:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:50,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322865931] [2022-12-13 13:41:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:50,716 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:41:50,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322865931] [2022-12-13 13:41:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322865931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:50,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144517059] [2022-12-13 13:41:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:50,719 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:50,767 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2022-12-13 13:41:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 13:41:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:50,768 INFO L225 Difference]: With dead ends: 136 [2022-12-13 13:41:50,768 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 13:41:50,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:41:50,770 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:50,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 13:41:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 13:41:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 76 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:41:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2022-12-13 13:41:50,775 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 15 [2022-12-13 13:41:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:50,775 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2022-12-13 13:41:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-12-13 13:41:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 13:41:50,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:50,777 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] [2022-12-13 13:41:50,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:41:50,777 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:41:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2029260687, now seen corresponding path program 1 times [2022-12-13 13:41:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:50,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146387716] [2022-12-13 13:41:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:50,853 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:41:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:50,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146387716] [2022-12-13 13:41:50,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146387716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:50,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:50,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028076527] [2022-12-13 13:41:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:50,856 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:50,936 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2022-12-13 13:41:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 13:41:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:50,938 INFO L225 Difference]: With dead ends: 129 [2022-12-13 13:41:50,938 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 13:41:50,938 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:41:50,940 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 216 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:50,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 113 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 13:41:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-12-13 13:41:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 119 states have internal predecessors, (165), 0 states have call successors, (0), 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:41:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2022-12-13 13:41:50,948 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 30 [2022-12-13 13:41:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2022-12-13 13:41:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-12-13 13:41:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 13:41:50,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:50,950 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] [2022-12-13 13:41:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:41:50,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1517427904, now seen corresponding path program 1 times [2022-12-13 13:41:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144151745] [2022-12-13 13:41:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:51,014 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:41:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144151745] [2022-12-13 13:41:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144151745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:51,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784792632] [2022-12-13 13:41:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:51,017 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:51,117 INFO L93 Difference]: Finished difference Result 224 states and 305 transitions. [2022-12-13 13:41:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 13:41:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:51,119 INFO L225 Difference]: With dead ends: 224 [2022-12-13 13:41:51,119 INFO L226 Difference]: Without dead ends: 221 [2022-12-13 13:41:51,120 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:41:51,120 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:51,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 167 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-13 13:41:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 163. [2022-12-13 13:41:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.5364238410596027) internal successors, (232), 162 states have internal predecessors, (232), 0 states have call successors, (0), 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:41:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2022-12-13 13:41:51,131 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 31 [2022-12-13 13:41:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:51,131 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2022-12-13 13:41:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2022-12-13 13:41:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 13:41:51,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:51,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:51,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:41:51,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash 204375473, now seen corresponding path program 1 times [2022-12-13 13:41:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:51,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698020218] [2022-12-13 13:41:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:51,196 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:41:51,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:51,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698020218] [2022-12-13 13:41:51,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698020218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:51,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:51,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575034746] [2022-12-13 13:41:51,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:51,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:51,199 INFO L87 Difference]: Start difference. First operand 163 states and 232 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:51,357 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2022-12-13 13:41:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:41:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-13 13:41:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:51,359 INFO L225 Difference]: With dead ends: 264 [2022-12-13 13:41:51,359 INFO L226 Difference]: Without dead ends: 261 [2022-12-13 13:41:51,359 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:41:51,360 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 471 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:51,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 195 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-13 13:41:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2022-12-13 13:41:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 237 states have (on average 1.5443037974683544) internal successors, (366), 248 states have internal predecessors, (366), 0 states have call successors, (0), 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:41:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2022-12-13 13:41:51,379 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 32 [2022-12-13 13:41:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:51,379 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2022-12-13 13:41:51,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2022-12-13 13:41:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 13:41:51,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:51,380 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] [2022-12-13 13:41:51,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:41:51,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2040672610, now seen corresponding path program 1 times [2022-12-13 13:41:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936565419] [2022-12-13 13:41:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:51,441 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:41:51,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:51,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936565419] [2022-12-13 13:41:51,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936565419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:51,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:51,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:51,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151406860] [2022-12-13 13:41:51,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:51,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:51,443 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:41:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:51,639 INFO L93 Difference]: Finished difference Result 755 states and 1115 transitions. [2022-12-13 13:41:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:41:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-12-13 13:41:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:51,642 INFO L225 Difference]: With dead ends: 755 [2022-12-13 13:41:51,642 INFO L226 Difference]: Without dead ends: 528 [2022-12-13 13:41:51,643 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:41:51,644 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 468 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:51,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 316 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-12-13 13:41:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2022-12-13 13:41:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.5081967213114753) internal successors, (552), 377 states have internal predecessors, (552), 0 states have call successors, (0), 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:41:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 552 transitions. [2022-12-13 13:41:51,670 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 552 transitions. Word has length 33 [2022-12-13 13:41:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:51,670 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 552 transitions. [2022-12-13 13:41:51,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:41:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 552 transitions. [2022-12-13 13:41:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 13:41:51,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:51,672 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:41:51,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:41:51,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1865524296, now seen corresponding path program 1 times [2022-12-13 13:41:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:51,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92549254] [2022-12-13 13:41:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:51,712 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:41:51,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:51,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92549254] [2022-12-13 13:41:51,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92549254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:51,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:51,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960043500] [2022-12-13 13:41:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:51,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:51,714 INFO L87 Difference]: Start difference. First operand 378 states and 552 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:41:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:51,761 INFO L93 Difference]: Finished difference Result 1058 states and 1556 transitions. [2022-12-13 13:41:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:51,762 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:41:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:51,765 INFO L225 Difference]: With dead ends: 1058 [2022-12-13 13:41:51,765 INFO L226 Difference]: Without dead ends: 702 [2022-12-13 13:41:51,766 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:41:51,767 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:51,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-12-13 13:41:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 690. [2022-12-13 13:41:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 678 states have (on average 1.5014749262536873) internal successors, (1018), 689 states have internal predecessors, (1018), 0 states have call successors, (0), 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:41:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1018 transitions. [2022-12-13 13:41:51,811 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1018 transitions. Word has length 35 [2022-12-13 13:41:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:51,811 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1018 transitions. [2022-12-13 13:41:51,812 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:41:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1018 transitions. [2022-12-13 13:41:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:41:51,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:51,813 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:41:51,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:41:51,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1638740118, now seen corresponding path program 1 times [2022-12-13 13:41:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382560012] [2022-12-13 13:41:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:51,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382560012] [2022-12-13 13:41:51,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382560012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:51,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:51,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069012882] [2022-12-13 13:41:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:51,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:51,859 INFO L87 Difference]: Start difference. First operand 690 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:51,915 INFO L93 Difference]: Finished difference Result 1962 states and 2898 transitions. [2022-12-13 13:41:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:51,919 INFO L225 Difference]: With dead ends: 1962 [2022-12-13 13:41:51,919 INFO L226 Difference]: Without dead ends: 1294 [2022-12-13 13:41:51,920 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:41:51,920 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:51,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-12-13 13:41:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1282. [2022-12-13 13:41:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1270 states have (on average 1.48503937007874) internal successors, (1886), 1281 states have internal predecessors, (1886), 0 states have call successors, (0), 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:41:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1886 transitions. [2022-12-13 13:41:51,974 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1886 transitions. Word has length 37 [2022-12-13 13:41:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:51,974 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1886 transitions. [2022-12-13 13:41:51,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1886 transitions. [2022-12-13 13:41:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:41:51,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:51,975 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:41:51,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:41:51,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash -958732938, now seen corresponding path program 1 times [2022-12-13 13:41:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:51,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56552993] [2022-12-13 13:41:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:52,001 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:41:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:52,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56552993] [2022-12-13 13:41:52,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56552993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:52,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:52,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418759428] [2022-12-13 13:41:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:52,003 INFO L87 Difference]: Start difference. First operand 1282 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:52,106 INFO L93 Difference]: Finished difference Result 3578 states and 5262 transitions. [2022-12-13 13:41:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:52,112 INFO L225 Difference]: With dead ends: 3578 [2022-12-13 13:41:52,112 INFO L226 Difference]: Without dead ends: 2318 [2022-12-13 13:41:52,113 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:41:52,114 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:52,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-12-13 13:41:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2306. [2022-12-13 13:41:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2294 states have (on average 1.4673060156931124) internal successors, (3366), 2305 states have internal predecessors, (3366), 0 states have call successors, (0), 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:41:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3366 transitions. [2022-12-13 13:41:52,214 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3366 transitions. Word has length 37 [2022-12-13 13:41:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 3366 transitions. [2022-12-13 13:41:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:41:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3366 transitions. [2022-12-13 13:41:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 13:41:52,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:52,217 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] [2022-12-13 13:41:52,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:41:52,217 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:41:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1488856003, now seen corresponding path program 1 times [2022-12-13 13:41:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:52,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738511946] [2022-12-13 13:41:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738511946] [2022-12-13 13:41:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738511946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:52,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:52,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841462232] [2022-12-13 13:41:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:52,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:52,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:52,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:52,274 INFO L87 Difference]: Start difference. First operand 2306 states and 3366 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:52,442 INFO L93 Difference]: Finished difference Result 5186 states and 7536 transitions. [2022-12-13 13:41:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-13 13:41:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:52,449 INFO L225 Difference]: With dead ends: 5186 [2022-12-13 13:41:52,449 INFO L226 Difference]: Without dead ends: 2902 [2022-12-13 13:41:52,452 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:41:52,452 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 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:41:52,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-12-13 13:41:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2856. [2022-12-13 13:41:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.4430379746835442) internal successors, (4104), 2855 states have internal predecessors, (4104), 0 states have call successors, (0), 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:41:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4104 transitions. [2022-12-13 13:41:52,580 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4104 transitions. Word has length 53 [2022-12-13 13:41:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:52,580 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4104 transitions. [2022-12-13 13:41:52,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4104 transitions. [2022-12-13 13:41:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 13:41:52,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:52,581 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] [2022-12-13 13:41:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:41:52,581 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:41:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2071285937, now seen corresponding path program 1 times [2022-12-13 13:41:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411692219] [2022-12-13 13:41:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411692219] [2022-12-13 13:41:52,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411692219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:52,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:52,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207685005] [2022-12-13 13:41:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:52,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:52,728 INFO L87 Difference]: Start difference. First operand 2856 states and 4104 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:52,967 INFO L93 Difference]: Finished difference Result 5694 states and 8184 transitions. [2022-12-13 13:41:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-13 13:41:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:52,977 INFO L225 Difference]: With dead ends: 5694 [2022-12-13 13:41:52,977 INFO L226 Difference]: Without dead ends: 2862 [2022-12-13 13:41:52,980 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:41:52,981 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 136 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:52,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 169 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2022-12-13 13:41:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2856. [2022-12-13 13:41:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.431786216596343) internal successors, (4072), 2855 states have internal predecessors, (4072), 0 states have call successors, (0), 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:41:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4072 transitions. [2022-12-13 13:41:53,150 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4072 transitions. Word has length 57 [2022-12-13 13:41:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:53,151 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4072 transitions. [2022-12-13 13:41:53,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4072 transitions. [2022-12-13 13:41:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 13:41:53,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:53,152 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] [2022-12-13 13:41:53,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:41:53,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 275033619, now seen corresponding path program 1 times [2022-12-13 13:41:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:53,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033344474] [2022-12-13 13:41:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:41:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033344474] [2022-12-13 13:41:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033344474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:53,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:53,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807375409] [2022-12-13 13:41:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:53,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:53,228 INFO L87 Difference]: Start difference. First operand 2856 states and 4072 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:53,452 INFO L93 Difference]: Finished difference Result 3720 states and 5320 transitions. [2022-12-13 13:41:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:53,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-13 13:41:53,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:53,464 INFO L225 Difference]: With dead ends: 3720 [2022-12-13 13:41:53,464 INFO L226 Difference]: Without dead ends: 3717 [2022-12-13 13:41:53,465 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:41:53,466 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 99 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:53,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 219 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-12-13 13:41:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 2920. [2022-12-13 13:41:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2908 states have (on average 1.4429160935350756) internal successors, (4196), 2919 states have internal predecessors, (4196), 0 states have call successors, (0), 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:41:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4196 transitions. [2022-12-13 13:41:53,640 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4196 transitions. Word has length 58 [2022-12-13 13:41:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:53,641 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4196 transitions. [2022-12-13 13:41:53,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4196 transitions. [2022-12-13 13:41:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:41:53,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:53,642 INFO L195 NwaCegarLoop]: trace histogram [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:41:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:41:53,642 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:41:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -63892162, now seen corresponding path program 1 times [2022-12-13 13:41:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068041454] [2022-12-13 13:41:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:41:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:53,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068041454] [2022-12-13 13:41:53,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068041454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:53,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:53,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227760543] [2022-12-13 13:41:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:53,743 INFO L87 Difference]: Start difference. First operand 2920 states and 4196 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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:41:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:54,069 INFO L93 Difference]: Finished difference Result 8214 states and 11904 transitions. [2022-12-13 13:41:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 [2022-12-13 13:41:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:54,080 INFO L225 Difference]: With dead ends: 8214 [2022-12-13 13:41:54,080 INFO L226 Difference]: Without dead ends: 5318 [2022-12-13 13:41:54,083 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:41:54,083 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 243 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:54,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 210 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2022-12-13 13:41:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4624. [2022-12-13 13:41:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 4612 states have (on average 1.4501300954032958) internal successors, (6688), 4623 states have internal predecessors, (6688), 0 states have call successors, (0), 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:41:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6688 transitions. [2022-12-13 13:41:54,243 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6688 transitions. Word has length 59 [2022-12-13 13:41:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:54,244 INFO L495 AbstractCegarLoop]: Abstraction has 4624 states and 6688 transitions. [2022-12-13 13:41:54,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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:41:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6688 transitions. [2022-12-13 13:41:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 13:41:54,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:54,244 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] [2022-12-13 13:41:54,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:41:54,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1091923339, now seen corresponding path program 1 times [2022-12-13 13:41:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:54,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152071948] [2022-12-13 13:41:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:41:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:54,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152071948] [2022-12-13 13:41:54,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152071948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:54,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:54,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376441825] [2022-12-13 13:41:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:54,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:54,325 INFO L87 Difference]: Start difference. First operand 4624 states and 6688 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:54,578 INFO L93 Difference]: Finished difference Result 9623 states and 13836 transitions. [2022-12-13 13:41:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:41:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-13 13:41:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:54,589 INFO L225 Difference]: With dead ends: 9623 [2022-12-13 13:41:54,589 INFO L226 Difference]: Without dead ends: 5023 [2022-12-13 13:41:54,593 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:41:54,593 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 218 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:54,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 275 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2022-12-13 13:41:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4624. [2022-12-13 13:41:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 4612 states have (on average 1.440589765828274) internal successors, (6644), 4623 states have internal predecessors, (6644), 0 states have call successors, (0), 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:41:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6644 transitions. [2022-12-13 13:41:54,757 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6644 transitions. Word has length 60 [2022-12-13 13:41:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:54,757 INFO L495 AbstractCegarLoop]: Abstraction has 4624 states and 6644 transitions. [2022-12-13 13:41:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6644 transitions. [2022-12-13 13:41:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 13:41:54,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:54,758 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] [2022-12-13 13:41:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:41:54,759 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:41:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1980656779, now seen corresponding path program 1 times [2022-12-13 13:41:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332970272] [2022-12-13 13:41:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:41:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332970272] [2022-12-13 13:41:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332970272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697632591] [2022-12-13 13:41:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:54,844 INFO L87 Difference]: Start difference. First operand 4624 states and 6644 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:55,145 INFO L93 Difference]: Finished difference Result 9227 states and 13296 transitions. [2022-12-13 13:41:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-13 13:41:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:55,153 INFO L225 Difference]: With dead ends: 9227 [2022-12-13 13:41:55,153 INFO L226 Difference]: Without dead ends: 5415 [2022-12-13 13:41:55,156 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:41:55,157 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 210 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:55,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2022-12-13 13:41:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5412. [2022-12-13 13:41:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5400 states have (on average 1.4103703703703703) internal successors, (7616), 5411 states have internal predecessors, (7616), 0 states have call successors, (0), 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:41:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7616 transitions. [2022-12-13 13:41:55,345 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7616 transitions. Word has length 60 [2022-12-13 13:41:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:55,345 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 7616 transitions. [2022-12-13 13:41:55,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7616 transitions. [2022-12-13 13:41:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 13:41:55,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:55,346 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] [2022-12-13 13:41:55,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:41:55,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -998722173, now seen corresponding path program 1 times [2022-12-13 13:41:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:55,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572870867] [2022-12-13 13:41:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:55,416 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:41:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:55,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572870867] [2022-12-13 13:41:55,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572870867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:55,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:55,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002057145] [2022-12-13 13:41:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:55,418 INFO L87 Difference]: Start difference. First operand 5412 states and 7616 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:55,632 INFO L93 Difference]: Finished difference Result 5415 states and 7616 transitions. [2022-12-13 13:41:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-13 13:41:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:55,641 INFO L225 Difference]: With dead ends: 5415 [2022-12-13 13:41:55,641 INFO L226 Difference]: Without dead ends: 5412 [2022-12-13 13:41:55,642 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:41:55,643 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 95 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:55,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 172 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:41:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2022-12-13 13:41:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5409. [2022-12-13 13:41:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 5400 states have (on average 1.3837037037037037) internal successors, (7472), 5408 states have internal predecessors, (7472), 0 states have call successors, (0), 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:41:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7472 transitions. [2022-12-13 13:41:55,862 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7472 transitions. Word has length 60 [2022-12-13 13:41:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:55,862 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7472 transitions. [2022-12-13 13:41:55,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7472 transitions. [2022-12-13 13:41:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 13:41:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:55,863 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] [2022-12-13 13:41:55,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:41:55,864 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -895616052, now seen corresponding path program 1 times [2022-12-13 13:41:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:55,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675673427] [2022-12-13 13:41:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:55,924 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:41:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:55,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675673427] [2022-12-13 13:41:55,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675673427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:55,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:55,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799050753] [2022-12-13 13:41:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:55,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:55,926 INFO L87 Difference]: Start difference. First operand 5409 states and 7472 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:56,169 INFO L93 Difference]: Finished difference Result 7122 states and 9968 transitions. [2022-12-13 13:41:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 61 [2022-12-13 13:41:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:56,176 INFO L225 Difference]: With dead ends: 7122 [2022-12-13 13:41:56,176 INFO L226 Difference]: Without dead ends: 7119 [2022-12-13 13:41:56,178 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:41:56,178 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 96 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:56,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 212 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7119 states. [2022-12-13 13:41:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7119 to 7113. [2022-12-13 13:41:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7104 states have (on average 1.382882882882883) internal successors, (9824), 7112 states have internal predecessors, (9824), 0 states have call successors, (0), 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:41:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9824 transitions. [2022-12-13 13:41:56,398 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9824 transitions. Word has length 61 [2022-12-13 13:41:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:56,398 INFO L495 AbstractCegarLoop]: Abstraction has 7113 states and 9824 transitions. [2022-12-13 13:41:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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:41:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9824 transitions. [2022-12-13 13:41:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 13:41:56,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:56,399 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:41:56,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:41:56,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1994293595, now seen corresponding path program 1 times [2022-12-13 13:41:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:56,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681798784] [2022-12-13 13:41:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:56,454 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:41:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681798784] [2022-12-13 13:41:56,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681798784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:56,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:56,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166376814] [2022-12-13 13:41:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:56,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:56,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:56,456 INFO L87 Difference]: Start difference. First operand 7113 states and 9824 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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:41:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:56,804 INFO L93 Difference]: Finished difference Result 13493 states and 19124 transitions. [2022-12-13 13:41:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:56,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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 62 [2022-12-13 13:41:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:56,814 INFO L225 Difference]: With dead ends: 13493 [2022-12-13 13:41:56,814 INFO L226 Difference]: Without dead ends: 8372 [2022-12-13 13:41:56,819 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:41:56,819 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 246 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:56,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 212 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2022-12-13 13:41:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 6937. [2022-12-13 13:41:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6937 states, 6928 states have (on average 1.388568129330254) internal successors, (9620), 6936 states have internal predecessors, (9620), 0 states have call successors, (0), 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:41:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9620 transitions. [2022-12-13 13:41:57,134 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9620 transitions. Word has length 62 [2022-12-13 13:41:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:57,134 INFO L495 AbstractCegarLoop]: Abstraction has 6937 states and 9620 transitions. [2022-12-13 13:41:57,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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:41:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9620 transitions. [2022-12-13 13:41:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 13:41:57,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:57,135 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] [2022-12-13 13:41:57,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:41:57,135 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1693559058, now seen corresponding path program 1 times [2022-12-13 13:41:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:57,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710205142] [2022-12-13 13:41:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:57,191 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:41:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710205142] [2022-12-13 13:41:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710205142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:57,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:57,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353666359] [2022-12-13 13:41:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:57,193 INFO L87 Difference]: Start difference. First operand 6937 states and 9620 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:41:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:57,524 INFO L93 Difference]: Finished difference Result 11777 states and 16588 transitions. [2022-12-13 13:41:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:57,524 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 63 [2022-12-13 13:41:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:57,535 INFO L225 Difference]: With dead ends: 11777 [2022-12-13 13:41:57,535 INFO L226 Difference]: Without dead ends: 7224 [2022-12-13 13:41:57,540 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:41:57,541 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 204 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:57,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 300 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2022-12-13 13:41:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7221. [2022-12-13 13:41:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7221 states, 7212 states have (on average 1.3838047698280644) internal successors, (9980), 7220 states have internal predecessors, (9980), 0 states have call successors, (0), 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:41:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7221 states to 7221 states and 9980 transitions. [2022-12-13 13:41:57,889 INFO L78 Accepts]: Start accepts. Automaton has 7221 states and 9980 transitions. Word has length 63 [2022-12-13 13:41:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:57,889 INFO L495 AbstractCegarLoop]: Abstraction has 7221 states and 9980 transitions. [2022-12-13 13:41:57,889 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:41:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7221 states and 9980 transitions. [2022-12-13 13:41:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 13:41:57,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:57,890 INFO L195 NwaCegarLoop]: trace histogram [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:41:57,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:41:57,890 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:41:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1429008381, now seen corresponding path program 1 times [2022-12-13 13:41:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:57,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878776216] [2022-12-13 13:41:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:41:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878776216] [2022-12-13 13:41:57,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878776216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:57,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:57,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088324634] [2022-12-13 13:41:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:57,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:57,952 INFO L87 Difference]: Start difference. First operand 7221 states and 9980 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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:41:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:58,306 INFO L93 Difference]: Finished difference Result 7619 states and 10512 transitions. [2022-12-13 13:41:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:58,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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 64 [2022-12-13 13:41:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:58,313 INFO L225 Difference]: With dead ends: 7619 [2022-12-13 13:41:58,313 INFO L226 Difference]: Without dead ends: 7616 [2022-12-13 13:41:58,314 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:41:58,314 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 164 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:58,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 278 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2022-12-13 13:41:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7613. [2022-12-13 13:41:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7604 states have (on average 1.374013677012099) internal successors, (10448), 7612 states have internal predecessors, (10448), 0 states have call successors, (0), 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:41:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 10448 transitions. [2022-12-13 13:41:58,623 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 10448 transitions. Word has length 64 [2022-12-13 13:41:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:58,624 INFO L495 AbstractCegarLoop]: Abstraction has 7613 states and 10448 transitions. [2022-12-13 13:41:58,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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:41:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 10448 transitions. [2022-12-13 13:41:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 13:41:58,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:58,625 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] [2022-12-13 13:41:58,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:41:58,625 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -433416492, now seen corresponding path program 1 times [2022-12-13 13:41:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:58,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277672818] [2022-12-13 13:41:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:58,703 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:41:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277672818] [2022-12-13 13:41:58,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277672818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:58,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:58,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120219848] [2022-12-13 13:41:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:58,705 INFO L87 Difference]: Start difference. First operand 7613 states and 10448 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:59,113 INFO L93 Difference]: Finished difference Result 9897 states and 13776 transitions. [2022-12-13 13:41:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-12-13 13:41:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:59,121 INFO L225 Difference]: With dead ends: 9897 [2022-12-13 13:41:59,122 INFO L226 Difference]: Without dead ends: 9894 [2022-12-13 13:41:59,124 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:41:59,124 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 123 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:59,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 329 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2022-12-13 13:41:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9317. [2022-12-13 13:41:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9317 states, 9308 states have (on average 1.3596905887408681) internal successors, (12656), 9316 states have internal predecessors, (12656), 0 states have call successors, (0), 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:41:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12656 transitions. [2022-12-13 13:41:59,428 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12656 transitions. Word has length 65 [2022-12-13 13:41:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:59,429 INFO L495 AbstractCegarLoop]: Abstraction has 9317 states and 12656 transitions. [2022-12-13 13:41:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12656 transitions. [2022-12-13 13:41:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 13:41:59,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:59,429 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] [2022-12-13 13:41:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:41:59,430 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:41:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:59,430 INFO L85 PathProgramCache]: Analyzing trace with hash -551009123, now seen corresponding path program 1 times [2022-12-13 13:41:59,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:59,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171285996] [2022-12-13 13:41:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:59,488 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:41:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:59,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171285996] [2022-12-13 13:41:59,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171285996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:59,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:59,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651023072] [2022-12-13 13:41:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:59,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:59,490 INFO L87 Difference]: Start difference. First operand 9317 states and 12656 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:41:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:59,854 INFO L93 Difference]: Finished difference Result 11343 states and 15424 transitions. [2022-12-13 13:41:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:59,855 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 66 [2022-12-13 13:41:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:59,860 INFO L225 Difference]: With dead ends: 11343 [2022-12-13 13:41:59,860 INFO L226 Difference]: Without dead ends: 7361 [2022-12-13 13:41:59,863 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:41:59,863 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 141 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:59,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 253 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:41:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2022-12-13 13:42:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 5529. [2022-12-13 13:42:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5529 states, 5520 states have (on average 1.344927536231884) internal successors, (7424), 5528 states have internal predecessors, (7424), 0 states have call successors, (0), 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:42:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 7424 transitions. [2022-12-13 13:42:00,072 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 7424 transitions. Word has length 66 [2022-12-13 13:42:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:00,072 INFO L495 AbstractCegarLoop]: Abstraction has 5529 states and 7424 transitions. [2022-12-13 13:42:00,072 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:42:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 7424 transitions. [2022-12-13 13:42:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 13:42:00,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:00,073 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-12-13 13:42:00,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:42:00,073 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:42:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 987320054, now seen corresponding path program 1 times [2022-12-13 13:42:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156457443] [2022-12-13 13:42:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:00,146 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:42:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:00,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156457443] [2022-12-13 13:42:00,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156457443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:00,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:00,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816246126] [2022-12-13 13:42:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:00,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:00,147 INFO L87 Difference]: Start difference. First operand 5529 states and 7424 transitions. Second operand has 5 states, 4 states have (on average 16.5) 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:42:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:00,471 INFO L93 Difference]: Finished difference Result 5819 states and 7816 transitions. [2022-12-13 13:42:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) 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 67 [2022-12-13 13:42:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:00,478 INFO L225 Difference]: With dead ends: 5819 [2022-12-13 13:42:00,478 INFO L226 Difference]: Without dead ends: 5816 [2022-12-13 13:42:00,480 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:42:00,480 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 139 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:00,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 349 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2022-12-13 13:42:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5813. [2022-12-13 13:42:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5813 states, 5804 states have (on average 1.3425223983459682) internal successors, (7792), 5812 states have internal predecessors, (7792), 0 states have call successors, (0), 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:42:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 7792 transitions. [2022-12-13 13:42:00,752 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 7792 transitions. Word has length 67 [2022-12-13 13:42:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:00,752 INFO L495 AbstractCegarLoop]: Abstraction has 5813 states and 7792 transitions. [2022-12-13 13:42:00,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) 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:42:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 7792 transitions. [2022-12-13 13:42:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 13:42:00,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:00,753 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-12-13 13:42:00,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:42:00,753 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:42:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash 98586614, now seen corresponding path program 1 times [2022-12-13 13:42:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:00,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617254384] [2022-12-13 13:42:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:00,820 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:42:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617254384] [2022-12-13 13:42:00,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617254384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:00,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073817809] [2022-12-13 13:42:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:00,822 INFO L87 Difference]: Start difference. First operand 5813 states and 7792 transitions. Second operand has 5 states, 4 states have (on average 16.5) 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:42:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:01,205 INFO L93 Difference]: Finished difference Result 6863 states and 9288 transitions. [2022-12-13 13:42:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) 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 67 [2022-12-13 13:42:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:01,211 INFO L225 Difference]: With dead ends: 6863 [2022-12-13 13:42:01,211 INFO L226 Difference]: Without dead ends: 6862 [2022-12-13 13:42:01,212 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:42:01,212 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 137 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:01,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 361 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6862 states. [2022-12-13 13:42:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6862 to 6853. [2022-12-13 13:42:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6844 states have (on average 1.3559322033898304) internal successors, (9280), 6852 states have internal predecessors, (9280), 0 states have call successors, (0), 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:42:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 9280 transitions. [2022-12-13 13:42:01,478 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 9280 transitions. Word has length 67 [2022-12-13 13:42:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:01,479 INFO L495 AbstractCegarLoop]: Abstraction has 6853 states and 9280 transitions. [2022-12-13 13:42:01,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) 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:42:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 9280 transitions. [2022-12-13 13:42:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 13:42:01,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:01,480 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:42:01,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:42:01,480 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:42:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1971878914, now seen corresponding path program 1 times [2022-12-13 13:42:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89865500] [2022-12-13 13:42:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:01,533 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:42:01,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89865500] [2022-12-13 13:42:01,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89865500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:01,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:01,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953803465] [2022-12-13 13:42:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:01,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:01,535 INFO L87 Difference]: Start difference. First operand 6853 states and 9280 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:42:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:01,916 INFO L93 Difference]: Finished difference Result 7046 states and 9528 transitions. [2022-12-13 13:42:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:01,917 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:42:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:01,922 INFO L225 Difference]: With dead ends: 7046 [2022-12-13 13:42:01,922 INFO L226 Difference]: Without dead ends: 6669 [2022-12-13 13:42:01,923 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:42:01,924 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 136 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:01,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 383 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2022-12-13 13:42:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6665. [2022-12-13 13:42:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6656 states have (on average 1.3551682692307692) internal successors, (9020), 6664 states have internal predecessors, (9020), 0 states have call successors, (0), 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:42:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9020 transitions. [2022-12-13 13:42:02,175 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9020 transitions. Word has length 71 [2022-12-13 13:42:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:02,175 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9020 transitions. [2022-12-13 13:42:02,175 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:42:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9020 transitions. [2022-12-13 13:42:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 13:42:02,177 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:02,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2022-12-13 13:42:02,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:42:02,177 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 13:42:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash -115998817, now seen corresponding path program 1 times [2022-12-13 13:42:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:02,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948499268] [2022-12-13 13:42:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:42:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:02,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948499268] [2022-12-13 13:42:02,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948499268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:02,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:02,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:42:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871767025] [2022-12-13 13:42:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:42:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:42:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:42:02,226 INFO L87 Difference]: Start difference. First operand 6665 states and 9020 transitions. Second operand has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:02,533 INFO L93 Difference]: Finished difference Result 6859 states and 9264 transitions. [2022-12-13 13:42:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:42:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-12-13 13:42:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:02,539 INFO L225 Difference]: With dead ends: 6859 [2022-12-13 13:42:02,539 INFO L226 Difference]: Without dead ends: 6856 [2022-12-13 13:42:02,540 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:42:02,540 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:02,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 270 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2022-12-13 13:42:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6662. [2022-12-13 13:42:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6656 states have (on average 1.3191105769230769) internal successors, (8780), 6661 states have internal predecessors, (8780), 0 states have call successors, (0), 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:42:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 8780 transitions. [2022-12-13 13:42:02,799 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 8780 transitions. Word has length 85 [2022-12-13 13:42:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:02,799 INFO L495 AbstractCegarLoop]: Abstraction has 6662 states and 8780 transitions. [2022-12-13 13:42:02,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 8780 transitions. [2022-12-13 13:42:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 13:42:02,801 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:02,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 13:42:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:42:02,802 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:42:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 654927334, now seen corresponding path program 1 times [2022-12-13 13:42:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673381685] [2022-12-13 13:42:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:42:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673381685] [2022-12-13 13:42:02,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673381685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:02,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:02,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407373148] [2022-12-13 13:42:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:02,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:02,863 INFO L87 Difference]: Start difference. First operand 6662 states and 8780 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:03,174 INFO L93 Difference]: Finished difference Result 7057 states and 9280 transitions. [2022-12-13 13:42:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-12-13 13:42:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:03,179 INFO L225 Difference]: With dead ends: 7057 [2022-12-13 13:42:03,179 INFO L226 Difference]: Without dead ends: 7054 [2022-12-13 13:42:03,181 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:42:03,181 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 119 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:03,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 356 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2022-12-13 13:42:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6270. [2022-12-13 13:42:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6270 states, 6264 states have (on average 1.3167305236270754) internal successors, (8248), 6269 states have internal predecessors, (8248), 0 states have call successors, (0), 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:42:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8248 transitions. [2022-12-13 13:42:03,532 INFO L78 Accepts]: Start accepts. Automaton has 6270 states and 8248 transitions. Word has length 86 [2022-12-13 13:42:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:03,532 INFO L495 AbstractCegarLoop]: Abstraction has 6270 states and 8248 transitions. [2022-12-13 13:42:03,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6270 states and 8248 transitions. [2022-12-13 13:42:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 13:42:03,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:03,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-12-13 13:42:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:42:03,535 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:42:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 194294273, now seen corresponding path program 1 times [2022-12-13 13:42:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356265236] [2022-12-13 13:42:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:42:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:03,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356265236] [2022-12-13 13:42:03,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356265236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:03,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:03,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022535969] [2022-12-13 13:42:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:03,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:03,608 INFO L87 Difference]: Start difference. First operand 6270 states and 8248 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:42:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:04,028 INFO L93 Difference]: Finished difference Result 9597 states and 12728 transitions. [2022-12-13 13:42:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 87 [2022-12-13 13:42:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:04,032 INFO L225 Difference]: With dead ends: 9597 [2022-12-13 13:42:04,032 INFO L226 Difference]: Without dead ends: 5791 [2022-12-13 13:42:04,034 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:42:04,035 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 138 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:04,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 457 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2022-12-13 13:42:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5782. [2022-12-13 13:42:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5776 states have (on average 1.3109418282548477) internal successors, (7572), 5781 states have internal predecessors, (7572), 0 states have call successors, (0), 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:42:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7572 transitions. [2022-12-13 13:42:04,268 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7572 transitions. Word has length 87 [2022-12-13 13:42:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:04,268 INFO L495 AbstractCegarLoop]: Abstraction has 5782 states and 7572 transitions. [2022-12-13 13:42:04,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:42:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7572 transitions. [2022-12-13 13:42:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 13:42:04,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:04,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-12-13 13:42:04,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:42:04,271 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:42:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash -907513413, now seen corresponding path program 2 times [2022-12-13 13:42:04,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:04,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067933282] [2022-12-13 13:42:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:42:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067933282] [2022-12-13 13:42:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067933282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:04,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:04,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497610278] [2022-12-13 13:42:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:04,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:04,345 INFO L87 Difference]: Start difference. First operand 5782 states and 7572 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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:42:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:04,656 INFO L93 Difference]: Finished difference Result 5977 states and 7816 transitions. [2022-12-13 13:42:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 87 [2022-12-13 13:42:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:04,660 INFO L225 Difference]: With dead ends: 5977 [2022-12-13 13:42:04,660 INFO L226 Difference]: Without dead ends: 5032 [2022-12-13 13:42:04,661 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:42:04,661 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:04,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 335 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2022-12-13 13:42:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 5026. [2022-12-13 13:42:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 5020 states have (on average 1.3123505976095617) internal successors, (6588), 5025 states have internal predecessors, (6588), 0 states have call successors, (0), 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:42:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6588 transitions. [2022-12-13 13:42:04,843 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6588 transitions. Word has length 87 [2022-12-13 13:42:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:04,843 INFO L495 AbstractCegarLoop]: Abstraction has 5026 states and 6588 transitions. [2022-12-13 13:42:04,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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:42:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6588 transitions. [2022-12-13 13:42:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 13:42:04,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:04,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:04,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 13:42:04,845 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:42:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 435812822, now seen corresponding path program 1 times [2022-12-13 13:42:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:04,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366070193] [2022-12-13 13:42:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:42:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:04,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366070193] [2022-12-13 13:42:04,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366070193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:04,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:04,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674075936] [2022-12-13 13:42:04,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:04,904 INFO L87 Difference]: Start difference. First operand 5026 states and 6588 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:42:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:05,149 INFO L93 Difference]: Finished difference Result 6119 states and 8046 transitions. [2022-12-13 13:42:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:05,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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 88 [2022-12-13 13:42:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:05,151 INFO L225 Difference]: With dead ends: 6119 [2022-12-13 13:42:05,151 INFO L226 Difference]: Without dead ends: 3369 [2022-12-13 13:42:05,153 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:42:05,153 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 103 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 261 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-12-13 13:42:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3031. [2022-12-13 13:42:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 3028 states have (on average 1.2642007926023777) internal successors, (3828), 3030 states have internal predecessors, (3828), 0 states have call successors, (0), 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:42:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3828 transitions. [2022-12-13 13:42:05,283 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3828 transitions. Word has length 88 [2022-12-13 13:42:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:05,283 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 3828 transitions. [2022-12-13 13:42:05,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:42:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3828 transitions. [2022-12-13 13:42:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 13:42:05,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:05,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:42:05,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 13:42:05,284 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:42:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1304386851, now seen corresponding path program 1 times [2022-12-13 13:42:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:05,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555885327] [2022-12-13 13:42:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:42:05,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:05,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555885327] [2022-12-13 13:42:05,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555885327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:05,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:05,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138064471] [2022-12-13 13:42:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:05,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:05,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:05,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:05,344 INFO L87 Difference]: Start difference. First operand 3031 states and 3828 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:42:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:05,539 INFO L93 Difference]: Finished difference Result 3032 states and 3828 transitions. [2022-12-13 13:42:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 13:42:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:05,542 INFO L225 Difference]: With dead ends: 3032 [2022-12-13 13:42:05,542 INFO L226 Difference]: Without dead ends: 3029 [2022-12-13 13:42:05,542 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:42:05,542 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:05,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 343 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2022-12-13 13:42:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2022-12-13 13:42:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.2562747688243066) internal successors, (3804), 3028 states have internal predecessors, (3804), 0 states have call successors, (0), 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:42:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3804 transitions. [2022-12-13 13:42:05,724 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3804 transitions. Word has length 89 [2022-12-13 13:42:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:05,724 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 3804 transitions. [2022-12-13 13:42:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:42:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3804 transitions. [2022-12-13 13:42:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 13:42:05,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:05,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:42:05,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 13:42:05,726 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:42:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 625295837, now seen corresponding path program 1 times [2022-12-13 13:42:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:05,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711503907] [2022-12-13 13:42:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:42:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711503907] [2022-12-13 13:42:05,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711503907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:05,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:05,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389660029] [2022-12-13 13:42:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:05,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:05,780 INFO L87 Difference]: Start difference. First operand 3029 states and 3804 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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:42:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:05,975 INFO L93 Difference]: Finished difference Result 3030 states and 3804 transitions. [2022-12-13 13:42:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 13:42:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:05,977 INFO L225 Difference]: With dead ends: 3030 [2022-12-13 13:42:05,977 INFO L226 Difference]: Without dead ends: 3029 [2022-12-13 13:42:05,977 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:42:05,978 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 92 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:05,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 312 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:42:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2022-12-13 13:42:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2022-12-13 13:42:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.2536327608982827) internal successors, (3796), 3028 states have internal predecessors, (3796), 0 states have call successors, (0), 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:42:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3796 transitions. [2022-12-13 13:42:06,107 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3796 transitions. Word has length 89 [2022-12-13 13:42:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:06,107 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 3796 transitions. [2022-12-13 13:42:06,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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:42:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3796 transitions. [2022-12-13 13:42:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 13:42:06,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:06,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:06,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:42:06,109 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:42:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1646070885, now seen corresponding path program 1 times [2022-12-13 13:42:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:06,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659810302] [2022-12-13 13:42:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:42:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:06,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659810302] [2022-12-13 13:42:06,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659810302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:06,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:06,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:06,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604455440] [2022-12-13 13:42:06,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:06,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:06,167 INFO L87 Difference]: Start difference. First operand 3029 states and 3796 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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:42:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:06,415 INFO L93 Difference]: Finished difference Result 3219 states and 4036 transitions. [2022-12-13 13:42:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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 93 [2022-12-13 13:42:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:06,417 INFO L225 Difference]: With dead ends: 3219 [2022-12-13 13:42:06,417 INFO L226 Difference]: Without dead ends: 2746 [2022-12-13 13:42:06,418 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:42:06,418 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:06,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 513 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-12-13 13:42:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2557. [2022-12-13 13:42:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.242566510172144) internal successors, (3176), 2556 states have internal predecessors, (3176), 0 states have call successors, (0), 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:42:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3176 transitions. [2022-12-13 13:42:06,521 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3176 transitions. Word has length 93 [2022-12-13 13:42:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:06,521 INFO L495 AbstractCegarLoop]: Abstraction has 2557 states and 3176 transitions. [2022-12-13 13:42:06,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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:42:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3176 transitions. [2022-12-13 13:42:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 13:42:06,523 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:06,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:06,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 13:42:06,523 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:42:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1464653211, now seen corresponding path program 2 times [2022-12-13 13:42:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734400939] [2022-12-13 13:42:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:42:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734400939] [2022-12-13 13:42:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734400939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:06,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:06,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272314727] [2022-12-13 13:42:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:06,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:06,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:06,579 INFO L87 Difference]: Start difference. First operand 2557 states and 3176 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 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:42:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:06,764 INFO L93 Difference]: Finished difference Result 2558 states and 3176 transitions. [2022-12-13 13:42:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:06,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 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 93 [2022-12-13 13:42:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:06,766 INFO L225 Difference]: With dead ends: 2558 [2022-12-13 13:42:06,766 INFO L226 Difference]: Without dead ends: 1789 [2022-12-13 13:42:06,767 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:42:06,767 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 102 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:06,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 490 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:42:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-12-13 13:42:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2022-12-13 13:42:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1788 states have (on average 1.2348993288590604) internal successors, (2208), 1788 states have internal predecessors, (2208), 0 states have call successors, (0), 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:42:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2208 transitions. [2022-12-13 13:42:06,838 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2208 transitions. Word has length 93 [2022-12-13 13:42:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:06,838 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2208 transitions. [2022-12-13 13:42:06,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 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:42:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2208 transitions. [2022-12-13 13:42:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-13 13:42:06,839 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:06,840 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:06,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 13:42:06,840 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:42:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash -168843784, now seen corresponding path program 1 times [2022-12-13 13:42:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:06,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481796822] [2022-12-13 13:42:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:42:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481796822] [2022-12-13 13:42:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481796822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:06,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:06,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:42:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103788512] [2022-12-13 13:42:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:06,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:06,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:06,908 INFO L87 Difference]: Start difference. First operand 1789 states and 2208 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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:42:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:07,048 INFO L93 Difference]: Finished difference Result 1789 states and 2208 transitions. [2022-12-13 13:42:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 109 [2022-12-13 13:42:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:07,049 INFO L225 Difference]: With dead ends: 1789 [2022-12-13 13:42:07,049 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 13:42:07,049 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:42:07,050 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 103 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:07,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 408 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:42:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 13:42:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 13:42:07,050 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:42:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 13:42:07,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-12-13 13:42:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:07,050 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:42:07,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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:42:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:42:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 13:42:07,052 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-13 13:42:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-13 13:42:07,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-13 13:42:07,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 13:42:07,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 13:42:12,084 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 642 DAG size of output: 626 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:42:18,473 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 643 DAG size of output: 627 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:42:23,738 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 674 DAG size of output: 658 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:42:29,359 WARN L233 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 702 DAG size of output: 686 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:42:34,575 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 670 DAG size of output: 654 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 159) no Hoare annotation was computed. [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2022-12-13 13:42:55,438 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L219-1(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L219-2(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 122) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L219-3(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L219-4(lines 219 223) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 201) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 137 201) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 103) no Hoare annotation was computed. [2022-12-13 13:42:55,439 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-12-13 13:42:55,440 INFO L895 garLoopResultBuilder]: At program point L88-2(lines 82 106) 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:42:55,440 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 198) no Hoare annotation was computed. [2022-12-13 13:42:55,440 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-12-13 13:42:55,440 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 195) no Hoare annotation was computed. [2022-12-13 13:42:55,440 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 78) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 51 81) 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:42:55,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 192) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 98) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 91 98) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 189) no Hoare annotation was computed. [2022-12-13 13:42:55,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 97) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 186) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 183) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 233 279) the Hoare annotation is: false [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L210-1(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 180) no Hoare annotation was computed. [2022-12-13 13:42:55,442 INFO L899 garLoopResultBuilder]: For program point L210-2(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L210-3(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L210-4(lines 210 229) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L210-5(lines 210 229) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 226) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 177) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 174) no Hoare annotation was computed. [2022-12-13 13:42:55,443 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 128) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L895 garLoopResultBuilder]: At program point L113-2(lines 107 131) 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:42:55,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L895 garLoopResultBuilder]: At program point L262-2(lines 262 276) 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:42:55,444 INFO L899 garLoopResultBuilder]: For program point L262-3(lines 262 276) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 64 73) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 171) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-12-13 13:42:55,444 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 291) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 168) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L214-2(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L214-3(line 214) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point L214-4(lines 214 226) no Hoare annotation was computed. [2022-12-13 13:42:55,445 INFO L895 garLoopResultBuilder]: At program point $Ultimate##103(lines 216 223) the Hoare annotation is: (let ((.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (<= 0 ~st2~0)) (.cse3 (let ((.cse5 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse6 (<= ~st1~0 0)) (.cse7 (<= 0 ~st1~0))) (or (let ((.cse8 (+ ~st2~0 ~st1~0))) (and .cse5 .cse6 .cse7 (<= .cse8 0) (<= 0 .cse8))) (and (= ~st2~0 1) .cse5 .cse6 .cse7))))) (or (and .cse0 .cse1 .cse2 (<= ~st2~0 0)) (and .cse2 .cse3) (and .cse0 .cse1 (<= (+ ~st3~0 ~st2~0) 0) (<= 0 ~st3~0)) (let ((.cse4 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse4) .cse3 (<= .cse4 0))))) [2022-12-13 13:42:55,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 165) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 123) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 116 123) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L895 garLoopResultBuilder]: At program point check_returnLabel#1(lines 205 232) 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:42:55,446 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 162) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2022-12-13 13:42:55,446 INFO L895 garLoopResultBuilder]: At program point init_returnLabel#1(lines 132 204) the Hoare annotation is: (or (and (= |ULTIMATE.start_init_~tmp~0#1| 0) (= |ULTIMATE.start_init_#res#1| 0)) (and (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= (* 256 (div ~mode1~0 256)) ~mode1~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= ~st2~0 0) (<= (+ ~st3~0 ~st1~0) 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 (+ ~st2~0 ~st1~0)) (<= 0 ~st3~0))) [2022-12-13 13:42:55,446 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2022-12-13 13:42:55,449 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:42:55,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:42:55,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:42:55 BoogieIcfgContainer [2022-12-13 13:42:55,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:42:55,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:42:55,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:42:55,472 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:42:55,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:41:50" (3/4) ... [2022-12-13 13:42:55,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 13:42:55,487 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 13:42:55,487 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 13:42:55,488 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 13:42:55,488 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 13:42:55,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) [2022-12-13 13:42:55,530 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:42:55,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:42:55,531 INFO L158 Benchmark]: Toolchain (without parser) took 65922.74ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 144.6MB in the beginning and 1.0GB in the end (delta: -861.8MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,531 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:42:55,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.33ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 129.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,532 INFO L158 Benchmark]: Boogie Preprocessor took 20.24ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,532 INFO L158 Benchmark]: RCFGBuilder took 376.08ms. Allocated memory is still 172.0MB. Free memory was 127.8MB in the beginning and 108.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,532 INFO L158 Benchmark]: TraceAbstraction took 65234.24ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 108.2MB in the beginning and 1.0GB in the end (delta: -903.4MB). Peak memory consumption was 636.5MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,532 INFO L158 Benchmark]: Witness Printer took 58.57ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:42:55,533 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.11ms. Allocated memory is still 113.2MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.33ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 129.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.24ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.08ms. Allocated memory is still 172.0MB. Free memory was 127.8MB in the beginning and 108.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 65234.24ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 108.2MB in the beginning and 1.0GB in the end (delta: -903.4MB). Peak memory consumption was 636.5MB. Max. memory is 16.1GB. * Witness Printer took 58.57ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: 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, 84 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5109 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5109 mSDsluCounter, 9907 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5161 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3525 IncrementalHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 4746 mSDtfsCounter, 3525 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9317occurred in iteration=21, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 7602 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 882 NumberOfFragments, 923 HoareAnnotationTreeSize, 8 FomulaSimplifications, 78742 FormulaSimplificationTreeSizeReduction, 27.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 245110 FormulaSimplificationTreeSizeReductionInter, 20.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2160 NumberOfCodeBlocks, 2160 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2125 ConstructedInterpolants, 0 QuantifiedInterpolants, 8417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 619/619 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: 205]: 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: 216]: Loop Invariant Derived loop invariant: (((((st1 == 1 && 0 <= st2) && st3 == 1) && 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) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: 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: 82]: 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: 107]: 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: 132]: Loop Invariant Derived loop invariant: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) - InvariantResult [Line: 51]: 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:42:55,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b5701e-e4b5-4bfb-8cd9-6087ef5f5483/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