./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:12:53,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:12:53,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:12:53,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:12:53,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:12:53,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:12:53,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:12:53,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:12:53,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:12:53,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:12:53,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:12:53,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:12:53,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:12:53,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:12:53,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:12:53,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:12:53,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:12:53,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:12:53,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:12:53,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:12:53,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:12:53,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:12:53,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:12:53,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:12:53,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:12:53,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:12:53,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:12:53,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:12:53,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:12:53,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:12:53,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:12:53,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:12:53,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:12:53,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:12:53,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:12:53,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:12:53,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:12:53,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:12:53,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:12:53,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:12:53,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:12:53,769 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 21:12:53,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:12:53,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:12:53,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:12:53,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:12:53,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:12:53,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:12:53,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:12:53,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:12:53,791 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:12:53,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:12:53,797 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:12:53,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:12:53,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:12:53,799 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 21:12:53,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:12:53,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:12:53,799 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:12:53,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:12:53,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:12:53,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:12:53,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:12:53,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:12:53,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:12:53,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:12:53,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:12:53,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:12:53,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:12:53,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:12:53,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:12:53,802 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:12:53,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:12:53,802 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:12:53,802 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_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2022-12-13 21:12:54,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:12:54,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:12:54,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:12:54,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:12:54,029 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:12:54,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-12-13 21:12:56,553 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:12:56,695 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:12:56,695 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-12-13 21:12:56,701 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/data/81795649b/7756061287c544c98d44efde41297ee0/FLAG2c8b93fc0 [2022-12-13 21:12:57,110 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/data/81795649b/7756061287c544c98d44efde41297ee0 [2022-12-13 21:12:57,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:12:57,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:12:57,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:12:57,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:12:57,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:12:57,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41edaaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57, skipping insertion in model container [2022-12-13 21:12:57,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:12:57,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:12:57,231 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_49521722-82d3-4e99-9714-6c526f69e7f7/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-12-13 21:12:57,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:12:57,269 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:12:57,277 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_49521722-82d3-4e99-9714-6c526f69e7f7/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-12-13 21:12:57,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:12:57,310 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:12:57,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57 WrapperNode [2022-12-13 21:12:57,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:12:57,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:12:57,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:12:57,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:12:57,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,341 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 224 [2022-12-13 21:12:57,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:12:57,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:12:57,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:12:57,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:12:57,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:12:57,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:12:57,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:12:57,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:12:57,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (1/1) ... [2022-12-13 21:12:57,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:12:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:12:57,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:12:57,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:12:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:12:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 21:12:57,428 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 21:12:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 21:12:57,428 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 21:12:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 21:12:57,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:12:57,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:12:57,499 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:12:57,501 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:12:57,745 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:12:57,750 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:12:57,750 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 21:12:57,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:12:57 BoogieIcfgContainer [2022-12-13 21:12:57,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:12:57,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:12:57,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:12:57,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:12:57,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:12:57" (1/3) ... [2022-12-13 21:12:57,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a587b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:12:57, skipping insertion in model container [2022-12-13 21:12:57,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:12:57" (2/3) ... [2022-12-13 21:12:57,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a587b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:12:57, skipping insertion in model container [2022-12-13 21:12:57,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:12:57" (3/3) ... [2022-12-13 21:12:57,766 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-12-13 21:12:57,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:12:57,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 21:12:57,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:12:57,826 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;@1baee677, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:12:57,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 21:12:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-13 21:12:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:12:57,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:12:57,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:12:57,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:12:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1554820752, now seen corresponding path program 1 times [2022-12-13 21:12:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:57,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549367249] [2022-12-13 21:12:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:57,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:12:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:12:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:12:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:12:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:12:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549367249] [2022-12-13 21:12:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549367249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:12:58,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:12:58,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:12:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232537692] [2022-12-13 21:12:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:12:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:12:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:12:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:12:58,172 INFO L87 Difference]: Start difference. First operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:12:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:12:58,700 INFO L93 Difference]: Finished difference Result 379 states and 571 transitions. [2022-12-13 21:12:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:12:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-12-13 21:12:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:12:58,711 INFO L225 Difference]: With dead ends: 379 [2022-12-13 21:12:58,711 INFO L226 Difference]: Without dead ends: 253 [2022-12-13 21:12:58,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:12:58,717 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 319 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:12:58,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 480 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:12:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-13 21:12:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 210. [2022-12-13 21:12:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.4761904761904763) internal successors, (248), 173 states have internal predecessors, (248), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-12-13 21:12:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2022-12-13 21:12:58,770 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 55 [2022-12-13 21:12:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:12:58,770 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2022-12-13 21:12:58,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:12:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2022-12-13 21:12:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:12:58,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:12:58,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:12:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:12:58,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:12:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -275712372, now seen corresponding path program 1 times [2022-12-13 21:12:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689634143] [2022-12-13 21:12:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:12:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:12:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:12:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:12:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:12:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:58,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689634143] [2022-12-13 21:12:58,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689634143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:12:58,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:12:58,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:12:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298204820] [2022-12-13 21:12:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:12:58,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:12:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:12:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:12:58,905 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:12:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:12:59,414 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2022-12-13 21:12:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:12:59,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-12-13 21:12:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:12:59,418 INFO L225 Difference]: With dead ends: 570 [2022-12-13 21:12:59,418 INFO L226 Difference]: Without dead ends: 369 [2022-12-13 21:12:59,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:12:59,422 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 300 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:12:59,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 777 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:12:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-12-13 21:12:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2022-12-13 21:12:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 250 states have internal predecessors, (358), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-12-13 21:12:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2022-12-13 21:12:59,459 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 55 [2022-12-13 21:12:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:12:59,460 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2022-12-13 21:12:59,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:12:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2022-12-13 21:12:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:12:59,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:12:59,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:12:59,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:12:59,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:12:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1173105650, now seen corresponding path program 1 times [2022-12-13 21:12:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:59,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189201876] [2022-12-13 21:12:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:12:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:12:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:12:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:12:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:12:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189201876] [2022-12-13 21:12:59,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189201876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:12:59,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:12:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:12:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390606938] [2022-12-13 21:12:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:12:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:12:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:12:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:12:59,586 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:00,136 INFO L93 Difference]: Finished difference Result 930 states and 1330 transitions. [2022-12-13 21:13:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:13:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-12-13 21:13:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:00,141 INFO L225 Difference]: With dead ends: 930 [2022-12-13 21:13:00,141 INFO L226 Difference]: Without dead ends: 636 [2022-12-13 21:13:00,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:13:00,143 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 355 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:00,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 765 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:13:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-12-13 21:13:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 482. [2022-12-13 21:13:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 391 states have (on average 1.4552429667519182) internal successors, (569), 399 states have internal predecessors, (569), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-12-13 21:13:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2022-12-13 21:13:00,172 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 55 [2022-12-13 21:13:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:00,173 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2022-12-13 21:13:00,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2022-12-13 21:13:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:13:00,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:00,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:00,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:13:00,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -924959156, now seen corresponding path program 1 times [2022-12-13 21:13:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:00,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271009894] [2022-12-13 21:13:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:00,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271009894] [2022-12-13 21:13:00,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271009894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:00,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:00,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:13:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812445235] [2022-12-13 21:13:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:00,264 INFO L87 Difference]: Start difference. First operand 482 states and 688 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:00,815 INFO L93 Difference]: Finished difference Result 1494 states and 2133 transitions. [2022-12-13 21:13:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:13:00,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-12-13 21:13:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:00,819 INFO L225 Difference]: With dead ends: 1494 [2022-12-13 21:13:00,819 INFO L226 Difference]: Without dead ends: 1021 [2022-12-13 21:13:00,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:13:00,821 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 295 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:00,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 739 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:13:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-12-13 21:13:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 783. [2022-12-13 21:13:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 634 states have (on average 1.4369085173501577) internal successors, (911), 646 states have internal predecessors, (911), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-12-13 21:13:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1116 transitions. [2022-12-13 21:13:00,862 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1116 transitions. Word has length 55 [2022-12-13 21:13:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:00,862 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1116 transitions. [2022-12-13 21:13:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1116 transitions. [2022-12-13 21:13:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:13:00,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:00,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:00,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:13:00,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash -501312434, now seen corresponding path program 1 times [2022-12-13 21:13:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:00,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769672277] [2022-12-13 21:13:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769672277] [2022-12-13 21:13:00,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769672277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:00,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:00,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:13:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055404745] [2022-12-13 21:13:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:13:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:13:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:13:00,930 INFO L87 Difference]: Start difference. First operand 783 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:01,382 INFO L93 Difference]: Finished difference Result 2167 states and 3093 transitions. [2022-12-13 21:13:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:13:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-12-13 21:13:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:01,389 INFO L225 Difference]: With dead ends: 2167 [2022-12-13 21:13:01,389 INFO L226 Difference]: Without dead ends: 1394 [2022-12-13 21:13:01,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:13:01,393 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:01,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 522 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:13:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-12-13 21:13:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1187. [2022-12-13 21:13:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 955 states have (on average 1.4094240837696335) internal successors, (1346), 976 states have internal predecessors, (1346), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-12-13 21:13:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1659 transitions. [2022-12-13 21:13:01,464 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1659 transitions. Word has length 55 [2022-12-13 21:13:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:01,464 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1659 transitions. [2022-12-13 21:13:01,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1659 transitions. [2022-12-13 21:13:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:01,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:01,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:01,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:13:01,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 777880458, now seen corresponding path program 1 times [2022-12-13 21:13:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:01,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035501602] [2022-12-13 21:13:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035501602] [2022-12-13 21:13:01,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035501602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:01,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:01,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:13:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573933523] [2022-12-13 21:13:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:01,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:01,546 INFO L87 Difference]: Start difference. First operand 1187 states and 1659 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:01,963 INFO L93 Difference]: Finished difference Result 2581 states and 3659 transitions. [2022-12-13 21:13:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:13:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:01,970 INFO L225 Difference]: With dead ends: 2581 [2022-12-13 21:13:01,970 INFO L226 Difference]: Without dead ends: 1404 [2022-12-13 21:13:01,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:13:01,973 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 170 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:01,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 530 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:13:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-12-13 21:13:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1202. [2022-12-13 21:13:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 970 states have (on average 1.3938144329896907) internal successors, (1352), 991 states have internal predecessors, (1352), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-12-13 21:13:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1665 transitions. [2022-12-13 21:13:02,034 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1665 transitions. Word has length 56 [2022-12-13 21:13:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:02,034 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1665 transitions. [2022-12-13 21:13:02,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1665 transitions. [2022-12-13 21:13:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:02,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:02,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:13:02,036 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 705493900, now seen corresponding path program 1 times [2022-12-13 21:13:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873048517] [2022-12-13 21:13:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:02,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873048517] [2022-12-13 21:13:02,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873048517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:02,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:02,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:13:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607871693] [2022-12-13 21:13:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:02,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:02,120 INFO L87 Difference]: Start difference. First operand 1202 states and 1665 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:02,528 INFO L93 Difference]: Finished difference Result 2636 states and 3704 transitions. [2022-12-13 21:13:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:13:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:02,532 INFO L225 Difference]: With dead ends: 2636 [2022-12-13 21:13:02,532 INFO L226 Difference]: Without dead ends: 1444 [2022-12-13 21:13:02,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:13:02,535 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 135 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:02,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 525 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:13:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-12-13 21:13:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1244. [2022-12-13 21:13:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1012 states have (on average 1.3774703557312253) internal successors, (1394), 1033 states have internal predecessors, (1394), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-12-13 21:13:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1707 transitions. [2022-12-13 21:13:02,595 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1707 transitions. Word has length 56 [2022-12-13 21:13:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:02,595 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1707 transitions. [2022-12-13 21:13:02,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1707 transitions. [2022-12-13 21:13:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:02,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:02,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:13:02,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1666245362, now seen corresponding path program 1 times [2022-12-13 21:13:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:02,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880938913] [2022-12-13 21:13:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880938913] [2022-12-13 21:13:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880938913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:02,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:02,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:13:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673265858] [2022-12-13 21:13:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:13:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:13:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:13:02,703 INFO L87 Difference]: Start difference. First operand 1244 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:03,171 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-12-13 21:13:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:13:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:03,175 INFO L225 Difference]: With dead ends: 1802 [2022-12-13 21:13:03,175 INFO L226 Difference]: Without dead ends: 1068 [2022-12-13 21:13:03,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:13:03,177 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 372 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:03,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 585 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:13:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-12-13 21:13:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2022-12-13 21:13:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3662551440329218) internal successors, (996), 743 states have internal predecessors, (996), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-12-13 21:13:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1211 transitions. [2022-12-13 21:13:03,226 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1211 transitions. Word has length 56 [2022-12-13 21:13:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:03,226 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1211 transitions. [2022-12-13 21:13:03,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1211 transitions. [2022-12-13 21:13:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:03,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:03,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:03,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:13:03,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1447390644, now seen corresponding path program 1 times [2022-12-13 21:13:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:03,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397218266] [2022-12-13 21:13:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:03,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397218266] [2022-12-13 21:13:03,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397218266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:03,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:03,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:13:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398214065] [2022-12-13 21:13:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:13:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:13:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:13:03,321 INFO L87 Difference]: Start difference. First operand 898 states and 1211 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:03,861 INFO L93 Difference]: Finished difference Result 1745 states and 2359 transitions. [2022-12-13 21:13:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 21:13:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:03,865 INFO L225 Difference]: With dead ends: 1745 [2022-12-13 21:13:03,865 INFO L226 Difference]: Without dead ends: 1096 [2022-12-13 21:13:03,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:13:03,867 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 369 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:03,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 580 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:13:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-12-13 21:13:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2022-12-13 21:13:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3613793103448275) internal successors, (987), 737 states have internal predecessors, (987), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-12-13 21:13:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2022-12-13 21:13:03,916 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 56 [2022-12-13 21:13:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:03,917 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2022-12-13 21:13:03,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2022-12-13 21:13:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:03,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:03,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:13:03,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1024688818, now seen corresponding path program 1 times [2022-12-13 21:13:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:03,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640421037] [2022-12-13 21:13:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640421037] [2022-12-13 21:13:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640421037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:04,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:04,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:13:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246651450] [2022-12-13 21:13:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:13:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:13:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:13:04,010 INFO L87 Difference]: Start difference. First operand 892 states and 1194 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:04,463 INFO L93 Difference]: Finished difference Result 1689 states and 2257 transitions. [2022-12-13 21:13:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:13:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:04,467 INFO L225 Difference]: With dead ends: 1689 [2022-12-13 21:13:04,467 INFO L226 Difference]: Without dead ends: 952 [2022-12-13 21:13:04,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:13:04,470 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 409 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:04,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 537 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:13:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-12-13 21:13:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 780. [2022-12-13 21:13:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 638 states have (on average 1.3573667711598747) internal successors, (866), 648 states have internal predecessors, (866), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-12-13 21:13:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2022-12-13 21:13:04,525 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 56 [2022-12-13 21:13:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:04,525 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2022-12-13 21:13:04,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2022-12-13 21:13:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:13:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:04,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:04,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:13:04,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1842337268, now seen corresponding path program 1 times [2022-12-13 21:13:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:04,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597063894] [2022-12-13 21:13:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:04,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597063894] [2022-12-13 21:13:04,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597063894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:04,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:04,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:13:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968263532] [2022-12-13 21:13:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:13:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:13:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:13:04,587 INFO L87 Difference]: Start difference. First operand 780 states and 1038 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:04,955 INFO L93 Difference]: Finished difference Result 2410 states and 3254 transitions. [2022-12-13 21:13:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:13:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-12-13 21:13:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:04,960 INFO L225 Difference]: With dead ends: 2410 [2022-12-13 21:13:04,960 INFO L226 Difference]: Without dead ends: 1641 [2022-12-13 21:13:04,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:13:04,962 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 418 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:04,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 338 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:13:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-12-13 21:13:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1467. [2022-12-13 21:13:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1197 states have (on average 1.3350041771094403) internal successors, (1598), 1214 states have internal predecessors, (1598), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-12-13 21:13:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1957 transitions. [2022-12-13 21:13:05,043 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1957 transitions. Word has length 56 [2022-12-13 21:13:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:05,043 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1957 transitions. [2022-12-13 21:13:05,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:13:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1957 transitions. [2022-12-13 21:13:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:13:05,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:05,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:05,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:13:05,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1987017488, now seen corresponding path program 1 times [2022-12-13 21:13:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806065291] [2022-12-13 21:13:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:13:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:05,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806065291] [2022-12-13 21:13:05,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806065291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:05,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:05,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:13:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907176449] [2022-12-13 21:13:05,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:05,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:13:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:13:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:13:05,081 INFO L87 Difference]: Start difference. First operand 1467 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:13:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:05,463 INFO L93 Difference]: Finished difference Result 4191 states and 5620 transitions. [2022-12-13 21:13:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:13:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-12-13 21:13:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:05,470 INFO L225 Difference]: With dead ends: 4191 [2022-12-13 21:13:05,471 INFO L226 Difference]: Without dead ends: 2738 [2022-12-13 21:13:05,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:13:05,474 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 329 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:05,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 386 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:13:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-12-13 21:13:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2392. [2022-12-13 21:13:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1948 states have (on average 1.320328542094456) internal successors, (2572), 1975 states have internal predecessors, (2572), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-12-13 21:13:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3160 transitions. [2022-12-13 21:13:05,592 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3160 transitions. Word has length 57 [2022-12-13 21:13:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:05,592 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3160 transitions. [2022-12-13 21:13:05,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:13:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3160 transitions. [2022-12-13 21:13:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 21:13:05,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:05,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:05,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:13:05,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:05,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash 772242277, now seen corresponding path program 1 times [2022-12-13 21:13:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:05,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023088994] [2022-12-13 21:13:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 21:13:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:13:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:05,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023088994] [2022-12-13 21:13:05,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023088994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:05,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:05,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:13:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130747087] [2022-12-13 21:13:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:05,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:13:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:13:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:13:05,659 INFO L87 Difference]: Start difference. First operand 2392 states and 3160 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:13:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:06,476 INFO L93 Difference]: Finished difference Result 7577 states and 10103 transitions. [2022-12-13 21:13:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 21:13:06,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-12-13 21:13:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:06,488 INFO L225 Difference]: With dead ends: 7577 [2022-12-13 21:13:06,488 INFO L226 Difference]: Without dead ends: 5201 [2022-12-13 21:13:06,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:13:06,492 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 739 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:06,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 528 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:13:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-12-13 21:13:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4675. [2022-12-13 21:13:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4675 states, 3792 states have (on average 1.298259493670886) internal successors, (4923), 3861 states have internal predecessors, (4923), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-12-13 21:13:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6197 transitions. [2022-12-13 21:13:06,748 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6197 transitions. Word has length 74 [2022-12-13 21:13:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:06,748 INFO L495 AbstractCegarLoop]: Abstraction has 4675 states and 6197 transitions. [2022-12-13 21:13:06,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:13:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6197 transitions. [2022-12-13 21:13:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 21:13:06,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:06,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:13:06,750 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 237737077, now seen corresponding path program 1 times [2022-12-13 21:13:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:06,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104354222] [2022-12-13 21:13:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:13:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:13:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 21:13:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 21:13:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104354222] [2022-12-13 21:13:06,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104354222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:06,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:06,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:13:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101018629] [2022-12-13 21:13:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:06,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:06,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:06,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:06,896 INFO L87 Difference]: Start difference. First operand 4675 states and 6197 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:13:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:07,499 INFO L93 Difference]: Finished difference Result 8997 states and 11865 transitions. [2022-12-13 21:13:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:13:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-12-13 21:13:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:07,512 INFO L225 Difference]: With dead ends: 8997 [2022-12-13 21:13:07,513 INFO L226 Difference]: Without dead ends: 5271 [2022-12-13 21:13:07,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:13:07,519 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 459 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:07,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 423 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:13:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-12-13 21:13:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4643. [2022-12-13 21:13:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3756 states have (on average 1.286741214057508) internal successors, (4833), 3829 states have internal predecessors, (4833), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-12-13 21:13:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6026 transitions. [2022-12-13 21:13:07,793 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6026 transitions. Word has length 90 [2022-12-13 21:13:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:07,793 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6026 transitions. [2022-12-13 21:13:07,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:13:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6026 transitions. [2022-12-13 21:13:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 21:13:07,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:07,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:07,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:13:07,795 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1804495027, now seen corresponding path program 1 times [2022-12-13 21:13:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412865630] [2022-12-13 21:13:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:13:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:13:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 21:13:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 21:13:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:07,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412865630] [2022-12-13 21:13:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412865630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:13:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033556123] [2022-12-13 21:13:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:13:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:13:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:13:07,835 INFO L87 Difference]: Start difference. First operand 4643 states and 6026 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:13:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:08,213 INFO L93 Difference]: Finished difference Result 5107 states and 6643 transitions. [2022-12-13 21:13:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:13:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-12-13 21:13:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:08,224 INFO L225 Difference]: With dead ends: 5107 [2022-12-13 21:13:08,224 INFO L226 Difference]: Without dead ends: 4196 [2022-12-13 21:13:08,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:13:08,227 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 274 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:08,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 238 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:13:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2022-12-13 21:13:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 3734. [2022-12-13 21:13:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.2913776015857283) internal successors, (3909), 3088 states have internal predecessors, (3909), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-12-13 21:13:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4861 transitions. [2022-12-13 21:13:08,424 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4861 transitions. Word has length 90 [2022-12-13 21:13:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:08,425 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4861 transitions. [2022-12-13 21:13:08,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:13:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4861 transitions. [2022-12-13 21:13:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 21:13:08,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:08,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:08,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:13:08,426 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1432721063, now seen corresponding path program 1 times [2022-12-13 21:13:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538114232] [2022-12-13 21:13:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:13:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:13:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:13:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:13:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:08,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538114232] [2022-12-13 21:13:08,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538114232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:08,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:08,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:13:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13861801] [2022-12-13 21:13:08,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:08,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:13:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:13:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:13:08,490 INFO L87 Difference]: Start difference. First operand 3734 states and 4861 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:13:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:09,243 INFO L93 Difference]: Finished difference Result 7161 states and 9288 transitions. [2022-12-13 21:13:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 21:13:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-12-13 21:13:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:09,252 INFO L225 Difference]: With dead ends: 7161 [2022-12-13 21:13:09,253 INFO L226 Difference]: Without dead ends: 4113 [2022-12-13 21:13:09,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 21:13:09,257 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 1052 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 610 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:13:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-12-13 21:13:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3734. [2022-12-13 21:13:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.276841757515692) internal successors, (3865), 3088 states have internal predecessors, (3865), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-12-13 21:13:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4751 transitions. [2022-12-13 21:13:09,495 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4751 transitions. Word has length 91 [2022-12-13 21:13:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:09,496 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4751 transitions. [2022-12-13 21:13:09,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:13:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4751 transitions. [2022-12-13 21:13:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 21:13:09,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:09,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:09,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:13:09,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 578901004, now seen corresponding path program 1 times [2022-12-13 21:13:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:09,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003230558] [2022-12-13 21:13:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:13:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:13:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:13:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 21:13:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:13:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 21:13:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:13:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:13:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 21:13:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:09,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003230558] [2022-12-13 21:13:09,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003230558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:13:09,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:13:09,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:13:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120896523] [2022-12-13 21:13:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:13:09,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:13:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:13:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:13:09,565 INFO L87 Difference]: Start difference. First operand 3734 states and 4751 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:13:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:13:09,976 INFO L93 Difference]: Finished difference Result 4196 states and 5368 transitions. [2022-12-13 21:13:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:13:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 97 [2022-12-13 21:13:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:13:09,984 INFO L225 Difference]: With dead ends: 4196 [2022-12-13 21:13:09,984 INFO L226 Difference]: Without dead ends: 4195 [2022-12-13 21:13:09,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:13:09,985 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 269 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:13:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 226 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:13:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2022-12-13 21:13:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 3733. [2022-12-13 21:13:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 3027 states have (on average 1.2728774364056823) internal successors, (3853), 3087 states have internal predecessors, (3853), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-12-13 21:13:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 4739 transitions. [2022-12-13 21:13:10,205 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 4739 transitions. Word has length 97 [2022-12-13 21:13:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:13:10,205 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 4739 transitions. [2022-12-13 21:13:10,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:13:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4739 transitions. [2022-12-13 21:13:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 21:13:10,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:13:10,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:10,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:13:10,207 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 21:13:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 766062250, now seen corresponding path program 1 times [2022-12-13 21:13:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790566146] [2022-12-13 21:13:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:13:10,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:13:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:13:10,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:13:10,242 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:13:10,243 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-13 21:13:10,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-13 21:13:10,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-13 21:13:10,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-13 21:13:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:13:10,247 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:10,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:13:10,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:13:10 BoogieIcfgContainer [2022-12-13 21:13:10,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:13:10,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:13:10,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:13:10,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:13:10,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:12:57" (3/4) ... [2022-12-13 21:13:10,297 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:13:10,341 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:13:10,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:13:10,342 INFO L158 Benchmark]: Toolchain (without parser) took 13229.17ms. Allocated memory was 123.7MB in the beginning and 469.8MB in the end (delta: 346.0MB). Free memory was 82.3MB in the beginning and 329.5MB in the end (delta: -247.2MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,342 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:13:10,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.70ms. Allocated memory is still 123.7MB. Free memory was 82.3MB in the beginning and 69.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.82ms. Allocated memory is still 123.7MB. Free memory was 69.3MB in the beginning and 67.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,343 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 123.7MB. Free memory was 67.3MB in the beginning and 65.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,343 INFO L158 Benchmark]: RCFGBuilder took 384.51ms. Allocated memory is still 123.7MB. Free memory was 65.5MB in the beginning and 47.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,343 INFO L158 Benchmark]: TraceAbstraction took 12540.48ms. Allocated memory was 123.7MB in the beginning and 469.8MB in the end (delta: 346.0MB). Free memory was 47.0MB in the beginning and 336.9MB in the end (delta: -289.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,343 INFO L158 Benchmark]: Witness Printer took 46.76ms. Allocated memory is still 469.8MB. Free memory was 336.9MB in the beginning and 329.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 21:13:10,345 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.13ms. Allocated memory is still 123.7MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.70ms. Allocated memory is still 123.7MB. Free memory was 82.3MB in the beginning and 69.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.82ms. Allocated memory is still 123.7MB. Free memory was 69.3MB in the beginning and 67.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 123.7MB. Free memory was 67.3MB in the beginning and 65.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.51ms. Allocated memory is still 123.7MB. Free memory was 65.5MB in the beginning and 47.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12540.48ms. Allocated memory was 123.7MB in the beginning and 469.8MB in the end (delta: 346.0MB). Free memory was 47.0MB in the beginning and 336.9MB in the end (delta: -289.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 46.76ms. Allocated memory is still 469.8MB. Free memory was 336.9MB in the beginning and 329.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 121 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6847 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6680 mSDsluCounter, 8789 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6430 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8021 IncrementalHoareTripleChecker+Invalid, 9336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 2359 mSDtfsCounter, 8021 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred in iteration=13, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 4633 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 2434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 119/119 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 21:13:10,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49521722-82d3-4e99-9714-6c526f69e7f7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)