./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R --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 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f --- 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-38b53e6 [2022-11-25 16:58:25,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:58:25,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:58:25,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:58:25,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:58:25,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:58:25,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:58:25,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:58:25,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:58:25,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:58:25,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:58:25,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:58:25,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:58:25,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:58:25,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:58:25,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:58:25,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:58:25,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:58:25,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:58:25,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:58:25,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:58:25,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:58:25,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:58:25,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:58:25,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:58:25,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:58:25,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:58:25,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:58:25,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:58:25,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:58:25,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:58:25,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:58:25,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:58:25,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:58:25,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:58:25,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:58:25,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:58:25,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:58:25,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:58:25,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:58:25,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:58:25,858 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 16:58:25,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:58:25,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:58:25,883 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:58:25,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:58:25,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:58:25,884 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:58:25,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:58:25,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:58:25,885 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:58:25,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:58:25,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:58:25,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:58:25,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:58:25,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:58:25,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:58:25,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:58:25,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:58:25,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:58:25,888 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:58:25,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:58:25,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:58:25,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:58:25,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:58:25,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:58:25,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:58:25,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:58:25,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:25,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:58:25,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:58:25,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:58:25,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:58:25,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:58:25,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:58:25,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:58:25,891 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:58:25,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:58:25,891 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_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/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_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R 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 -> 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f [2022-11-25 16:58:26,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:58:26,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:58:26,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:58:26,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:58:26,220 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:58:26,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-25 16:58:29,452 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:58:29,800 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:58:29,801 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-25 16:58:29,809 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/data/4603cb329/2da40bac08714d03b7c638d3d4ec3f78/FLAGcc9f15d35 [2022-11-25 16:58:29,824 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/data/4603cb329/2da40bac08714d03b7c638d3d4ec3f78 [2022-11-25 16:58:29,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:58:29,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:58:29,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:29,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:58:29,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:58:29,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:29" (1/1) ... [2022-11-25 16:58:29,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d9dcac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:29, skipping insertion in model container [2022-11-25 16:58:29,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:29" (1/1) ... [2022-11-25 16:58:29,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:58:29,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:58:30,141 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_1a170739-3f19-4f07-9151-0fc7be6a18b3/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2022-11-25 16:58:30,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:30,166 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:58:30,205 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_1a170739-3f19-4f07-9151-0fc7be6a18b3/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2022-11-25 16:58:30,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:30,221 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:58:30,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30 WrapperNode [2022-11-25 16:58:30,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:30,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:30,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:58:30,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:58:30,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,292 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2022-11-25 16:58:30,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:30,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:58:30,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:58:30,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:58:30,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:58:30,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:58:30,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:58:30,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:58:30,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (1/1) ... [2022-11-25 16:58:30,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:30,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:30,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:58:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:58:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:58:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:58:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:58:30,519 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:58:30,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:58:30,875 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:58:30,883 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:58:30,883 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:58:30,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:30 BoogieIcfgContainer [2022-11-25 16:58:30,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:58:30,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:58:30,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:58:30,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:58:30,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:58:29" (1/3) ... [2022-11-25 16:58:30,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c68f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:30, skipping insertion in model container [2022-11-25 16:58:30,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:30" (2/3) ... [2022-11-25 16:58:30,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c68f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:30, skipping insertion in model container [2022-11-25 16:58:30,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:30" (3/3) ... [2022-11-25 16:58:30,897 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-25 16:58:30,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:58:30,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 16:58:30,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:58:30,990 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;@288b2ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:58:30,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 16:58:30,996 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-11-25 16:58:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 16:58:31,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:31,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:31,019 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-11-25 16:58:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -524468693, now seen corresponding path program 1 times [2022-11-25 16:58:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:31,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248402375] [2022-11-25 16:58:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248402375] [2022-11-25 16:58:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248402375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:31,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:31,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:58:31,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345836750] [2022-11-25 16:58:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:31,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:58:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:58:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:58:31,287 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-11-25 16:58:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:31,322 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2022-11-25 16:58:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:58:31,328 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-11-25 16:58:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:31,338 INFO L225 Difference]: With dead ends: 141 [2022-11-25 16:58:31,338 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 16:58:31,342 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-11-25 16:58:31,347 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-11-25 16:58:31,348 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-11-25 16:58:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 16:58:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-25 16:58:31,423 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-11-25 16:58:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2022-11-25 16:58:31,430 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 11 [2022-11-25 16:58:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:31,431 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2022-11-25 16:58:31,432 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-11-25 16:58:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2022-11-25 16:58:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:58:31,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:31,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:58:31,437 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-11-25 16:58:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash -133016270, now seen corresponding path program 1 times [2022-11-25 16:58:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745583101] [2022-11-25 16:58:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745583101] [2022-11-25 16:58:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745583101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:31,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364670243] [2022-11-25 16:58:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:31,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:31,858 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-11-25 16:58:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:31,955 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2022-11-25 16:58:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:31,956 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-11-25 16:58:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:31,957 INFO L225 Difference]: With dead ends: 136 [2022-11-25 16:58:31,966 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 16:58:31,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:31,968 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-11-25 16:58:31,969 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-11-25 16:58:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 16:58:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-25 16:58:31,978 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-11-25 16:58:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2022-11-25 16:58:31,982 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 15 [2022-11-25 16:58:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:31,986 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2022-11-25 16:58:31,986 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-11-25 16:58:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-11-25 16:58:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 16:58:31,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:31,988 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-11-25 16:58:31,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:58:31,988 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-11-25 16:58:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:31,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2029260687, now seen corresponding path program 1 times [2022-11-25 16:58:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:31,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068491950] [2022-11-25 16:58:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068491950] [2022-11-25 16:58:32,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068491950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:32,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:32,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441187491] [2022-11-25 16:58:32,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:32,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:32,203 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-11-25 16:58:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:32,391 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2022-11-25 16:58:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:32,392 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-11-25 16:58:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:32,393 INFO L225 Difference]: With dead ends: 129 [2022-11-25 16:58:32,394 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 16:58:32,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:32,396 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 216 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:32,397 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-11-25 16:58:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 16:58:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-11-25 16:58:32,410 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-11-25 16:58:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2022-11-25 16:58:32,412 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 30 [2022-11-25 16:58:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:32,413 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2022-11-25 16:58:32,413 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-11-25 16:58:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-11-25 16:58:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:58:32,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:32,415 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-11-25 16:58:32,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:58:32,416 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-11-25 16:58:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1517427904, now seen corresponding path program 1 times [2022-11-25 16:58:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:32,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052518315] [2022-11-25 16:58:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:32,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052518315] [2022-11-25 16:58:32,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052518315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:32,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:32,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439952997] [2022-11-25 16:58:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:32,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:32,533 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-11-25 16:58:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:32,762 INFO L93 Difference]: Finished difference Result 224 states and 305 transitions. [2022-11-25 16:58:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:32,763 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-11-25 16:58:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:32,772 INFO L225 Difference]: With dead ends: 224 [2022-11-25 16:58:32,772 INFO L226 Difference]: Without dead ends: 221 [2022-11-25 16:58:32,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:32,780 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:32,785 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.2s Time] [2022-11-25 16:58:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-25 16:58:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 163. [2022-11-25 16:58:32,814 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-11-25 16:58:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2022-11-25 16:58:32,820 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 31 [2022-11-25 16:58:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:32,821 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2022-11-25 16:58:32,822 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-11-25 16:58:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2022-11-25 16:58:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 16:58:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:32,824 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-11-25 16:58:32,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:58:32,824 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-11-25 16:58:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 204375473, now seen corresponding path program 1 times [2022-11-25 16:58:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:32,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523878346] [2022-11-25 16:58:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:33,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523878346] [2022-11-25 16:58:33,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523878346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:33,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:33,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498138551] [2022-11-25 16:58:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:33,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:33,060 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-11-25 16:58:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:33,346 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2022-11-25 16:58:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:33,347 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-11-25 16:58:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:33,349 INFO L225 Difference]: With dead ends: 264 [2022-11-25 16:58:33,349 INFO L226 Difference]: Without dead ends: 261 [2022-11-25 16:58:33,350 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-11-25 16:58:33,354 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 471 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:33,355 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.2s Time] [2022-11-25 16:58:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-25 16:58:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2022-11-25 16:58:33,400 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-11-25 16:58:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2022-11-25 16:58:33,406 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 32 [2022-11-25 16:58:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:33,411 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2022-11-25 16:58:33,412 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-11-25 16:58:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2022-11-25 16:58:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:58:33,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:33,416 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-11-25 16:58:33,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:58:33,416 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-11-25 16:58:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2040672610, now seen corresponding path program 1 times [2022-11-25 16:58:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:33,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217213931] [2022-11-25 16:58:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217213931] [2022-11-25 16:58:33,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217213931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:33,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:33,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098603500] [2022-11-25 16:58:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:33,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:33,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:33,532 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-11-25 16:58:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:33,799 INFO L93 Difference]: Finished difference Result 755 states and 1115 transitions. [2022-11-25 16:58:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:58:33,800 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-11-25 16:58:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:33,802 INFO L225 Difference]: With dead ends: 755 [2022-11-25 16:58:33,803 INFO L226 Difference]: Without dead ends: 528 [2022-11-25 16:58:33,804 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-11-25 16:58:33,805 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 468 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:33,805 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.2s Time] [2022-11-25 16:58:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-25 16:58:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2022-11-25 16:58:33,826 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-11-25 16:58:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 552 transitions. [2022-11-25 16:58:33,828 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 552 transitions. Word has length 33 [2022-11-25 16:58:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:33,828 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 552 transitions. [2022-11-25 16:58:33,828 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-11-25 16:58:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 552 transitions. [2022-11-25 16:58:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 16:58:33,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:33,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:33,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:58:33,830 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-11-25 16:58:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1865524296, now seen corresponding path program 1 times [2022-11-25 16:58:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:33,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161661877] [2022-11-25 16:58:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:33,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:33,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161661877] [2022-11-25 16:58:33,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161661877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:33,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:33,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898617809] [2022-11-25 16:58:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:33,896 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-11-25 16:58:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:33,946 INFO L93 Difference]: Finished difference Result 1058 states and 1556 transitions. [2022-11-25 16:58:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:33,952 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-11-25 16:58:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:33,955 INFO L225 Difference]: With dead ends: 1058 [2022-11-25 16:58:33,956 INFO L226 Difference]: Without dead ends: 702 [2022-11-25 16:58:33,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:33,962 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-11-25 16:58:33,962 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-11-25 16:58:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-25 16:58:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 690. [2022-11-25 16:58:34,015 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-11-25 16:58:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1018 transitions. [2022-11-25 16:58:34,018 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1018 transitions. Word has length 35 [2022-11-25 16:58:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:34,018 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1018 transitions. [2022-11-25 16:58:34,019 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-11-25 16:58:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1018 transitions. [2022-11-25 16:58:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 16:58:34,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:34,027 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-11-25 16:58:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:58:34,028 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-11-25 16:58:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1638740118, now seen corresponding path program 1 times [2022-11-25 16:58:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:34,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463113067] [2022-11-25 16:58:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:34,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463113067] [2022-11-25 16:58:34,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463113067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:34,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:34,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926514348] [2022-11-25 16:58:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:34,103 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-11-25 16:58:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:34,190 INFO L93 Difference]: Finished difference Result 1962 states and 2898 transitions. [2022-11-25 16:58:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:34,191 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-11-25 16:58:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:34,196 INFO L225 Difference]: With dead ends: 1962 [2022-11-25 16:58:34,196 INFO L226 Difference]: Without dead ends: 1294 [2022-11-25 16:58:34,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:34,198 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-11-25 16:58:34,198 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-11-25 16:58:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-25 16:58:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1282. [2022-11-25 16:58:34,279 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-11-25 16:58:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1886 transitions. [2022-11-25 16:58:34,283 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1886 transitions. Word has length 37 [2022-11-25 16:58:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:34,284 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1886 transitions. [2022-11-25 16:58:34,284 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-11-25 16:58:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1886 transitions. [2022-11-25 16:58:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 16:58:34,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:34,285 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-11-25 16:58:34,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:58:34,285 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-11-25 16:58:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash -958732938, now seen corresponding path program 1 times [2022-11-25 16:58:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:34,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979528745] [2022-11-25 16:58:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:34,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979528745] [2022-11-25 16:58:34,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979528745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:34,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:34,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056502454] [2022-11-25 16:58:34,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:34,369 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-11-25 16:58:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:34,563 INFO L93 Difference]: Finished difference Result 3578 states and 5262 transitions. [2022-11-25 16:58:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:34,563 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-11-25 16:58:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:34,572 INFO L225 Difference]: With dead ends: 3578 [2022-11-25 16:58:34,572 INFO L226 Difference]: Without dead ends: 2318 [2022-11-25 16:58:34,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:34,576 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-11-25 16:58:34,576 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-11-25 16:58:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-11-25 16:58:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2306. [2022-11-25 16:58:34,768 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-11-25 16:58:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3366 transitions. [2022-11-25 16:58:34,776 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3366 transitions. Word has length 37 [2022-11-25 16:58:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:34,777 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 3366 transitions. [2022-11-25 16:58:34,777 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-11-25 16:58:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3366 transitions. [2022-11-25 16:58:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 16:58:34,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:34,779 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-11-25 16:58:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:58:34,779 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-11-25 16:58:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1488856003, now seen corresponding path program 1 times [2022-11-25 16:58:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:34,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540124213] [2022-11-25 16:58:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540124213] [2022-11-25 16:58:34,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540124213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:34,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:34,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036709371] [2022-11-25 16:58:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:34,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:34,886 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-11-25 16:58:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:35,151 INFO L93 Difference]: Finished difference Result 5186 states and 7536 transitions. [2022-11-25 16:58:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:35,152 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-11-25 16:58:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:35,163 INFO L225 Difference]: With dead ends: 5186 [2022-11-25 16:58:35,163 INFO L226 Difference]: Without dead ends: 2902 [2022-11-25 16:58:35,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:35,169 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-11-25 16:58:35,170 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-11-25 16:58:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-11-25 16:58:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2856. [2022-11-25 16:58:35,415 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-11-25 16:58:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4104 transitions. [2022-11-25 16:58:35,426 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4104 transitions. Word has length 53 [2022-11-25 16:58:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:35,426 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4104 transitions. [2022-11-25 16:58:35,426 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-11-25 16:58:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4104 transitions. [2022-11-25 16:58:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 16:58:35,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:35,428 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-11-25 16:58:35,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:58:35,428 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-11-25 16:58:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2071285937, now seen corresponding path program 1 times [2022-11-25 16:58:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:35,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064681374] [2022-11-25 16:58:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064681374] [2022-11-25 16:58:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064681374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:35,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:35,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:35,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579604098] [2022-11-25 16:58:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:35,700 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-11-25 16:58:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:36,048 INFO L93 Difference]: Finished difference Result 5694 states and 8184 transitions. [2022-11-25 16:58:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:36,049 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-11-25 16:58:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:36,059 INFO L225 Difference]: With dead ends: 5694 [2022-11-25 16:58:36,060 INFO L226 Difference]: Without dead ends: 2862 [2022-11-25 16:58:36,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:36,065 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-11-25 16:58:36,066 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-11-25 16:58:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2022-11-25 16:58:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2856. [2022-11-25 16:58:36,303 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-11-25 16:58:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4072 transitions. [2022-11-25 16:58:36,315 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4072 transitions. Word has length 57 [2022-11-25 16:58:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:36,317 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4072 transitions. [2022-11-25 16:58:36,317 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-11-25 16:58:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4072 transitions. [2022-11-25 16:58:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 16:58:36,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:36,319 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-11-25 16:58:36,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:58:36,319 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-11-25 16:58:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 275033619, now seen corresponding path program 1 times [2022-11-25 16:58:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:36,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097695884] [2022-11-25 16:58:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:36,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097695884] [2022-11-25 16:58:36,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097695884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:36,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:36,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782963323] [2022-11-25 16:58:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:36,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:36,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:36,467 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-11-25 16:58:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:36,867 INFO L93 Difference]: Finished difference Result 3720 states and 5320 transitions. [2022-11-25 16:58:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:36,868 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-11-25 16:58:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:36,883 INFO L225 Difference]: With dead ends: 3720 [2022-11-25 16:58:36,884 INFO L226 Difference]: Without dead ends: 3717 [2022-11-25 16:58:36,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:36,886 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 99 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:36,887 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-11-25 16:58:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-11-25 16:58:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 2920. [2022-11-25 16:58:37,178 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-11-25 16:58:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4196 transitions. [2022-11-25 16:58:37,192 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4196 transitions. Word has length 58 [2022-11-25 16:58:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:37,193 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4196 transitions. [2022-11-25 16:58:37,193 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-11-25 16:58:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4196 transitions. [2022-11-25 16:58:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 16:58:37,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:37,195 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-11-25 16:58:37,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:58:37,195 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-11-25 16:58:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -63892162, now seen corresponding path program 1 times [2022-11-25 16:58:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:37,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114541565] [2022-11-25 16:58:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:37,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114541565] [2022-11-25 16:58:37,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114541565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:37,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:37,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104356625] [2022-11-25 16:58:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:37,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:37,361 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-11-25 16:58:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:37,917 INFO L93 Difference]: Finished difference Result 8214 states and 11904 transitions. [2022-11-25 16:58:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:37,918 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-11-25 16:58:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:37,937 INFO L225 Difference]: With dead ends: 8214 [2022-11-25 16:58:37,937 INFO L226 Difference]: Without dead ends: 5318 [2022-11-25 16:58:37,941 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-11-25 16:58:37,942 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:37,942 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.2s Time] [2022-11-25 16:58:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2022-11-25 16:58:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4624. [2022-11-25 16:58:38,314 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-11-25 16:58:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6688 transitions. [2022-11-25 16:58:38,330 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6688 transitions. Word has length 59 [2022-11-25 16:58:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:38,330 INFO L495 AbstractCegarLoop]: Abstraction has 4624 states and 6688 transitions. [2022-11-25 16:58:38,330 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-11-25 16:58:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6688 transitions. [2022-11-25 16:58:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:58:38,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:38,332 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-11-25 16:58:38,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:58:38,332 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-11-25 16:58:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1091923339, now seen corresponding path program 1 times [2022-11-25 16:58:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:38,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067019890] [2022-11-25 16:58:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:58:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:38,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067019890] [2022-11-25 16:58:38,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067019890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:38,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:38,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578436502] [2022-11-25 16:58:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:38,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:38,478 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-11-25 16:58:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:39,011 INFO L93 Difference]: Finished difference Result 9623 states and 13836 transitions. [2022-11-25 16:58:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:39,012 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-11-25 16:58:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:39,057 INFO L225 Difference]: With dead ends: 9623 [2022-11-25 16:58:39,057 INFO L226 Difference]: Without dead ends: 5023 [2022-11-25 16:58:39,063 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-11-25 16:58:39,064 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-11-25 16:58:39,064 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-11-25 16:58:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2022-11-25 16:58:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4624. [2022-11-25 16:58:39,540 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-11-25 16:58:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6644 transitions. [2022-11-25 16:58:39,566 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6644 transitions. Word has length 60 [2022-11-25 16:58:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:39,566 INFO L495 AbstractCegarLoop]: Abstraction has 4624 states and 6644 transitions. [2022-11-25 16:58:39,567 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-11-25 16:58:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6644 transitions. [2022-11-25 16:58:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:58:39,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:39,569 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-11-25 16:58:39,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:58:39,570 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-11-25 16:58:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1980656779, now seen corresponding path program 1 times [2022-11-25 16:58:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:39,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225039487] [2022-11-25 16:58:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:39,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:39,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225039487] [2022-11-25 16:58:39,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225039487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:39,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:39,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291097859] [2022-11-25 16:58:39,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:39,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:39,703 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-11-25 16:58:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:40,213 INFO L93 Difference]: Finished difference Result 9227 states and 13296 transitions. [2022-11-25 16:58:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:40,214 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-11-25 16:58:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:40,227 INFO L225 Difference]: With dead ends: 9227 [2022-11-25 16:58:40,227 INFO L226 Difference]: Without dead ends: 5415 [2022-11-25 16:58:40,234 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-11-25 16:58:40,235 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-11-25 16:58:40,236 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-11-25 16:58:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2022-11-25 16:58:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5412. [2022-11-25 16:58:40,649 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-11-25 16:58:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7616 transitions. [2022-11-25 16:58:40,670 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7616 transitions. Word has length 60 [2022-11-25 16:58:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:40,670 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 7616 transitions. [2022-11-25 16:58:40,671 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-11-25 16:58:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7616 transitions. [2022-11-25 16:58:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:58:40,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:40,672 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-11-25 16:58:40,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:58:40,673 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-11-25 16:58:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -998722173, now seen corresponding path program 1 times [2022-11-25 16:58:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55420371] [2022-11-25 16:58:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55420371] [2022-11-25 16:58:40,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55420371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:40,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:40,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:40,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227691167] [2022-11-25 16:58:40,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:40,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:40,767 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-11-25 16:58:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:41,185 INFO L93 Difference]: Finished difference Result 5415 states and 7616 transitions. [2022-11-25 16:58:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:41,185 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-11-25 16:58:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:41,200 INFO L225 Difference]: With dead ends: 5415 [2022-11-25 16:58:41,200 INFO L226 Difference]: Without dead ends: 5412 [2022-11-25 16:58:41,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:41,202 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 95 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:41,202 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.1s Time] [2022-11-25 16:58:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2022-11-25 16:58:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5409. [2022-11-25 16:58:41,704 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-11-25 16:58:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7472 transitions. [2022-11-25 16:58:41,721 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7472 transitions. Word has length 60 [2022-11-25 16:58:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:41,722 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7472 transitions. [2022-11-25 16:58:41,722 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-11-25 16:58:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7472 transitions. [2022-11-25 16:58:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 16:58:41,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:41,730 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-11-25 16:58:41,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:58:41,730 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-11-25 16:58:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash -895616052, now seen corresponding path program 1 times [2022-11-25 16:58:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:41,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985419284] [2022-11-25 16:58:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985419284] [2022-11-25 16:58:41,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985419284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:41,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:41,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351169134] [2022-11-25 16:58:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:41,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:41,855 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-11-25 16:58:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:42,452 INFO L93 Difference]: Finished difference Result 7122 states and 9968 transitions. [2022-11-25 16:58:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:42,453 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-11-25 16:58:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:42,473 INFO L225 Difference]: With dead ends: 7122 [2022-11-25 16:58:42,473 INFO L226 Difference]: Without dead ends: 7119 [2022-11-25 16:58:42,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:42,478 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 96 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:42,478 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-11-25 16:58:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7119 states. [2022-11-25 16:58:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7119 to 7113. [2022-11-25 16:58:42,971 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-11-25 16:58:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9824 transitions. [2022-11-25 16:58:42,988 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9824 transitions. Word has length 61 [2022-11-25 16:58:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 7113 states and 9824 transitions. [2022-11-25 16:58:42,988 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-11-25 16:58:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9824 transitions. [2022-11-25 16:58:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 16:58:42,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:42,990 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-11-25 16:58:42,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:58:42,990 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-11-25 16:58:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1994293595, now seen corresponding path program 1 times [2022-11-25 16:58:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710786880] [2022-11-25 16:58:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:43,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710786880] [2022-11-25 16:58:43,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710786880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:43,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:43,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629894660] [2022-11-25 16:58:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:43,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:43,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:43,105 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-11-25 16:58:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:43,788 INFO L93 Difference]: Finished difference Result 13493 states and 19124 transitions. [2022-11-25 16:58:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:43,791 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-11-25 16:58:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:43,810 INFO L225 Difference]: With dead ends: 13493 [2022-11-25 16:58:43,810 INFO L226 Difference]: Without dead ends: 8372 [2022-11-25 16:58:43,818 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-11-25 16:58:43,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-11-25 16:58:43,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-11-25 16:58:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2022-11-25 16:58:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 6937. [2022-11-25 16:58:44,326 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-11-25 16:58:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9620 transitions. [2022-11-25 16:58:44,342 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9620 transitions. Word has length 62 [2022-11-25 16:58:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:44,343 INFO L495 AbstractCegarLoop]: Abstraction has 6937 states and 9620 transitions. [2022-11-25 16:58:44,343 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-11-25 16:58:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9620 transitions. [2022-11-25 16:58:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 16:58:44,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:44,345 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-11-25 16:58:44,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:58:44,345 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-11-25 16:58:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1693559058, now seen corresponding path program 1 times [2022-11-25 16:58:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133085185] [2022-11-25 16:58:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:44,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133085185] [2022-11-25 16:58:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133085185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:44,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176238855] [2022-11-25 16:58:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:44,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:44,483 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-11-25 16:58:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:45,087 INFO L93 Difference]: Finished difference Result 11777 states and 16588 transitions. [2022-11-25 16:58:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:45,088 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-11-25 16:58:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:45,107 INFO L225 Difference]: With dead ends: 11777 [2022-11-25 16:58:45,107 INFO L226 Difference]: Without dead ends: 7224 [2022-11-25 16:58:45,116 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-11-25 16:58:45,117 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-11-25 16:58:45,117 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-11-25 16:58:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2022-11-25 16:58:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7221. [2022-11-25 16:58:45,776 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-11-25 16:58:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7221 states to 7221 states and 9980 transitions. [2022-11-25 16:58:45,796 INFO L78 Accepts]: Start accepts. Automaton has 7221 states and 9980 transitions. Word has length 63 [2022-11-25 16:58:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:45,797 INFO L495 AbstractCegarLoop]: Abstraction has 7221 states and 9980 transitions. [2022-11-25 16:58:45,797 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-11-25 16:58:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7221 states and 9980 transitions. [2022-11-25 16:58:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 16:58:45,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:45,799 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-11-25 16:58:45,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:58:45,800 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-11-25 16:58:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1429008381, now seen corresponding path program 1 times [2022-11-25 16:58:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:45,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458626309] [2022-11-25 16:58:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458626309] [2022-11-25 16:58:45,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458626309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:45,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:45,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278256493] [2022-11-25 16:58:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:45,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:45,962 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-11-25 16:58:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:46,584 INFO L93 Difference]: Finished difference Result 7619 states and 10512 transitions. [2022-11-25 16:58:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:46,584 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-11-25 16:58:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:46,610 INFO L225 Difference]: With dead ends: 7619 [2022-11-25 16:58:46,610 INFO L226 Difference]: Without dead ends: 7616 [2022-11-25 16:58:46,613 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-11-25 16:58:46,614 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-11-25 16:58:46,614 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-11-25 16:58:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2022-11-25 16:58:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7613. [2022-11-25 16:58:47,097 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-11-25 16:58:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 10448 transitions. [2022-11-25 16:58:47,112 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 10448 transitions. Word has length 64 [2022-11-25 16:58:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:47,112 INFO L495 AbstractCegarLoop]: Abstraction has 7613 states and 10448 transitions. [2022-11-25 16:58:47,112 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-11-25 16:58:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 10448 transitions. [2022-11-25 16:58:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 16:58:47,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:47,114 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-11-25 16:58:47,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:58:47,115 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-11-25 16:58:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -433416492, now seen corresponding path program 1 times [2022-11-25 16:58:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167056905] [2022-11-25 16:58:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:47,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167056905] [2022-11-25 16:58:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167056905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:47,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862808723] [2022-11-25 16:58:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:47,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:47,243 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-11-25 16:58:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:47,818 INFO L93 Difference]: Finished difference Result 9897 states and 13776 transitions. [2022-11-25 16:58:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:47,819 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-11-25 16:58:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:47,842 INFO L225 Difference]: With dead ends: 9897 [2022-11-25 16:58:47,842 INFO L226 Difference]: Without dead ends: 9894 [2022-11-25 16:58:47,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:47,846 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-11-25 16:58:47,846 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-11-25 16:58:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2022-11-25 16:58:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9317. [2022-11-25 16:58:48,375 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-11-25 16:58:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12656 transitions. [2022-11-25 16:58:48,396 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12656 transitions. Word has length 65 [2022-11-25 16:58:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:48,397 INFO L495 AbstractCegarLoop]: Abstraction has 9317 states and 12656 transitions. [2022-11-25 16:58:48,397 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-11-25 16:58:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12656 transitions. [2022-11-25 16:58:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:58:48,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:48,399 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-11-25 16:58:48,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 16:58:48,400 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-11-25 16:58:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -551009123, now seen corresponding path program 1 times [2022-11-25 16:58:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:48,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235002815] [2022-11-25 16:58:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235002815] [2022-11-25 16:58:48,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235002815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:48,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:48,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049715687] [2022-11-25 16:58:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:48,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:48,538 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-11-25 16:58:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:49,117 INFO L93 Difference]: Finished difference Result 11343 states and 15424 transitions. [2022-11-25 16:58:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:49,118 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-11-25 16:58:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:49,131 INFO L225 Difference]: With dead ends: 11343 [2022-11-25 16:58:49,132 INFO L226 Difference]: Without dead ends: 7361 [2022-11-25 16:58:49,138 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-11-25 16:58:49,139 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-11-25 16:58:49,139 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-11-25 16:58:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2022-11-25 16:58:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 5529. [2022-11-25 16:58:49,510 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-11-25 16:58:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 7424 transitions. [2022-11-25 16:58:49,520 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 7424 transitions. Word has length 66 [2022-11-25 16:58:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:49,520 INFO L495 AbstractCegarLoop]: Abstraction has 5529 states and 7424 transitions. [2022-11-25 16:58:49,520 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-11-25 16:58:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 7424 transitions. [2022-11-25 16:58:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 16:58:49,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:49,522 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-11-25 16:58:49,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 16:58:49,523 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-11-25 16:58:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 987320054, now seen corresponding path program 1 times [2022-11-25 16:58:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:49,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073051238] [2022-11-25 16:58:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:49,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:49,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073051238] [2022-11-25 16:58:49,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073051238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:49,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:49,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:49,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909707051] [2022-11-25 16:58:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:49,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:49,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:49,657 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-11-25 16:58:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:50,162 INFO L93 Difference]: Finished difference Result 5819 states and 7816 transitions. [2022-11-25 16:58:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:50,162 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-11-25 16:58:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:50,172 INFO L225 Difference]: With dead ends: 5819 [2022-11-25 16:58:50,172 INFO L226 Difference]: Without dead ends: 5816 [2022-11-25 16:58:50,174 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-11-25 16:58:50,174 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-11-25 16:58:50,175 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-11-25 16:58:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2022-11-25 16:58:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5813. [2022-11-25 16:58:50,795 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-11-25 16:58:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 7792 transitions. [2022-11-25 16:58:50,811 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 7792 transitions. Word has length 67 [2022-11-25 16:58:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:50,812 INFO L495 AbstractCegarLoop]: Abstraction has 5813 states and 7792 transitions. [2022-11-25 16:58:50,812 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-11-25 16:58:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 7792 transitions. [2022-11-25 16:58:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 16:58:50,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:50,817 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-11-25 16:58:50,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 16:58:50,818 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-11-25 16:58:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 98586614, now seen corresponding path program 1 times [2022-11-25 16:58:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:50,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049802788] [2022-11-25 16:58:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049802788] [2022-11-25 16:58:50,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049802788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:50,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:50,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661568842] [2022-11-25 16:58:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:50,989 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-11-25 16:58:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:51,521 INFO L93 Difference]: Finished difference Result 6863 states and 9288 transitions. [2022-11-25 16:58:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:51,521 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-11-25 16:58:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:51,533 INFO L225 Difference]: With dead ends: 6863 [2022-11-25 16:58:51,534 INFO L226 Difference]: Without dead ends: 6862 [2022-11-25 16:58:51,536 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-11-25 16:58:51,537 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-11-25 16:58:51,538 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-11-25 16:58:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6862 states. [2022-11-25 16:58:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6862 to 6853. [2022-11-25 16:58:52,067 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-11-25 16:58:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 9280 transitions. [2022-11-25 16:58:52,081 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 9280 transitions. Word has length 67 [2022-11-25 16:58:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:52,082 INFO L495 AbstractCegarLoop]: Abstraction has 6853 states and 9280 transitions. [2022-11-25 16:58:52,082 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-11-25 16:58:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 9280 transitions. [2022-11-25 16:58:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 16:58:52,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:52,084 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-11-25 16:58:52,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 16:58:52,085 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-11-25 16:58:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1971878914, now seen corresponding path program 1 times [2022-11-25 16:58:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:52,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411363546] [2022-11-25 16:58:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:52,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411363546] [2022-11-25 16:58:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411363546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:52,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:52,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505050701] [2022-11-25 16:58:52,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:52,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:52,200 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-11-25 16:58:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:52,704 INFO L93 Difference]: Finished difference Result 7046 states and 9528 transitions. [2022-11-25 16:58:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:52,705 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-11-25 16:58:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:52,712 INFO L225 Difference]: With dead ends: 7046 [2022-11-25 16:58:52,713 INFO L226 Difference]: Without dead ends: 6669 [2022-11-25 16:58:52,715 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-11-25 16:58:52,716 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-11-25 16:58:52,716 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-11-25 16:58:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2022-11-25 16:58:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6665. [2022-11-25 16:58:53,038 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-11-25 16:58:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9020 transitions. [2022-11-25 16:58:53,047 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9020 transitions. Word has length 71 [2022-11-25 16:58:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:53,047 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9020 transitions. [2022-11-25 16:58:53,047 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-11-25 16:58:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9020 transitions. [2022-11-25 16:58:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 16:58:53,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:53,051 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-11-25 16:58:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 16:58:53,052 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-11-25 16:58:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash -115998817, now seen corresponding path program 1 times [2022-11-25 16:58:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:53,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545116076] [2022-11-25 16:58:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:53,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:53,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545116076] [2022-11-25 16:58:53,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545116076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:53,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:53,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351803223] [2022-11-25 16:58:53,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:53,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:53,236 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-11-25 16:58:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:53,850 INFO L93 Difference]: Finished difference Result 6859 states and 9264 transitions. [2022-11-25 16:58:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:53,851 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-11-25 16:58:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:53,860 INFO L225 Difference]: With dead ends: 6859 [2022-11-25 16:58:53,861 INFO L226 Difference]: Without dead ends: 6856 [2022-11-25 16:58:53,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:53,864 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:53,866 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-11-25 16:58:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2022-11-25 16:58:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6662. [2022-11-25 16:58:54,281 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-11-25 16:58:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 8780 transitions. [2022-11-25 16:58:54,288 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 8780 transitions. Word has length 85 [2022-11-25 16:58:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 6662 states and 8780 transitions. [2022-11-25 16:58:54,288 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-11-25 16:58:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 8780 transitions. [2022-11-25 16:58:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 16:58:54,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:54,291 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-11-25 16:58:54,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 16:58:54,292 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-11-25 16:58:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 654927334, now seen corresponding path program 1 times [2022-11-25 16:58:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:54,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616645717] [2022-11-25 16:58:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:58:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:54,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616645717] [2022-11-25 16:58:54,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616645717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:54,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:54,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58106883] [2022-11-25 16:58:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:54,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:54,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:54,430 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-11-25 16:58:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:55,030 INFO L93 Difference]: Finished difference Result 7057 states and 9280 transitions. [2022-11-25 16:58:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:55,030 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-11-25 16:58:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:55,042 INFO L225 Difference]: With dead ends: 7057 [2022-11-25 16:58:55,042 INFO L226 Difference]: Without dead ends: 7054 [2022-11-25 16:58:55,045 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-11-25 16:58:55,046 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-11-25 16:58:55,046 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-11-25 16:58:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2022-11-25 16:58:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6270. [2022-11-25 16:58:55,444 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-11-25 16:58:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8248 transitions. [2022-11-25 16:58:55,452 INFO L78 Accepts]: Start accepts. Automaton has 6270 states and 8248 transitions. Word has length 86 [2022-11-25 16:58:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:55,452 INFO L495 AbstractCegarLoop]: Abstraction has 6270 states and 8248 transitions. [2022-11-25 16:58:55,452 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-11-25 16:58:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6270 states and 8248 transitions. [2022-11-25 16:58:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 16:58:55,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:55,456 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-11-25 16:58:55,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 16:58:55,456 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-11-25 16:58:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 194294273, now seen corresponding path program 1 times [2022-11-25 16:58:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:55,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420105930] [2022-11-25 16:58:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420105930] [2022-11-25 16:58:55,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420105930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:55,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:55,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525867973] [2022-11-25 16:58:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:55,595 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-11-25 16:58:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:56,149 INFO L93 Difference]: Finished difference Result 9597 states and 12728 transitions. [2022-11-25 16:58:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:56,149 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-11-25 16:58:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:56,155 INFO L225 Difference]: With dead ends: 9597 [2022-11-25 16:58:56,155 INFO L226 Difference]: Without dead ends: 5791 [2022-11-25 16:58:56,160 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-11-25 16:58:56,160 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:56,161 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.2s Time] [2022-11-25 16:58:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2022-11-25 16:58:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5782. [2022-11-25 16:58:56,465 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-11-25 16:58:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7572 transitions. [2022-11-25 16:58:56,474 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7572 transitions. Word has length 87 [2022-11-25 16:58:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:56,474 INFO L495 AbstractCegarLoop]: Abstraction has 5782 states and 7572 transitions. [2022-11-25 16:58:56,474 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-11-25 16:58:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7572 transitions. [2022-11-25 16:58:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 16:58:56,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:56,479 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-11-25 16:58:56,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 16:58:56,479 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-11-25 16:58:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash -907513413, now seen corresponding path program 2 times [2022-11-25 16:58:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292287045] [2022-11-25 16:58:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:58:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292287045] [2022-11-25 16:58:56,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292287045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:56,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:56,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723430230] [2022-11-25 16:58:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:56,676 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-11-25 16:58:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:57,235 INFO L93 Difference]: Finished difference Result 5977 states and 7816 transitions. [2022-11-25 16:58:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:57,235 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-11-25 16:58:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:57,241 INFO L225 Difference]: With dead ends: 5977 [2022-11-25 16:58:57,242 INFO L226 Difference]: Without dead ends: 5032 [2022-11-25 16:58:57,245 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-11-25 16:58:57,246 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:57,246 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-11-25 16:58:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2022-11-25 16:58:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 5026. [2022-11-25 16:58:57,538 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-11-25 16:58:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6588 transitions. [2022-11-25 16:58:57,544 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6588 transitions. Word has length 87 [2022-11-25 16:58:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:57,544 INFO L495 AbstractCegarLoop]: Abstraction has 5026 states and 6588 transitions. [2022-11-25 16:58:57,545 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-11-25 16:58:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6588 transitions. [2022-11-25 16:58:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 16:58:57,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:57,548 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-11-25 16:58:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 16:58:57,548 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-11-25 16:58:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 435812822, now seen corresponding path program 1 times [2022-11-25 16:58:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453618171] [2022-11-25 16:58:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453618171] [2022-11-25 16:58:57,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453618171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:57,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:57,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969037927] [2022-11-25 16:58:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:57,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:57,693 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-11-25 16:58:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:58,042 INFO L93 Difference]: Finished difference Result 6119 states and 8046 transitions. [2022-11-25 16:58:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:58,043 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-11-25 16:58:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:58,050 INFO L225 Difference]: With dead ends: 6119 [2022-11-25 16:58:58,050 INFO L226 Difference]: Without dead ends: 3369 [2022-11-25 16:58:58,054 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-11-25 16:58:58,055 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 103 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:58,055 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-11-25 16:58:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-11-25 16:58:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3031. [2022-11-25 16:58:58,207 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-11-25 16:58:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3828 transitions. [2022-11-25 16:58:58,211 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3828 transitions. Word has length 88 [2022-11-25 16:58:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:58,211 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 3828 transitions. [2022-11-25 16:58:58,212 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-11-25 16:58:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3828 transitions. [2022-11-25 16:58:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 16:58:58,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:58,215 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-11-25 16:58:58,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 16:58:58,216 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-11-25 16:58:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1304386851, now seen corresponding path program 1 times [2022-11-25 16:58:58,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:58,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13240452] [2022-11-25 16:58:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:58:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:58,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13240452] [2022-11-25 16:58:58,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13240452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:58,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:58,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685218753] [2022-11-25 16:58:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:58,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:58,348 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-11-25 16:58:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:58,706 INFO L93 Difference]: Finished difference Result 3032 states and 3828 transitions. [2022-11-25 16:58:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:58,707 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-11-25 16:58:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:58,710 INFO L225 Difference]: With dead ends: 3032 [2022-11-25 16:58:58,711 INFO L226 Difference]: Without dead ends: 3029 [2022-11-25 16:58:58,712 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-11-25 16:58:58,713 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:58:58,713 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-11-25 16:58:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2022-11-25 16:58:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2022-11-25 16:58:58,969 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-11-25 16:58:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3804 transitions. [2022-11-25 16:58:58,974 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3804 transitions. Word has length 89 [2022-11-25 16:58:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:58,974 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 3804 transitions. [2022-11-25 16:58:58,975 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-11-25 16:58:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3804 transitions. [2022-11-25 16:58:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 16:58:58,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:58,977 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-11-25 16:58:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 16:58:58,978 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-11-25 16:58:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 625295837, now seen corresponding path program 1 times [2022-11-25 16:58:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073487700] [2022-11-25 16:58:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:58:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073487700] [2022-11-25 16:58:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073487700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:59,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015530906] [2022-11-25 16:58:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:59,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:59,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:59,146 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-11-25 16:58:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:59,430 INFO L93 Difference]: Finished difference Result 3030 states and 3804 transitions. [2022-11-25 16:58:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:59,431 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-11-25 16:58:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:59,434 INFO L225 Difference]: With dead ends: 3030 [2022-11-25 16:58:59,435 INFO L226 Difference]: Without dead ends: 3029 [2022-11-25 16:58:59,436 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-11-25 16:58:59,437 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 92 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:59,437 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.1s Time] [2022-11-25 16:58:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2022-11-25 16:58:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2022-11-25 16:58:59,587 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-11-25 16:58:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3796 transitions. [2022-11-25 16:58:59,591 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3796 transitions. Word has length 89 [2022-11-25 16:58:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:59,591 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 3796 transitions. [2022-11-25 16:58:59,591 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-11-25 16:58:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3796 transitions. [2022-11-25 16:58:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 16:58:59,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:59,594 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-11-25 16:58:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 16:58:59,594 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-11-25 16:58:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1646070885, now seen corresponding path program 1 times [2022-11-25 16:58:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102842325] [2022-11-25 16:58:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:58:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:59,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102842325] [2022-11-25 16:58:59,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102842325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:59,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:59,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323165013] [2022-11-25 16:58:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:59,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:59,745 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-11-25 16:59:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:59:00,131 INFO L93 Difference]: Finished difference Result 3219 states and 4036 transitions. [2022-11-25 16:59:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:00,132 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-11-25 16:59:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:59:00,135 INFO L225 Difference]: With dead ends: 3219 [2022-11-25 16:59:00,135 INFO L226 Difference]: Without dead ends: 2746 [2022-11-25 16:59:00,136 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-11-25 16:59:00,137 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-11-25 16:59:00,137 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-11-25 16:59:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-25 16:59:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2557. [2022-11-25 16:59:00,326 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-11-25 16:59:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3176 transitions. [2022-11-25 16:59:00,329 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3176 transitions. Word has length 93 [2022-11-25 16:59:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:59:00,329 INFO L495 AbstractCegarLoop]: Abstraction has 2557 states and 3176 transitions. [2022-11-25 16:59:00,329 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-11-25 16:59:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3176 transitions. [2022-11-25 16:59:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 16:59:00,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:59:00,332 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-11-25 16:59:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 16:59:00,332 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-11-25 16:59:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1464653211, now seen corresponding path program 2 times [2022-11-25 16:59:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:00,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302103718] [2022-11-25 16:59:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:00,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:59:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:00,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302103718] [2022-11-25 16:59:00,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302103718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:00,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:00,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811460584] [2022-11-25 16:59:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:00,466 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-11-25 16:59:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:59:00,768 INFO L93 Difference]: Finished difference Result 2558 states and 3176 transitions. [2022-11-25 16:59:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:00,769 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-11-25 16:59:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:59:00,771 INFO L225 Difference]: With dead ends: 2558 [2022-11-25 16:59:00,771 INFO L226 Difference]: Without dead ends: 1789 [2022-11-25 16:59:00,772 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-11-25 16:59:00,773 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 102 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 16:59:00,773 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-11-25 16:59:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-11-25 16:59:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2022-11-25 16:59:00,909 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-11-25 16:59:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2208 transitions. [2022-11-25 16:59:00,912 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2208 transitions. Word has length 93 [2022-11-25 16:59:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:59:00,913 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2208 transitions. [2022-11-25 16:59:00,913 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-11-25 16:59:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2208 transitions. [2022-11-25 16:59:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 16:59:00,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:59:00,916 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-11-25 16:59:00,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 16:59:00,916 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-11-25 16:59:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -168843784, now seen corresponding path program 1 times [2022-11-25 16:59:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934756401] [2022-11-25 16:59:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:59:01,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934756401] [2022-11-25 16:59:01,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934756401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:01,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261702143] [2022-11-25 16:59:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:01,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:01,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:01,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:01,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:01,069 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-11-25 16:59:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:59:01,329 INFO L93 Difference]: Finished difference Result 1789 states and 2208 transitions. [2022-11-25 16:59:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:01,329 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-11-25 16:59:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:59:01,330 INFO L225 Difference]: With dead ends: 1789 [2022-11-25 16:59:01,330 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:59:01,332 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-11-25 16:59:01,333 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 103 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:59:01,334 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.1s Time] [2022-11-25 16:59:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:59:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:59:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:59:01,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-11-25 16:59:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:59:01,337 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:59:01,338 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-11-25 16:59:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:59:01,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:59:01,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-25 16:59:01,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-25 16:59:01,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-25 16:59:01,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-25 16:59:01,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-25 16:59:01,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-25 16:59:01,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-25 16:59:01,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-25 16:59:01,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-25 16:59:01,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-25 16:59:01,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-25 16:59:01,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-25 16:59:01,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-25 16:59:01,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-25 16:59:01,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 16:59:01,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:59:10,038 WARN L233 SmtUtils]: Spent 8.68s 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-11-25 16:59:15,725 WARN L233 SmtUtils]: Spent 5.68s 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-11-25 16:59:22,376 WARN L233 SmtUtils]: Spent 6.64s 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-11-25 16:59:28,289 WARN L233 SmtUtils]: Spent 5.91s 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-11-25 16:59:34,255 WARN L233 SmtUtils]: Spent 5.96s 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-11-25 16:59:50,899 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 686 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 17:00:02,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,338 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L217(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L217-1(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L217-2(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 120) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L217-3(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L217-4(lines 217 221) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 199) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 135 199) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:00:02,339 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 101) no Hoare annotation was computed. [2022-11-25 17:00:02,340 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 80 104) 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-11-25 17:00:02,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,340 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 196) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L285(line 285) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 193) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 190) no Hoare annotation was computed. [2022-11-25 17:00:02,341 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 96) no Hoare annotation was computed. [2022-11-25 17:00:02,342 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 89 96) no Hoare annotation was computed. [2022-11-25 17:00:02,342 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 187) no Hoare annotation was computed. [2022-11-25 17:00:02,342 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 95) no Hoare annotation was computed. [2022-11-25 17:00:02,342 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 76) no Hoare annotation was computed. [2022-11-25 17:00:02,343 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 51 79) 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-11-25 17:00:02,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,343 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 184) no Hoare annotation was computed. [2022-11-25 17:00:02,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:00:02,343 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-11-25 17:00:02,343 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2022-11-25 17:00:02,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,344 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 181) no Hoare annotation was computed. [2022-11-25 17:00:02,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,344 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,344 INFO L899 garLoopResultBuilder]: For program point L208-1(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,350 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 178) no Hoare annotation was computed. [2022-11-25 17:00:02,351 INFO L899 garLoopResultBuilder]: For program point L208-2(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,351 INFO L899 garLoopResultBuilder]: For program point L208-3(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,354 INFO L899 garLoopResultBuilder]: For program point L208-4(lines 208 227) no Hoare annotation was computed. [2022-11-25 17:00:02,354 INFO L899 garLoopResultBuilder]: For program point L208-5(lines 208 227) no Hoare annotation was computed. [2022-11-25 17:00:02,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,354 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 95) no Hoare annotation was computed. [2022-11-25 17:00:02,354 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 224) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 175) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:00:02,355 INFO L895 garLoopResultBuilder]: At program point L276(lines 231 277) the Hoare annotation is: false [2022-11-25 17:00:02,356 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 172) no Hoare annotation was computed. [2022-11-25 17:00:02,356 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-11-25 17:00:02,357 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 105 129) 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-11-25 17:00:02,357 INFO L895 garLoopResultBuilder]: At program point L260-2(lines 260 274) 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-11-25 17:00:02,357 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 17:00:02,357 INFO L899 garLoopResultBuilder]: For program point L260-3(lines 260 274) no Hoare annotation was computed. [2022-11-25 17:00:02,357 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 169) no Hoare annotation was computed. [2022-11-25 17:00:02,358 INFO L895 garLoopResultBuilder]: At program point L228(lines 203 230) 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-11-25 17:00:02,358 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 289) no Hoare annotation was computed. [2022-11-25 17:00:02,358 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 166) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 224) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,359 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 71) no Hoare annotation was computed. [2022-11-25 17:00:02,361 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 64 71) no Hoare annotation was computed. [2022-11-25 17:00:02,361 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 224) 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-11-25 17:00:02,361 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 163) no Hoare annotation was computed. [2022-11-25 17:00:02,362 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 121) no Hoare annotation was computed. [2022-11-25 17:00:02,362 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 114 121) no Hoare annotation was computed. [2022-11-25 17:00:02,362 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 217) no Hoare annotation was computed. [2022-11-25 17:00:02,363 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 70) no Hoare annotation was computed. [2022-11-25 17:00:02,363 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:00:02,363 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,365 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 160) no Hoare annotation was computed. [2022-11-25 17:00:02,365 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 120) no Hoare annotation was computed. [2022-11-25 17:00:02,365 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 208) no Hoare annotation was computed. [2022-11-25 17:00:02,365 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-11-25 17:00:02,365 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 154) no Hoare annotation was computed. [2022-11-25 17:00:02,366 INFO L895 garLoopResultBuilder]: At program point L200(lines 130 202) 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-11-25 17:00:02,366 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-11-25 17:00:02,369 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-11-25 17:00:02,372 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:00:02,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:00:02 BoogieIcfgContainer [2022-11-25 17:00:02,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:00:02,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:00:02,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:00:02,427 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:00:02,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:30" (3/4) ... [2022-11-25 17:00:02,430 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:00:02,454 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 17:00:02,455 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 17:00:02,455 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:00:02,456 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:00:02,488 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-11-25 17:00:02,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:00:02,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:00:02,519 INFO L158 Benchmark]: Toolchain (without parser) took 92689.08ms. Allocated memory was 134.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 104.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,520 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:00:02,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.82ms. Allocated memory is still 134.2MB. Free memory was 104.4MB in the beginning and 91.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.81ms. Allocated memory is still 134.2MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,525 INFO L158 Benchmark]: Boogie Preprocessor took 40.03ms. Allocated memory is still 134.2MB. Free memory was 88.9MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,525 INFO L158 Benchmark]: RCFGBuilder took 547.19ms. Allocated memory is still 134.2MB. Free memory was 87.1MB in the beginning and 68.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,525 INFO L158 Benchmark]: TraceAbstraction took 91536.64ms. Allocated memory was 134.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 67.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 17:00:02,526 INFO L158 Benchmark]: Witness Printer took 90.40ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 17:00:02,527 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.29ms. Allocated memory is still 109.1MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.82ms. Allocated memory is still 134.2MB. Free memory was 104.4MB in the beginning and 91.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.81ms. Allocated memory is still 134.2MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.03ms. Allocated memory is still 134.2MB. Free memory was 88.9MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.19ms. Allocated memory is still 134.2MB. Free memory was 87.1MB in the beginning and 68.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 91536.64ms. Allocated memory was 134.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 67.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 90.40ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: 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: 91.4s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5109 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5109 mSDsluCounter, 9907 SdHoareTripleChecker+Invalid, 3.0s 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.7s 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: 10.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 7602 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 882 NumberOfFragments, 923 HoareAnnotationTreeSize, 8 FomulaSimplifications, 78742 FormulaSimplificationTreeSizeReduction, 34.4s HoareSimplificationTime, 8 FomulaSimplificationsInter, 245110 FormulaSimplificationTreeSizeReductionInter, 26.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s 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: 260]: 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: 231]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 203]: 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: 130]: 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: 105]: 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: 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) - InvariantResult [Line: 80]: 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: 209]: 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) RESULT: Ultimate proved your program to be correct! [2022-11-25 17:00:02,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a170739-3f19-4f07-9151-0fc7be6a18b3/bin/uautomizer-ZsLfNo2U6R/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