./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/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_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/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_bafaf692-f370-46b6-98ad-26b5aa566c08/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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- 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 16:53:25,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:53:25,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:53:25,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:53:25,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:53:25,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:53:25,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:53:25,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:53:25,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:53:25,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:53:25,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:53:25,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:53:25,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:53:25,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:53:25,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:53:25,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:53:25,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:53:25,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:53:25,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:53:25,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:53:25,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:53:25,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:53:25,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:53:25,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:53:25,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:53:25,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:53:25,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:53:25,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:53:25,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:53:25,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:53:25,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:53:25,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:53:25,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:53:25,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:53:25,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:53:25,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:53:25,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:53:25,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:53:25,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:53:25,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:53:25,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:53:25,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 16:53:25,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:53:25,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:53:25,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:53:25,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:53:25,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:53:25,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:53:25,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:53:25,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:53:25,129 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:53:25,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:53:25,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:53:25,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:53:25,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:53:25,130 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 16:53:25,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:53:25,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:53:25,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:53:25,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:53:25,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:53:25,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:53:25,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:53:25,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:53:25,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:53:25,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:53:25,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:53:25,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:53:25,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:53:25,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:53:25,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:53:25,133 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:53:25,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:53:25,134 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:53:25,134 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_bafaf692-f370-46b6-98ad-26b5aa566c08/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_bafaf692-f370-46b6-98ad-26b5aa566c08/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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-12-13 16:53:25,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:53:25,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:53:25,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:53:25,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:53:25,336 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:53:25,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-12-13 16:53:27,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:53:28,051 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:53:28,051 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-12-13 16:53:28,057 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/data/7e9682388/bcaf752c72f34c91be5282106008950f/FLAGc191ab8ee [2022-12-13 16:53:28,068 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/data/7e9682388/bcaf752c72f34c91be5282106008950f [2022-12-13 16:53:28,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:53:28,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:53:28,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:53:28,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:53:28,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:53:28,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419c2b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28, skipping insertion in model container [2022-12-13 16:53:28,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:53:28,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:53:28,198 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_bafaf692-f370-46b6-98ad-26b5aa566c08/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-12-13 16:53:28,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:53:28,238 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:53:28,247 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_bafaf692-f370-46b6-98ad-26b5aa566c08/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-12-13 16:53:28,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:53:28,273 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:53:28,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28 WrapperNode [2022-12-13 16:53:28,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:53:28,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:53:28,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:53:28,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:53:28,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,305 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 219 [2022-12-13 16:53:28,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:53:28,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:53:28,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:53:28,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:53:28,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:53:28,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:53:28,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:53:28,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:53:28,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (1/1) ... [2022-12-13 16:53:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:53:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:53:28,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:53:28,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 16:53:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 16:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 16:53:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 16:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 16:53:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 16:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 16:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 16:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 16:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 16:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 16:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 16:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:53:28,456 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:53:28,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:53:28,697 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:53:28,703 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:53:28,703 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 16:53:28,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:53:28 BoogieIcfgContainer [2022-12-13 16:53:28,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:53:28,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:53:28,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:53:28,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:53:28,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:53:28" (1/3) ... [2022-12-13 16:53:28,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9de5555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:53:28, skipping insertion in model container [2022-12-13 16:53:28,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:53:28" (2/3) ... [2022-12-13 16:53:28,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9de5555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:53:28, skipping insertion in model container [2022-12-13 16:53:28,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:53:28" (3/3) ... [2022-12-13 16:53:28,711 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-12-13 16:53:28,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:53:28,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 16:53:28,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:53:28,766 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;@7cb37020, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:53:28,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 16:53:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 16:53:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:53:28,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:28,776 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 16:53:28,777 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 16:53:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1696984144, now seen corresponding path program 1 times [2022-12-13 16:53:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077298068] [2022-12-13 16:53:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,130 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 16:53:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077298068] [2022-12-13 16:53:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077298068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:29,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:29,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:53:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648871952] [2022-12-13 16:53:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:53:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:53:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:53:29,167 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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 16:53:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:29,653 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2022-12-13 16:53:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:53:29,655 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 16:53:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:29,663 INFO L225 Difference]: With dead ends: 357 [2022-12-13 16:53:29,663 INFO L226 Difference]: Without dead ends: 243 [2022-12-13 16:53:29,665 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 16:53:29,668 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 307 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:29,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 426 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-13 16:53:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2022-12-13 16:53:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 163 states have internal predecessors, (230), 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 16:53:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2022-12-13 16:53:29,717 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 55 [2022-12-13 16:53:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:29,717 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2022-12-13 16:53:29,717 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 16:53:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2022-12-13 16:53:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:53:29,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:29,719 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 16:53:29,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:53:29,720 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 16:53:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 767450028, now seen corresponding path program 1 times [2022-12-13 16:53:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118772430] [2022-12-13 16:53:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:29,881 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 16:53:29,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:29,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118772430] [2022-12-13 16:53:29,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118772430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:29,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:29,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885796762] [2022-12-13 16:53:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:29,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:29,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:29,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:29,884 INFO L87 Difference]: Start difference. First operand 200 states and 283 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 16:53:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:30,409 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2022-12-13 16:53:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:53:30,410 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 16:53:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:30,413 INFO L225 Difference]: With dead ends: 545 [2022-12-13 16:53:30,413 INFO L226 Difference]: Without dead ends: 354 [2022-12-13 16:53:30,415 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 16:53:30,416 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 291 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 678 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 16:53:30,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 678 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-12-13 16:53:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2022-12-13 16:53:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.445414847161572) internal successors, (331), 235 states have internal predecessors, (331), 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 16:53:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2022-12-13 16:53:30,461 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 55 [2022-12-13 16:53:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:30,461 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2022-12-13 16:53:30,462 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 16:53:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2022-12-13 16:53:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:53:30,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:30,463 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 16:53:30,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:53:30,464 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 16:53:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -129943250, now seen corresponding path program 1 times [2022-12-13 16:53:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:30,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771055367] [2022-12-13 16:53:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:30,582 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 16:53:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771055367] [2022-12-13 16:53:30,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771055367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:30,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:30,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040499812] [2022-12-13 16:53:30,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:30,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:30,585 INFO L87 Difference]: Start difference. First operand 288 states and 406 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 16:53:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:31,137 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2022-12-13 16:53:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:53:31,138 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 16:53:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:31,142 INFO L225 Difference]: With dead ends: 890 [2022-12-13 16:53:31,142 INFO L226 Difference]: Without dead ends: 611 [2022-12-13 16:53:31,144 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 16:53:31,145 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 346 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 666 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 16:53:31,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 666 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-12-13 16:53:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 457. [2022-12-13 16:53:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.4316939890710383) internal successors, (524), 374 states have internal predecessors, (524), 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 16:53:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 643 transitions. [2022-12-13 16:53:31,197 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 643 transitions. Word has length 55 [2022-12-13 16:53:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:31,197 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 643 transitions. [2022-12-13 16:53:31,197 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 16:53:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 643 transitions. [2022-12-13 16:53:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:53:31,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:31,199 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 16:53:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:53:31,200 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 16:53:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash 118203244, now seen corresponding path program 1 times [2022-12-13 16:53:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:31,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498419504] [2022-12-13 16:53:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,303 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 16:53:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498419504] [2022-12-13 16:53:31,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498419504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:31,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:31,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758082972] [2022-12-13 16:53:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:31,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:31,306 INFO L87 Difference]: Start difference. First operand 457 states and 643 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 16:53:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:31,884 INFO L93 Difference]: Finished difference Result 1424 states and 2007 transitions. [2022-12-13 16:53:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:53:31,885 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 16:53:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:31,892 INFO L225 Difference]: With dead ends: 1424 [2022-12-13 16:53:31,892 INFO L226 Difference]: Without dead ends: 976 [2022-12-13 16:53:31,894 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 16:53:31,896 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 286 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 640 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 16:53:31,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 640 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-12-13 16:53:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 758. [2022-12-13 16:53:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 609 states have (on average 1.4220032840722496) internal successors, (866), 621 states have internal predecessors, (866), 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 16:53:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1071 transitions. [2022-12-13 16:53:31,947 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1071 transitions. Word has length 55 [2022-12-13 16:53:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:31,948 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1071 transitions. [2022-12-13 16:53:31,948 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 16:53:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1071 transitions. [2022-12-13 16:53:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:53:31,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:31,949 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 16:53:31,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:53:31,949 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 16:53:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash 541849966, now seen corresponding path program 1 times [2022-12-13 16:53:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:31,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119099929] [2022-12-13 16:53:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,015 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 16:53:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119099929] [2022-12-13 16:53:32,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119099929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:32,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:32,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:53:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060943200] [2022-12-13 16:53:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:32,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:53:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:32,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:53:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:53:32,018 INFO L87 Difference]: Start difference. First operand 758 states and 1071 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 16:53:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:32,532 INFO L93 Difference]: Finished difference Result 2117 states and 3003 transitions. [2022-12-13 16:53:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:53:32,533 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 16:53:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:32,539 INFO L225 Difference]: With dead ends: 2117 [2022-12-13 16:53:32,539 INFO L226 Difference]: Without dead ends: 1369 [2022-12-13 16:53:32,540 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 16:53:32,541 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 407 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 486 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:32,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 486 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-12-13 16:53:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1162. [2022-12-13 16:53:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 930 states have (on average 1.3989247311827957) internal successors, (1301), 951 states have internal predecessors, (1301), 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 16:53:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1614 transitions. [2022-12-13 16:53:32,595 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1614 transitions. Word has length 55 [2022-12-13 16:53:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:32,596 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1614 transitions. [2022-12-13 16:53:32,596 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 16:53:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1614 transitions. [2022-12-13 16:53:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:32,597 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:32,597 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 16:53:32,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:53:32,597 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 16:53:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2042576822, now seen corresponding path program 1 times [2022-12-13 16:53:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:32,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142218188] [2022-12-13 16:53:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:32,679 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 16:53:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:32,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142218188] [2022-12-13 16:53:32,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142218188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:32,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136810508] [2022-12-13 16:53:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:32,682 INFO L87 Difference]: Start difference. First operand 1162 states and 1614 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 16:53:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:33,098 INFO L93 Difference]: Finished difference Result 2531 states and 3569 transitions. [2022-12-13 16:53:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:53:33,098 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 16:53:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:33,105 INFO L225 Difference]: With dead ends: 2531 [2022-12-13 16:53:33,105 INFO L226 Difference]: Without dead ends: 1379 [2022-12-13 16:53:33,108 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 16:53:33,109 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 476 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 16:53:33,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 476 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:53:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-12-13 16:53:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1177. [2022-12-13 16:53:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3830687830687831) internal successors, (1307), 966 states have internal predecessors, (1307), 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 16:53:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2022-12-13 16:53:33,220 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 56 [2022-12-13 16:53:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:33,220 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2022-12-13 16:53:33,221 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 16:53:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2022-12-13 16:53:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:33,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:33,222 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 16:53:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:53:33,223 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 16:53:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2114963380, now seen corresponding path program 1 times [2022-12-13 16:53:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332152870] [2022-12-13 16:53:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,315 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 16:53:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:33,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332152870] [2022-12-13 16:53:33,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332152870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:33,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:33,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308649608] [2022-12-13 16:53:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:33,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:33,317 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 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 16:53:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:33,767 INFO L93 Difference]: Finished difference Result 2586 states and 3614 transitions. [2022-12-13 16:53:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:53:33,768 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 16:53:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:33,779 INFO L225 Difference]: With dead ends: 2586 [2022-12-13 16:53:33,780 INFO L226 Difference]: Without dead ends: 1419 [2022-12-13 16:53:33,784 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 16:53:33,785 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 135 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 471 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 16:53:33,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 471 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:53:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-12-13 16:53:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1219. [2022-12-13 16:53:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 987 states have (on average 1.3667679837892603) internal successors, (1349), 1008 states have internal predecessors, (1349), 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 16:53:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1662 transitions. [2022-12-13 16:53:33,912 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1662 transitions. Word has length 56 [2022-12-13 16:53:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:33,912 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1662 transitions. [2022-12-13 16:53:33,912 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 16:53:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1662 transitions. [2022-12-13 16:53:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:33,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:33,914 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 16:53:33,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:53:33,914 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 16:53:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash -191735346, now seen corresponding path program 1 times [2022-12-13 16:53:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:33,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937957161] [2022-12-13 16:53:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,037 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 16:53:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937957161] [2022-12-13 16:53:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937957161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:53:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152783958] [2022-12-13 16:53:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:53:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:53:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:53:34,039 INFO L87 Difference]: Start difference. First operand 1219 states and 1662 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 16:53:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:34,528 INFO L93 Difference]: Finished difference Result 1767 states and 2410 transitions. [2022-12-13 16:53:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:53:34,529 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 16:53:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:34,533 INFO L225 Difference]: With dead ends: 1767 [2022-12-13 16:53:34,533 INFO L226 Difference]: Without dead ends: 1048 [2022-12-13 16:53:34,535 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 16:53:34,536 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 453 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:34,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 459 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:53:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-12-13 16:53:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 878. [2022-12-13 16:53:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 709 states have (on average 1.3540197461212975) internal successors, (960), 723 states have internal predecessors, (960), 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 16:53:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1175 transitions. [2022-12-13 16:53:34,605 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1175 transitions. Word has length 56 [2022-12-13 16:53:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:34,606 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1175 transitions. [2022-12-13 16:53:34,606 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 16:53:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1175 transitions. [2022-12-13 16:53:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:34,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:34,607 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 16:53:34,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:53:34,607 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 16:53:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 27119372, now seen corresponding path program 1 times [2022-12-13 16:53:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:34,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359651020] [2022-12-13 16:53:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:34,708 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 16:53:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359651020] [2022-12-13 16:53:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359651020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:34,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:34,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:53:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444622856] [2022-12-13 16:53:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:53:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:53:34,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:53:34,710 INFO L87 Difference]: Start difference. First operand 878 states and 1175 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 16:53:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:35,213 INFO L93 Difference]: Finished difference Result 1710 states and 2296 transitions. [2022-12-13 16:53:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:53:35,213 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 16:53:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:35,220 INFO L225 Difference]: With dead ends: 1710 [2022-12-13 16:53:35,221 INFO L226 Difference]: Without dead ends: 1076 [2022-12-13 16:53:35,223 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 16:53:35,224 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 438 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:35,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 454 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:53:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-12-13 16:53:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 872. [2022-12-13 16:53:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.348936170212766) internal successors, (951), 717 states have internal predecessors, (951), 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 16:53:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1158 transitions. [2022-12-13 16:53:35,297 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1158 transitions. Word has length 56 [2022-12-13 16:53:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:35,297 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1158 transitions. [2022-12-13 16:53:35,297 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 16:53:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1158 transitions. [2022-12-13 16:53:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:35,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:35,298 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 16:53:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:53:35,298 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 16:53:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 449821198, now seen corresponding path program 1 times [2022-12-13 16:53:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080071896] [2022-12-13 16:53:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:35,402 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 16:53:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080071896] [2022-12-13 16:53:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080071896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:35,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:35,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:53:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062830375] [2022-12-13 16:53:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:35,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:53:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:53:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:53:35,404 INFO L87 Difference]: Start difference. First operand 872 states and 1158 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 16:53:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:35,904 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2022-12-13 16:53:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:53:35,904 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 16:53:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:35,909 INFO L225 Difference]: With dead ends: 1649 [2022-12-13 16:53:35,909 INFO L226 Difference]: Without dead ends: 932 [2022-12-13 16:53:35,911 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 16:53:35,912 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:35,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 550 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:53:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-12-13 16:53:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 760. [2022-12-13 16:53:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.343042071197411) internal successors, (830), 628 states have internal predecessors, (830), 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 16:53:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1002 transitions. [2022-12-13 16:53:35,977 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1002 transitions. Word has length 56 [2022-12-13 16:53:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:35,977 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1002 transitions. [2022-12-13 16:53:35,978 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 16:53:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1002 transitions. [2022-12-13 16:53:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:53:35,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:35,978 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 16:53:35,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:53:35,979 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 16:53:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -367827252, now seen corresponding path program 1 times [2022-12-13 16:53:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:35,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937531718] [2022-12-13 16:53:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,041 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 16:53:36,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:36,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937531718] [2022-12-13 16:53:36,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937531718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:36,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:36,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:53:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917283284] [2022-12-13 16:53:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:36,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:53:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:53:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:53:36,044 INFO L87 Difference]: Start difference. First operand 760 states and 1002 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 16:53:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:36,380 INFO L93 Difference]: Finished difference Result 2370 states and 3182 transitions. [2022-12-13 16:53:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:53:36,381 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 16:53:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:36,386 INFO L225 Difference]: With dead ends: 2370 [2022-12-13 16:53:36,387 INFO L226 Difference]: Without dead ends: 1621 [2022-12-13 16:53:36,389 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 16:53:36,390 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 418 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 302 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 16:53:36,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 302 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:53:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-12-13 16:53:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1447. [2022-12-13 16:53:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1177 states have (on average 1.3271028037383177) internal successors, (1562), 1194 states have internal predecessors, (1562), 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 16:53:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1921 transitions. [2022-12-13 16:53:36,474 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1921 transitions. Word has length 56 [2022-12-13 16:53:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:36,474 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 1921 transitions. [2022-12-13 16:53:36,474 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 16:53:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1921 transitions. [2022-12-13 16:53:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 16:53:36,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:36,475 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 16:53:36,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:53:36,475 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 16:53:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1034084368, now seen corresponding path program 1 times [2022-12-13 16:53:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:36,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431476982] [2022-12-13 16:53:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:36,514 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 16:53:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:36,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431476982] [2022-12-13 16:53:36,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431476982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:36,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:36,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:53:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740069341] [2022-12-13 16:53:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:36,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:53:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:53:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:53:36,515 INFO L87 Difference]: Start difference. First operand 1447 states and 1921 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 16:53:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:36,897 INFO L93 Difference]: Finished difference Result 4136 states and 5521 transitions. [2022-12-13 16:53:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:53:36,898 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 16:53:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:36,904 INFO L225 Difference]: With dead ends: 4136 [2022-12-13 16:53:36,904 INFO L226 Difference]: Without dead ends: 2703 [2022-12-13 16:53:36,906 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 16:53:36,907 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 320 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 350 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 16:53:36,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 350 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:53:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-12-13 16:53:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2357. [2022-12-13 16:53:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1913 states have (on average 1.311552535284893) internal successors, (2509), 1940 states have internal predecessors, (2509), 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 16:53:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3097 transitions. [2022-12-13 16:53:37,037 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3097 transitions. Word has length 57 [2022-12-13 16:53:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:37,037 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3097 transitions. [2022-12-13 16:53:37,038 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 16:53:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3097 transitions. [2022-12-13 16:53:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 16:53:37,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:37,039 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 16:53:37,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:53:37,040 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 16:53:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -286197174, now seen corresponding path program 1 times [2022-12-13 16:53:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134394697] [2022-12-13 16:53:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:53:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:37,109 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 16:53:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134394697] [2022-12-13 16:53:37,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134394697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:37,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:37,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:53:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590142091] [2022-12-13 16:53:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:37,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:53:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:37,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:53:37,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:53:37,112 INFO L87 Difference]: Start difference. First operand 2357 states and 3097 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 16:53:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:37,839 INFO L93 Difference]: Finished difference Result 7472 states and 9914 transitions. [2022-12-13 16:53:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:53:37,840 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 16:53:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:37,854 INFO L225 Difference]: With dead ends: 7472 [2022-12-13 16:53:37,854 INFO L226 Difference]: Without dead ends: 5131 [2022-12-13 16:53:37,859 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 16:53:37,859 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 703 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:37,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 486 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-12-13 16:53:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4605. [2022-12-13 16:53:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3722 states have (on average 1.2888232133261688) internal successors, (4797), 3791 states have internal predecessors, (4797), 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 16:53:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6071 transitions. [2022-12-13 16:53:38,196 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6071 transitions. Word has length 74 [2022-12-13 16:53:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:38,196 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6071 transitions. [2022-12-13 16:53:38,196 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 16:53:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6071 transitions. [2022-12-13 16:53:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 16:53:38,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:38,198 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 16:53:38,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:53:38,198 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 16:53:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1327486831, now seen corresponding path program 1 times [2022-12-13 16:53:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:38,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883277254] [2022-12-13 16:53:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:53:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:53:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:53:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:38,332 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 16:53:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883277254] [2022-12-13 16:53:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883277254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:38,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:38,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625852823] [2022-12-13 16:53:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:38,334 INFO L87 Difference]: Start difference. First operand 4605 states and 6071 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 16:53:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:38,962 INFO L93 Difference]: Finished difference Result 8872 states and 11640 transitions. [2022-12-13 16:53:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:53:38,963 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 16:53:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:38,977 INFO L225 Difference]: With dead ends: 8872 [2022-12-13 16:53:38,977 INFO L226 Difference]: Without dead ends: 5201 [2022-12-13 16:53:38,983 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 16:53:38,983 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 519 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:38,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 311 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:53:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-12-13 16:53:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4573. [2022-12-13 16:53:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3686 states have (on average 1.2769940314704287) internal successors, (4707), 3759 states have internal predecessors, (4707), 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 16:53:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5900 transitions. [2022-12-13 16:53:39,251 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5900 transitions. Word has length 90 [2022-12-13 16:53:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:39,252 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5900 transitions. [2022-12-13 16:53:39,252 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 16:53:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5900 transitions. [2022-12-13 16:53:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 16:53:39,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:39,254 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 16:53:39,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:53:39,254 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 16:53:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1400722515, now seen corresponding path program 1 times [2022-12-13 16:53:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:39,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588243837] [2022-12-13 16:53:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:53:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:53:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:53:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,312 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 16:53:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:39,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588243837] [2022-12-13 16:53:39,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588243837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:39,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:39,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:53:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944530614] [2022-12-13 16:53:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:53:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:53:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:53:39,314 INFO L87 Difference]: Start difference. First operand 4573 states and 5900 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 16:53:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:39,682 INFO L93 Difference]: Finished difference Result 5037 states and 6517 transitions. [2022-12-13 16:53:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:53:39,683 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 16:53:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:39,691 INFO L225 Difference]: With dead ends: 5037 [2022-12-13 16:53:39,692 INFO L226 Difference]: Without dead ends: 4141 [2022-12-13 16:53:39,694 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 16:53:39,694 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 211 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 16:53:39,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 211 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:53:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-12-13 16:53:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3679. [2022-12-13 16:53:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.281965006729475) internal successors, (3810), 3033 states have internal predecessors, (3810), 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 16:53:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4762 transitions. [2022-12-13 16:53:39,933 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4762 transitions. Word has length 90 [2022-12-13 16:53:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:39,933 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4762 transitions. [2022-12-13 16:53:39,934 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 16:53:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4762 transitions. [2022-12-13 16:53:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 16:53:39,935 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:39,935 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 16:53:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:53:39,935 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 16:53:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1500452604, now seen corresponding path program 1 times [2022-12-13 16:53:39,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:39,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252383069] [2022-12-13 16:53:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:53:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:53:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:53:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:40,009 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 16:53:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:40,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252383069] [2022-12-13 16:53:40,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252383069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:40,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:40,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:53:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201936744] [2022-12-13 16:53:40,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:40,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:53:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:53:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:53:40,011 INFO L87 Difference]: Start difference. First operand 3679 states and 4762 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 16:53:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:40,700 INFO L93 Difference]: Finished difference Result 7051 states and 9090 transitions. [2022-12-13 16:53:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 16:53:40,701 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 16:53:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:40,712 INFO L225 Difference]: With dead ends: 7051 [2022-12-13 16:53:40,712 INFO L226 Difference]: Without dead ends: 4058 [2022-12-13 16:53:40,720 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 16:53:40,720 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1025 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 565 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:53:40,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 565 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:53:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-12-13 16:53:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3679. [2022-12-13 16:53:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.2671601615074024) internal successors, (3766), 3033 states have internal predecessors, (3766), 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 16:53:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4652 transitions. [2022-12-13 16:53:41,035 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4652 transitions. Word has length 91 [2022-12-13 16:53:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:41,035 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4652 transitions. [2022-12-13 16:53:41,036 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 16:53:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4652 transitions. [2022-12-13 16:53:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 16:53:41,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:41,038 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 16:53:41,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:53:41,038 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 16:53:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -78861023, now seen corresponding path program 1 times [2022-12-13 16:53:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:41,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114286869] [2022-12-13 16:53:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:53:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:53:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:53:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:53:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:53:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:53:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:53:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:53:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:53:41,106 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 16:53:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:53:41,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114286869] [2022-12-13 16:53:41,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114286869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:53:41,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:53:41,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:53:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894349966] [2022-12-13 16:53:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:53:41,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:53:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:53:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:53:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:53:41,107 INFO L87 Difference]: Start difference. First operand 3679 states and 4652 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 16:53:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:53:41,519 INFO L93 Difference]: Finished difference Result 4141 states and 5269 transitions. [2022-12-13 16:53:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:53:41,519 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 16:53:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:53:41,528 INFO L225 Difference]: With dead ends: 4141 [2022-12-13 16:53:41,528 INFO L226 Difference]: Without dead ends: 4140 [2022-12-13 16:53:41,530 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 16:53:41,530 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 260 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 199 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 16:53:41,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 199 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:53:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-12-13 16:53:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3678. [2022-12-13 16:53:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 2972 states have (on average 1.2631224764468372) internal successors, (3754), 3032 states have internal predecessors, (3754), 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 16:53:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4640 transitions. [2022-12-13 16:53:41,796 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4640 transitions. Word has length 97 [2022-12-13 16:53:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:53:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 3678 states and 4640 transitions. [2022-12-13 16:53:41,796 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 16:53:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4640 transitions. [2022-12-13 16:53:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 16:53:41,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:53:41,797 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 16:53:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 16:53:41,797 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 16:53:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:53:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1850275866, now seen corresponding path program 1 times [2022-12-13 16:53:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:53:41,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126231086] [2022-12-13 16:53:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:53:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:53:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:53:41,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:53:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:53:41,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:53:41,836 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:53:41,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-13 16:53:41,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-13 16:53:41,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-13 16:53:41,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-13 16:53:41,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 16:53:41,842 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 16:53:41,846 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:53:41,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:53:41 BoogieIcfgContainer [2022-12-13 16:53:41,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:53:41,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:53:41,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:53:41,894 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:53:41,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:53:28" (3/4) ... [2022-12-13 16:53:41,896 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:53:41,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:53:41,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:53:41,947 INFO L158 Benchmark]: Toolchain (without parser) took 13875.57ms. Allocated memory was 140.5MB in the beginning and 482.3MB in the end (delta: 341.8MB). Free memory was 101.2MB in the beginning and 210.3MB in the end (delta: -109.1MB). Peak memory consumption was 234.7MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,947 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:53:41,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.92ms. Allocated memory is still 140.5MB. Free memory was 101.1MB in the beginning and 88.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.94ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:53:41,947 INFO L158 Benchmark]: Boogie Preprocessor took 19.90ms. Allocated memory is still 140.5MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,948 INFO L158 Benchmark]: RCFGBuilder took 378.64ms. Allocated memory is still 140.5MB. Free memory was 84.6MB in the beginning and 67.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,948 INFO L158 Benchmark]: TraceAbstraction took 13187.18ms. Allocated memory was 140.5MB in the beginning and 482.3MB in the end (delta: 341.8MB). Free memory was 66.7MB in the beginning and 217.7MB in the end (delta: -151.0MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,948 INFO L158 Benchmark]: Witness Printer took 52.11ms. Allocated memory is still 482.3MB. Free memory was 217.7MB in the beginning and 210.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 16:53:41,949 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.18ms. Allocated memory is still 140.5MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.92ms. Allocated memory is still 140.5MB. Free memory was 101.1MB in the beginning and 88.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.94ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.90ms. Allocated memory is still 140.5MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.64ms. Allocated memory is still 140.5MB. Free memory was 84.6MB in the beginning and 67.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13187.18ms. Allocated memory was 140.5MB in the beginning and 482.3MB in the end (delta: 341.8MB). Free memory was 66.7MB in the beginning and 217.7MB in the end (delta: -151.0MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. * Witness Printer took 52.11ms. Allocated memory is still 482.3MB. Free memory was 217.7MB in the beginning and 210.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: 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] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] 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] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] 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] [L421] 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] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] 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] [L175] COND TRUE t1_i == 1 [L176] 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] [L422] RET init_threads() [L423] 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] [L259] 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] [L264] 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] [L269] 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] [L274] 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] [L423] 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] [L424] 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] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] 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] [L124] 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] [L134] __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] [L136] 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] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] 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] [L325] CALL, EXPR is_transmit1_triggered() [L140] 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] [L143] 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] [L153] __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] [L155] 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] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] 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] [L424] 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] [L425] 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] [L287] 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] [L292] 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] [L297] 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] [L302] 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] [L425] 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] [L428] 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] [L431] kernel_st = 1 [L432] CALL eval() [L206] 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] [L210] 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] [L213] 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] [L185] 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] [L188] COND TRUE m_st == 0 [L189] __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] [L201] 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] [L213] 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] [L213] tmp = exists_runnable_thread() [L215] 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] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] 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] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] 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] [L99] 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] [L101] t1_pc = 1 [L102] 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] [L240] RET transmit1() [L210] 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] [L213] 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] [L185] 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] [L188] COND TRUE m_st == 0 [L189] __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] [L201] 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] [L213] 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] [L213] tmp = exists_runnable_thread() [L215] 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] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [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, 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, 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, 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] [L341] 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] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] 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] [L124] 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] [L134] __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] [L136] 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] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] 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] [L325] CALL, EXPR is_transmit1_triggered() [L140] 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] [L143] 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] [L144] COND TRUE E_1 == 1 [L145] __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] [L155] 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] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] 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] [L341] 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, 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, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] 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] [L91] 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] [L107] 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: 107]: 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 7 procedures, 113 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6841 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6674 mSDsluCounter, 7730 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5561 mSDsCounter, 1361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7932 IncrementalHoareTripleChecker+Invalid, 9293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1361 mSolverCounterUnsat, 2169 mSDtfsCounter, 7932 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=4605occurred 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: 2.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 4613 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s 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 16:53:41,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bafaf692-f370-46b6-98ad-26b5aa566c08/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)