./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- 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-8393723 [2022-11-18 20:42:23,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:42:23,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:42:23,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:42:23,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:42:23,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:42:23,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:42:23,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:42:23,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:42:23,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:42:23,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:42:23,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:42:23,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:42:23,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:42:23,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:42:23,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:42:23,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:42:23,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:42:23,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:42:23,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:42:23,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:42:23,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:42:23,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:42:23,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:42:23,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:42:23,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:42:23,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:42:23,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:42:23,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:42:23,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:42:23,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:42:23,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:42:23,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:42:23,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:42:23,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:42:23,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:42:23,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:42:23,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:42:23,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:42:23,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:42:23,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:42:23,991 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:42:24,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:42:24,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:42:24,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:42:24,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:42:24,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:42:24,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:42:24,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:42:24,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:42:24,033 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:42:24,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:42:24,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:42:24,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:42:24,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:42:24,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:42:24,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:42:24,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:42:24,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:42:24,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:42:24,037 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:42:24,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:42:24,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:42:24,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:42:24,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:42:24,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:42:24,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:42:24,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:42:24,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:42:24,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:42:24,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:42:24,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:42:24,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:42:24,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:42:24,041 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:42:24,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:42:24,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:42:24,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/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_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-11-18 20:42:24,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:42:24,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:42:24,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:42:24,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:42:24,331 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:42:24,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-18 20:42:24,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/data/a865b57cc/619557b59cf243c58883bf0a7f037394/FLAG280a8b05f [2022-11-18 20:42:24,859 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:42:24,860 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-18 20:42:24,869 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/data/a865b57cc/619557b59cf243c58883bf0a7f037394/FLAG280a8b05f [2022-11-18 20:42:25,253 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/data/a865b57cc/619557b59cf243c58883bf0a7f037394 [2022-11-18 20:42:25,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:42:25,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:42:25,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:42:25,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:42:25,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:42:25,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689951db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25, skipping insertion in model container [2022-11-18 20:42:25,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:42:25,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:42:25,528 WARN L234 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_f65499ab-1174-4eac-aa8a-cf45dad64aa7/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-18 20:42:25,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:42:25,585 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:42:25,596 WARN L234 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_f65499ab-1174-4eac-aa8a-cf45dad64aa7/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-18 20:42:25,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:42:25,654 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:42:25,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25 WrapperNode [2022-11-18 20:42:25,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:42:25,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:42:25,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:42:25,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:42:25,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,698 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-11-18 20:42:25,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:42:25,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:42:25,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:42:25,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:42:25,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:42:25,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:42:25,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:42:25,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:42:25,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (1/1) ... [2022-11-18 20:42:25,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:42:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:25,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:42:25,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:42:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:42:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-18 20:42:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-18 20:42:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-18 20:42:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-18 20:42:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-18 20:42:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-18 20:42:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-18 20:42:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-18 20:42:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-18 20:42:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-18 20:42:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:42:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-18 20:42:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-18 20:42:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:42:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:42:25,944 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:42:25,946 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:42:26,414 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:42:26,427 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:42:26,434 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:42:26,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:42:26 BoogieIcfgContainer [2022-11-18 20:42:26,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:42:26,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:42:26,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:42:26,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:42:26,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:42:25" (1/3) ... [2022-11-18 20:42:26,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceadd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:42:26, skipping insertion in model container [2022-11-18 20:42:26,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:25" (2/3) ... [2022-11-18 20:42:26,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceadd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:42:26, skipping insertion in model container [2022-11-18 20:42:26,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:42:26" (3/3) ... [2022-11-18 20:42:26,452 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-11-18 20:42:26,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:42:26,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-18 20:42:26,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:42:26,556 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;@7428a20f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:42:26,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-18 20:42:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 103 states have internal predecessors, (141), 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-11-18 20:42:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:42:26,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:26,571 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] [2022-11-18 20:42:26,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1283588667, now seen corresponding path program 1 times [2022-11-18 20:42:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533819235] [2022-11-18 20:42:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:42:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:42:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:27,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533819235] [2022-11-18 20:42:27,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533819235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:27,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:27,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:42:27,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641753479] [2022-11-18 20:42:27,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:27,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:27,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:27,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:27,086 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 103 states have internal predecessors, (141), 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 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:27,542 INFO L93 Difference]: Finished difference Result 359 states and 511 transitions. [2022-11-18 20:42:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:42:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 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 48 [2022-11-18 20:42:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:27,566 INFO L225 Difference]: With dead ends: 359 [2022-11-18 20:42:27,566 INFO L226 Difference]: Without dead ends: 231 [2022-11-18 20:42:27,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:27,584 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 321 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:27,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 732 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:42:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-18 20:42:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2022-11-18 20:42:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.4331210191082802) internal successors, (225), 165 states have internal predecessors, (225), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-18 20:42:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2022-11-18 20:42:27,687 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2022-11-18 20:42:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:27,687 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2022-11-18 20:42:27,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2022-11-18 20:42:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:42:27,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:27,693 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] [2022-11-18 20:42:27,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:42:27,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1434820870, now seen corresponding path program 1 times [2022-11-18 20:42:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480459015] [2022-11-18 20:42:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:42:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:42:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:27,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480459015] [2022-11-18 20:42:27,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480459015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:27,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:27,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:42:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180756279] [2022-11-18 20:42:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:27,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:42:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:42:27,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:27,984 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:28,248 INFO L93 Difference]: Finished difference Result 411 states and 568 transitions. [2022-11-18 20:42:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:42:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 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 48 [2022-11-18 20:42:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:28,252 INFO L225 Difference]: With dead ends: 411 [2022-11-18 20:42:28,252 INFO L226 Difference]: Without dead ends: 226 [2022-11-18 20:42:28,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:42:28,265 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 116 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 678 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-18 20:42:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2022-11-18 20:42:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.41875) internal successors, (227), 168 states have internal predecessors, (227), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-18 20:42:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2022-11-18 20:42:28,298 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2022-11-18 20:42:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:28,298 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2022-11-18 20:42:28,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2022-11-18 20:42:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:42:28,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:28,300 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] [2022-11-18 20:42:28,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:42:28,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1473943032, now seen corresponding path program 1 times [2022-11-18 20:42:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:28,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536558490] [2022-11-18 20:42:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:42:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:42:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:28,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536558490] [2022-11-18 20:42:28,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536558490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:28,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:28,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:42:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024355024] [2022-11-18 20:42:28,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:28,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:42:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:42:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:28,462 INFO L87 Difference]: Start difference. First operand 198 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:29,058 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2022-11-18 20:42:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:42:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 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 48 [2022-11-18 20:42:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:29,067 INFO L225 Difference]: With dead ends: 784 [2022-11-18 20:42:29,067 INFO L226 Difference]: Without dead ends: 596 [2022-11-18 20:42:29,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:42:29,076 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 515 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:29,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 805 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:42:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-18 20:42:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2022-11-18 20:42:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.3944636678200693) internal successors, (403), 297 states have internal predecessors, (403), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-11-18 20:42:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2022-11-18 20:42:29,162 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2022-11-18 20:42:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:29,163 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2022-11-18 20:42:29,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2022-11-18 20:42:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:42:29,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:29,170 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] [2022-11-18 20:42:29,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:42:29,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash -24370336, now seen corresponding path program 1 times [2022-11-18 20:42:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:29,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196882833] [2022-11-18 20:42:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:29,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196882833] [2022-11-18 20:42:29,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196882833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:29,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:29,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:42:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120115772] [2022-11-18 20:42:29,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:29,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:29,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:29,269 INFO L87 Difference]: Start difference. First operand 353 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:29,683 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2022-11-18 20:42:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 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 50 [2022-11-18 20:42:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:29,689 INFO L225 Difference]: With dead ends: 1262 [2022-11-18 20:42:29,689 INFO L226 Difference]: Without dead ends: 919 [2022-11-18 20:42:29,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:29,692 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 308 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:29,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 789 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:42:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-11-18 20:42:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2022-11-18 20:42:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 640 states have (on average 1.334375) internal successors, (854), 648 states have internal predecessors, (854), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-18 20:42:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2022-11-18 20:42:29,792 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2022-11-18 20:42:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:29,793 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2022-11-18 20:42:29,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2022-11-18 20:42:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:42:29,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:29,794 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] [2022-11-18 20:42:29,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:42:29,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash -332809345, now seen corresponding path program 1 times [2022-11-18 20:42:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:29,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936494020] [2022-11-18 20:42:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:29,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:29,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936494020] [2022-11-18 20:42:29,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936494020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:29,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:29,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:42:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853810450] [2022-11-18 20:42:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:29,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:42:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:42:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:29,913 INFO L87 Difference]: Start difference. First operand 782 states and 1036 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:30,235 INFO L93 Difference]: Finished difference Result 1635 states and 2234 transitions. [2022-11-18 20:42:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:42:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 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 50 [2022-11-18 20:42:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:30,242 INFO L225 Difference]: With dead ends: 1635 [2022-11-18 20:42:30,242 INFO L226 Difference]: Without dead ends: 863 [2022-11-18 20:42:30,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:42:30,247 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:30,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 619 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-18 20:42:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 800. [2022-11-18 20:42:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 658 states have (on average 1.3191489361702127) internal successors, (868), 666 states have internal predecessors, (868), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-18 20:42:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2022-11-18 20:42:30,364 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2022-11-18 20:42:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:30,365 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2022-11-18 20:42:30,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2022-11-18 20:42:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:42:30,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:30,367 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] [2022-11-18 20:42:30,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:42:30,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:30,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash -466822851, now seen corresponding path program 1 times [2022-11-18 20:42:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:30,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989020787] [2022-11-18 20:42:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:30,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989020787] [2022-11-18 20:42:30,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989020787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:30,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:30,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:42:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137933360] [2022-11-18 20:42:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:30,516 INFO L87 Difference]: Start difference. First operand 800 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:30,855 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2022-11-18 20:42:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 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 50 [2022-11-18 20:42:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:30,864 INFO L225 Difference]: With dead ends: 2356 [2022-11-18 20:42:30,864 INFO L226 Difference]: Without dead ends: 1567 [2022-11-18 20:42:30,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:30,869 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 184 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:30,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 443 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-11-18 20:42:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2022-11-18 20:42:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1259 states have (on average 1.289118347895155) internal successors, (1623), 1271 states have internal predecessors, (1623), 167 states have call successors, (167), 100 states have call predecessors, (167), 103 states have return successors, (233), 167 states have call predecessors, (233), 167 states have call successors, (233) [2022-11-18 20:42:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2022-11-18 20:42:31,089 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2022-11-18 20:42:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:31,090 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2022-11-18 20:42:31,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2022-11-18 20:42:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:42:31,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:31,095 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] [2022-11-18 20:42:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:42:31,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1537614413, now seen corresponding path program 1 times [2022-11-18 20:42:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:31,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367916317] [2022-11-18 20:42:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367916317] [2022-11-18 20:42:31,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367916317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:31,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:31,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:42:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898274971] [2022-11-18 20:42:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:31,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:42:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:42:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:42:31,218 INFO L87 Difference]: Start difference. First operand 1537 states and 2023 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:31,615 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2022-11-18 20:42:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:42:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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 51 [2022-11-18 20:42:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:31,630 INFO L225 Difference]: With dead ends: 4093 [2022-11-18 20:42:31,630 INFO L226 Difference]: Without dead ends: 2700 [2022-11-18 20:42:31,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:31,638 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 180 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:31,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 369 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-11-18 20:42:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2022-11-18 20:42:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2131 states have (on average 1.278742374472079) internal successors, (2725), 2146 states have internal predecessors, (2725), 279 states have call successors, (279), 170 states have call predecessors, (279), 176 states have return successors, (398), 279 states have call predecessors, (398), 279 states have call successors, (398) [2022-11-18 20:42:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2022-11-18 20:42:31,877 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2022-11-18 20:42:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:31,878 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2022-11-18 20:42:31,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2022-11-18 20:42:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:42:31,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:31,879 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] [2022-11-18 20:42:31,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:42:31,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash -663779837, now seen corresponding path program 1 times [2022-11-18 20:42:31,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:31,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134400264] [2022-11-18 20:42:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:31,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134400264] [2022-11-18 20:42:31,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134400264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:31,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:31,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:42:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297927935] [2022-11-18 20:42:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:31,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:42:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:42:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:42:31,991 INFO L87 Difference]: Start difference. First operand 2594 states and 3402 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:32,335 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2022-11-18 20:42:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:42:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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 51 [2022-11-18 20:42:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:32,351 INFO L225 Difference]: With dead ends: 3062 [2022-11-18 20:42:32,351 INFO L226 Difference]: Without dead ends: 3058 [2022-11-18 20:42:32,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:32,353 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 170 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:32,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 376 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2022-11-18 20:42:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2022-11-18 20:42:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2423 states have (on average 1.2736277342137845) internal successors, (3086), 2439 states have internal predecessors, (3086), 311 states have call successors, (311), 190 states have call predecessors, (311), 197 states have return successors, (442), 311 states have call predecessors, (442), 311 states have call successors, (442) [2022-11-18 20:42:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2022-11-18 20:42:32,657 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2022-11-18 20:42:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:32,657 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2022-11-18 20:42:32,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2022-11-18 20:42:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:42:32,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:32,659 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, 1, 1] [2022-11-18 20:42:32,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:42:32,659 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -472171120, now seen corresponding path program 1 times [2022-11-18 20:42:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:32,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474209536] [2022-11-18 20:42:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:32,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474209536] [2022-11-18 20:42:32,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474209536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:32,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:32,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:42:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264514085] [2022-11-18 20:42:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:32,771 INFO L87 Difference]: Start difference. First operand 2939 states and 3839 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:33,281 INFO L93 Difference]: Finished difference Result 4382 states and 5803 transitions. [2022-11-18 20:42:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 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 59 [2022-11-18 20:42:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:33,308 INFO L225 Difference]: With dead ends: 4382 [2022-11-18 20:42:33,309 INFO L226 Difference]: Without dead ends: 4380 [2022-11-18 20:42:33,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:33,314 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 424 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:33,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 470 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:42:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2022-11-18 20:42:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4203. [2022-11-18 20:42:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4203 states, 3475 states have (on average 1.2716546762589929) internal successors, (4419), 3495 states have internal predecessors, (4419), 439 states have call successors, (439), 270 states have call predecessors, (439), 281 states have return successors, (632), 439 states have call predecessors, (632), 439 states have call successors, (632) [2022-11-18 20:42:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 5490 transitions. [2022-11-18 20:42:33,730 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 5490 transitions. Word has length 59 [2022-11-18 20:42:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:33,730 INFO L495 AbstractCegarLoop]: Abstraction has 4203 states and 5490 transitions. [2022-11-18 20:42:33,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 5490 transitions. [2022-11-18 20:42:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 20:42:33,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:33,732 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, 1, 1, 1] [2022-11-18 20:42:33,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:42:33,732 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1752402570, now seen corresponding path program 1 times [2022-11-18 20:42:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:33,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511408087] [2022-11-18 20:42:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:42:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511408087] [2022-11-18 20:42:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511408087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:33,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:33,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:42:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10662616] [2022-11-18 20:42:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:33,807 INFO L87 Difference]: Start difference. First operand 4203 states and 5490 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:34,498 INFO L93 Difference]: Finished difference Result 7863 states and 10400 transitions. [2022-11-18 20:42:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 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 60 [2022-11-18 20:42:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:34,524 INFO L225 Difference]: With dead ends: 7863 [2022-11-18 20:42:34,524 INFO L226 Difference]: Without dead ends: 5045 [2022-11-18 20:42:34,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:34,534 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 304 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:34,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 630 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:42:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2022-11-18 20:42:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4828. [2022-11-18 20:42:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 3994 states have (on average 1.2674011016524787) internal successors, (5062), 4016 states have internal predecessors, (5062), 503 states have call successors, (503), 310 states have call predecessors, (503), 323 states have return successors, (720), 503 states have call predecessors, (720), 503 states have call successors, (720) [2022-11-18 20:42:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6285 transitions. [2022-11-18 20:42:34,972 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6285 transitions. Word has length 60 [2022-11-18 20:42:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:34,973 INFO L495 AbstractCegarLoop]: Abstraction has 4828 states and 6285 transitions. [2022-11-18 20:42:34,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:42:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6285 transitions. [2022-11-18 20:42:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:42:34,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:34,975 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:42:34,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:42:34,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2044119821, now seen corresponding path program 1 times [2022-11-18 20:42:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:34,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163064469] [2022-11-18 20:42:34,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:42:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:42:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:35,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163064469] [2022-11-18 20:42:35,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163064469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:35,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:35,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:42:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814522996] [2022-11-18 20:42:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:35,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:35,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:35,072 INFO L87 Difference]: Start difference. First operand 4828 states and 6285 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:42:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:36,121 INFO L93 Difference]: Finished difference Result 13334 states and 17742 transitions. [2022-11-18 20:42:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:42:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 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 70 [2022-11-18 20:42:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:36,175 INFO L225 Difference]: With dead ends: 13334 [2022-11-18 20:42:36,175 INFO L226 Difference]: Without dead ends: 8522 [2022-11-18 20:42:36,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:36,192 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 455 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:36,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 632 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:42:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2022-11-18 20:42:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 8240. [2022-11-18 20:42:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 6728 states have (on average 1.2433115338882283) internal successors, (8365), 6800 states have internal predecessors, (8365), 893 states have call successors, (893), 550 states have call predecessors, (893), 611 states have return successors, (1678), 893 states have call predecessors, (1678), 893 states have call successors, (1678) [2022-11-18 20:42:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 10936 transitions. [2022-11-18 20:42:37,296 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 10936 transitions. Word has length 70 [2022-11-18 20:42:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 8240 states and 10936 transitions. [2022-11-18 20:42:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:42:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 10936 transitions. [2022-11-18 20:42:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-18 20:42:37,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:37,300 INFO L195 NwaCegarLoop]: trace histogram [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-11-18 20:42:37,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:42:37,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1887373238, now seen corresponding path program 1 times [2022-11-18 20:42:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:37,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359344617] [2022-11-18 20:42:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:42:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:42:37,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359344617] [2022-11-18 20:42:37,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359344617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:37,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:37,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:42:37,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769841826] [2022-11-18 20:42:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:37,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:42:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:37,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:42:37,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:37,396 INFO L87 Difference]: Start difference. First operand 8240 states and 10936 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:42:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:38,436 INFO L93 Difference]: Finished difference Result 16595 states and 22008 transitions. [2022-11-18 20:42:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:42:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 81 [2022-11-18 20:42:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:38,477 INFO L225 Difference]: With dead ends: 16595 [2022-11-18 20:42:38,477 INFO L226 Difference]: Without dead ends: 7948 [2022-11-18 20:42:38,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:42:38,501 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 678 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:38,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 855 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:42:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2022-11-18 20:42:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 7720. [2022-11-18 20:42:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7720 states, 6302 states have (on average 1.228340209457315) internal successors, (7741), 6373 states have internal predecessors, (7741), 834 states have call successors, (834), 515 states have call predecessors, (834), 576 states have return successors, (1435), 834 states have call predecessors, (1435), 834 states have call successors, (1435) [2022-11-18 20:42:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 10010 transitions. [2022-11-18 20:42:39,258 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 10010 transitions. Word has length 81 [2022-11-18 20:42:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:39,259 INFO L495 AbstractCegarLoop]: Abstraction has 7720 states and 10010 transitions. [2022-11-18 20:42:39,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:42:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 10010 transitions. [2022-11-18 20:42:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-18 20:42:39,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:39,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:39,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:42:39,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 398620961, now seen corresponding path program 1 times [2022-11-18 20:42:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:39,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745804283] [2022-11-18 20:42:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:42:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:42:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:42:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:42:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:42:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-18 20:42:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:42:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 20:42:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745804283] [2022-11-18 20:42:39,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745804283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056385671] [2022-11-18 20:42:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:39,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:39,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:42:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:39,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:39,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:42:39,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056385671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:39,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:39,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-18 20:42:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998273441] [2022-11-18 20:42:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:39,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:39,815 INFO L87 Difference]: Start difference. First operand 7720 states and 10010 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:40,534 INFO L93 Difference]: Finished difference Result 12037 states and 15722 transitions. [2022-11-18 20:42:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2022-11-18 20:42:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:40,556 INFO L225 Difference]: With dead ends: 12037 [2022-11-18 20:42:40,556 INFO L226 Difference]: Without dead ends: 5588 [2022-11-18 20:42:40,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:40,574 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:40,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2022-11-18 20:42:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5588. [2022-11-18 20:42:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 4556 states have (on average 1.21729587357331) internal successors, (5546), 4605 states have internal predecessors, (5546), 610 states have call successors, (610), 375 states have call predecessors, (610), 414 states have return successors, (977), 610 states have call predecessors, (977), 610 states have call successors, (977) [2022-11-18 20:42:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 7133 transitions. [2022-11-18 20:42:41,103 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 7133 transitions. Word has length 127 [2022-11-18 20:42:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:41,103 INFO L495 AbstractCegarLoop]: Abstraction has 5588 states and 7133 transitions. [2022-11-18 20:42:41,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 7133 transitions. [2022-11-18 20:42:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-18 20:42:41,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:41,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:41,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:41,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:42:41,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1617965029, now seen corresponding path program 1 times [2022-11-18 20:42:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:41,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57980610] [2022-11-18 20:42:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:42:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:42:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:42:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:42:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:42:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:42:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 20:42:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:41,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57980610] [2022-11-18 20:42:41,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57980610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:41,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549855246] [2022-11-18 20:42:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:41,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:41,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:41,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:41,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:42:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:41,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:41,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-18 20:42:41,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:41,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549855246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:41,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:41,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-18 20:42:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443841283] [2022-11-18 20:42:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:41,771 INFO L87 Difference]: Start difference. First operand 5588 states and 7133 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:42,327 INFO L93 Difference]: Finished difference Result 12744 states and 16168 transitions. [2022-11-18 20:42:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-11-18 20:42:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:42,359 INFO L225 Difference]: With dead ends: 12744 [2022-11-18 20:42:42,359 INFO L226 Difference]: Without dead ends: 8427 [2022-11-18 20:42:42,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:42,373 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 64 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:42,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 290 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2022-11-18 20:42:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 8424. [2022-11-18 20:42:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8424 states, 6842 states have (on average 1.1961414790996785) internal successors, (8184), 6901 states have internal predecessors, (8184), 925 states have call successors, (925), 600 states have call predecessors, (925), 649 states have return successors, (1342), 925 states have call predecessors, (1342), 925 states have call successors, (1342) [2022-11-18 20:42:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 10451 transitions. [2022-11-18 20:42:43,411 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 10451 transitions. Word has length 130 [2022-11-18 20:42:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:43,412 INFO L495 AbstractCegarLoop]: Abstraction has 8424 states and 10451 transitions. [2022-11-18 20:42:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 10451 transitions. [2022-11-18 20:42:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-18 20:42:43,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:43,421 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:43,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:42:43,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -593042927, now seen corresponding path program 1 times [2022-11-18 20:42:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:43,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865689131] [2022-11-18 20:42:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:42:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:42:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:42:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:42:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:42:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-18 20:42:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:42:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 20:42:43,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865689131] [2022-11-18 20:42:43,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865689131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123090986] [2022-11-18 20:42:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:43,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:43,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:43,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:42:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:43,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:43,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 20:42:44,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:44,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123090986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:44,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:44,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-18 20:42:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255020723] [2022-11-18 20:42:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:44,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:44,106 INFO L87 Difference]: Start difference. First operand 8424 states and 10451 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:44,655 INFO L93 Difference]: Finished difference Result 13897 states and 17415 transitions. [2022-11-18 20:42:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2022-11-18 20:42:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:44,681 INFO L225 Difference]: With dead ends: 13897 [2022-11-18 20:42:44,681 INFO L226 Difference]: Without dead ends: 6509 [2022-11-18 20:42:44,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:44,701 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:44,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2022-11-18 20:42:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 6509. [2022-11-18 20:42:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 5285 states have (on average 1.203973509933775) internal successors, (6363), 5334 states have internal predecessors, (6363), 722 states have call successors, (722), 455 states have call predecessors, (722), 494 states have return successors, (1101), 722 states have call predecessors, (1101), 722 states have call successors, (1101) [2022-11-18 20:42:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8186 transitions. [2022-11-18 20:42:45,297 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8186 transitions. Word has length 140 [2022-11-18 20:42:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:45,297 INFO L495 AbstractCegarLoop]: Abstraction has 6509 states and 8186 transitions. [2022-11-18 20:42:45,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:42:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8186 transitions. [2022-11-18 20:42:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-18 20:42:45,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:45,305 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:45,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:45,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:45,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 646813658, now seen corresponding path program 1 times [2022-11-18 20:42:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:45,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958580274] [2022-11-18 20:42:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:42:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:42:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:42:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:42:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:42:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:42:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 20:42:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-18 20:42:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:45,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958580274] [2022-11-18 20:42:45,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958580274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319291647] [2022-11-18 20:42:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:45,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:45,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:45,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:45,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:42:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:45,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:45,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 20:42:45,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:45,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319291647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:45,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:45,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-18 20:42:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332696796] [2022-11-18 20:42:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:45,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:45,885 INFO L87 Difference]: Start difference. First operand 6509 states and 8186 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:42:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:46,243 INFO L93 Difference]: Finished difference Result 8732 states and 11095 transitions. [2022-11-18 20:42:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2022-11-18 20:42:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:46,257 INFO L225 Difference]: With dead ends: 8732 [2022-11-18 20:42:46,257 INFO L226 Difference]: Without dead ends: 3717 [2022-11-18 20:42:46,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:46,267 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 86 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:46,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 268 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-11-18 20:42:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3714. [2022-11-18 20:42:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3026 states have (on average 1.1953073364177131) internal successors, (3617), 3054 states have internal predecessors, (3617), 406 states have call successors, (406), 255 states have call predecessors, (406), 274 states have return successors, (537), 406 states have call predecessors, (537), 406 states have call successors, (537) [2022-11-18 20:42:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4560 transitions. [2022-11-18 20:42:46,553 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4560 transitions. Word has length 151 [2022-11-18 20:42:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:46,554 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 4560 transitions. [2022-11-18 20:42:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:42:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4560 transitions. [2022-11-18 20:42:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-18 20:42:46,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:46,561 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:46,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:46,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:46,767 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1912398517, now seen corresponding path program 1 times [2022-11-18 20:42:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:46,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006896745] [2022-11-18 20:42:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:42:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:42:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:42:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:42:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-18 20:42:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:42:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:42:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:42:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 20:42:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006896745] [2022-11-18 20:42:46,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006896745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566235884] [2022-11-18 20:42:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:46,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:46,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:42:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:47,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:42:47,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-18 20:42:47,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:47,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566235884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:47,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:47,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-18 20:42:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35387733] [2022-11-18 20:42:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:47,086 INFO L87 Difference]: Start difference. First operand 3714 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-18 20:42:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:47,729 INFO L93 Difference]: Finished difference Result 8894 states and 10980 transitions. [2022-11-18 20:42:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 163 [2022-11-18 20:42:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:47,751 INFO L225 Difference]: With dead ends: 8894 [2022-11-18 20:42:47,751 INFO L226 Difference]: Without dead ends: 5730 [2022-11-18 20:42:47,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:42:47,761 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 105 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:47,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2022-11-18 20:42:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5720. [2022-11-18 20:42:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5720 states, 4704 states have (on average 1.1802721088435375) internal successors, (5552), 4743 states have internal predecessors, (5552), 581 states have call successors, (581), 397 states have call predecessors, (581), 427 states have return successors, (796), 581 states have call predecessors, (796), 581 states have call successors, (796) [2022-11-18 20:42:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 6929 transitions. [2022-11-18 20:42:48,435 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 6929 transitions. Word has length 163 [2022-11-18 20:42:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:48,435 INFO L495 AbstractCegarLoop]: Abstraction has 5720 states and 6929 transitions. [2022-11-18 20:42:48,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-18 20:42:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 6929 transitions. [2022-11-18 20:42:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-18 20:42:48,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:48,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:48,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:48,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:42:48,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1664252023, now seen corresponding path program 1 times [2022-11-18 20:42:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:48,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923306970] [2022-11-18 20:42:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:42:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:42:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:42:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:42:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:42:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-18 20:42:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:42:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:42:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:42:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 20:42:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:48,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923306970] [2022-11-18 20:42:48,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923306970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:48,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756688796] [2022-11-18 20:42:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:48,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:48,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:42:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:48,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:42:48,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-18 20:42:49,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:49,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756688796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:49,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:49,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-11-18 20:42:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797124455] [2022-11-18 20:42:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:49,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:42:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:49,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:42:49,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:42:49,052 INFO L87 Difference]: Start difference. First operand 5720 states and 6929 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 20:42:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:49,485 INFO L93 Difference]: Finished difference Result 9242 states and 11245 transitions. [2022-11-18 20:42:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:42:49,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-11-18 20:42:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:49,499 INFO L225 Difference]: With dead ends: 9242 [2022-11-18 20:42:49,499 INFO L226 Difference]: Without dead ends: 3537 [2022-11-18 20:42:49,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:42:49,511 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 59 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:49,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 668 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-11-18 20:42:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3357. [2022-11-18 20:42:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2864 states have (on average 1.1885474860335195) internal successors, (3404), 2877 states have internal predecessors, (3404), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-11-18 20:42:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4060 transitions. [2022-11-18 20:42:49,879 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4060 transitions. Word has length 163 [2022-11-18 20:42:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4060 transitions. [2022-11-18 20:42:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 20:42:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4060 transitions. [2022-11-18 20:42:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 20:42:49,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:49,886 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:49,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:50,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:42:50,091 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1733832050, now seen corresponding path program 1 times [2022-11-18 20:42:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:50,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352811198] [2022-11-18 20:42:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:50,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:42:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:42:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:42:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:42:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:42:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:42:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:42:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:42:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:50,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352811198] [2022-11-18 20:42:50,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352811198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95324776] [2022-11-18 20:42:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:50,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:50,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:50,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:50,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:42:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:50,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:50,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-18 20:42:50,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:50,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95324776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:50,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:50,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-18 20:42:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814887983] [2022-11-18 20:42:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:50,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:50,496 INFO L87 Difference]: Start difference. First operand 3357 states and 4060 transitions. Second operand has 3 states, 2 states have (on average 59.0) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:42:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:50,852 INFO L93 Difference]: Finished difference Result 3357 states and 4060 transitions. [2022-11-18 20:42:50,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 59.0) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 169 [2022-11-18 20:42:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:50,864 INFO L225 Difference]: With dead ends: 3357 [2022-11-18 20:42:50,864 INFO L226 Difference]: Without dead ends: 3355 [2022-11-18 20:42:50,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:50,867 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:50,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-11-18 20:42:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2022-11-18 20:42:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2864 states have (on average 1.1822625698324023) internal successors, (3386), 2875 states have internal predecessors, (3386), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-11-18 20:42:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4042 transitions. [2022-11-18 20:42:51,209 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4042 transitions. Word has length 169 [2022-11-18 20:42:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:51,209 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4042 transitions. [2022-11-18 20:42:51,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.0) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:42:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4042 transitions. [2022-11-18 20:42:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 20:42:51,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:51,215 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:51,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:51,421 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1404056422, now seen corresponding path program 1 times [2022-11-18 20:42:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606314363] [2022-11-18 20:42:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:42:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:42:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:42:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:42:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:42:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:42:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:42:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:42:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:51,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606314363] [2022-11-18 20:42:51,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606314363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:51,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877658321] [2022-11-18 20:42:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:51,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:51,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:51,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:51,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:42:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:51,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:42:51,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-18 20:42:51,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:51,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877658321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:51,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:51,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-18 20:42:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850781795] [2022-11-18 20:42:51,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:51,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:42:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:42:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:51,757 INFO L87 Difference]: Start difference. First operand 3355 states and 4042 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:42:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:52,106 INFO L93 Difference]: Finished difference Result 5963 states and 7299 transitions. [2022-11-18 20:42:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:42:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 169 [2022-11-18 20:42:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:52,119 INFO L225 Difference]: With dead ends: 5963 [2022-11-18 20:42:52,119 INFO L226 Difference]: Without dead ends: 3276 [2022-11-18 20:42:52,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:52,126 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 90 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:52,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 350 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:42:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-11-18 20:42:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3275. [2022-11-18 20:42:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2784 states have (on average 1.1724137931034482) internal successors, (3264), 2795 states have internal predecessors, (3264), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-11-18 20:42:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3920 transitions. [2022-11-18 20:42:52,497 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3920 transitions. Word has length 169 [2022-11-18 20:42:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:52,498 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 3920 transitions. [2022-11-18 20:42:52,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:42:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3920 transitions. [2022-11-18 20:42:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-18 20:42:52,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:52,503 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:52,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:52,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:52,710 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1943202269, now seen corresponding path program 1 times [2022-11-18 20:42:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:52,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436447800] [2022-11-18 20:42:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:42:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:42:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:42:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:42:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:42:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:42:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:42:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 20:42:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436447800] [2022-11-18 20:42:52,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436447800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65762655] [2022-11-18 20:42:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:52,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:52,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:52,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:52,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:42:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:53,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:42:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-18 20:42:53,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:42:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 20:42:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65762655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:42:53,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:42:53,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-18 20:42:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192234607] [2022-11-18 20:42:53,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:42:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:42:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:42:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:42:53,446 INFO L87 Difference]: Start difference. First operand 3275 states and 3920 transitions. Second operand has 8 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2022-11-18 20:42:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:54,749 INFO L93 Difference]: Finished difference Result 10587 states and 12830 transitions. [2022-11-18 20:42:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:42:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 170 [2022-11-18 20:42:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:54,781 INFO L225 Difference]: With dead ends: 10587 [2022-11-18 20:42:54,781 INFO L226 Difference]: Without dead ends: 10585 [2022-11-18 20:42:54,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:42:54,788 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 672 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:54,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 647 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:42:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2022-11-18 20:42:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 8578. [2022-11-18 20:42:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8578 states, 7359 states have (on average 1.1820899578747113) internal successors, (8699), 7384 states have internal predecessors, (8699), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2022-11-18 20:42:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 10447 transitions. [2022-11-18 20:42:55,483 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 10447 transitions. Word has length 170 [2022-11-18 20:42:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:55,484 INFO L495 AbstractCegarLoop]: Abstraction has 8578 states and 10447 transitions. [2022-11-18 20:42:55,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2022-11-18 20:42:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 10447 transitions. [2022-11-18 20:42:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-18 20:42:55,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:55,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:55,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 20:42:55,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:42:55,700 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 109728449, now seen corresponding path program 1 times [2022-11-18 20:42:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:55,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506567254] [2022-11-18 20:42:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:42:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:42:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:42:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:42:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:42:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:42:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:42:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 20:42:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506567254] [2022-11-18 20:42:55,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506567254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273429948] [2022-11-18 20:42:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:55,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:55,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:55,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:55,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:42:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:56,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:42:56,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:42:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-18 20:42:56,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:42:56,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273429948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:56,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:42:56,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-18 20:42:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528713571] [2022-11-18 20:42:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:42:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:56,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:42:56,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:56,242 INFO L87 Difference]: Start difference. First operand 8578 states and 10447 transitions. Second operand has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:42:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:57,003 INFO L93 Difference]: Finished difference Result 8579 states and 10447 transitions. [2022-11-18 20:42:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:42:57,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 171 [2022-11-18 20:42:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:57,030 INFO L225 Difference]: With dead ends: 8579 [2022-11-18 20:42:57,031 INFO L226 Difference]: Without dead ends: 8575 [2022-11-18 20:42:57,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:42:57,036 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 124 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:57,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 309 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8575 states. [2022-11-18 20:42:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8575 to 8574. [2022-11-18 20:42:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8574 states, 7357 states have (on average 1.173983960853609) internal successors, (8637), 7380 states have internal predecessors, (8637), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2022-11-18 20:42:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 10385 transitions. [2022-11-18 20:42:57,748 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 10385 transitions. Word has length 171 [2022-11-18 20:42:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:57,749 INFO L495 AbstractCegarLoop]: Abstraction has 8574 states and 10385 transitions. [2022-11-18 20:42:57,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:42:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 10385 transitions. [2022-11-18 20:42:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-18 20:42:57,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:57,753 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:57,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:57,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:57,959 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:57,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1511508257, now seen corresponding path program 1 times [2022-11-18 20:42:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:57,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974687194] [2022-11-18 20:42:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:42:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:42:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:42:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:42:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:42:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:42:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:42:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:42:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-18 20:42:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974687194] [2022-11-18 20:42:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974687194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:42:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:42:58,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:42:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214808121] [2022-11-18 20:42:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:42:58,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:42:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:42:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:42:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:42:58,066 INFO L87 Difference]: Start difference. First operand 8574 states and 10385 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-18 20:42:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:58,827 INFO L93 Difference]: Finished difference Result 11115 states and 13509 transitions. [2022-11-18 20:42:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:42:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 179 [2022-11-18 20:42:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:58,854 INFO L225 Difference]: With dead ends: 11115 [2022-11-18 20:42:58,854 INFO L226 Difference]: Without dead ends: 11113 [2022-11-18 20:42:58,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:42:58,861 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 381 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:58,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 321 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:42:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-18 20:42:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 8272. [2022-11-18 20:42:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 7056 states have (on average 1.169359410430839) internal successors, (8251), 7078 states have internal predecessors, (8251), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2022-11-18 20:42:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 9999 transitions. [2022-11-18 20:42:59,638 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 9999 transitions. Word has length 179 [2022-11-18 20:42:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:59,639 INFO L495 AbstractCegarLoop]: Abstraction has 8272 states and 9999 transitions. [2022-11-18 20:42:59,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-18 20:42:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 9999 transitions. [2022-11-18 20:42:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-18 20:42:59,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:59,648 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:42:59,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:42:59,648 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:42:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:59,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1267602057, now seen corresponding path program 1 times [2022-11-18 20:42:59,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:42:59,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669560899] [2022-11-18 20:42:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:59,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:42:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:42:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:42:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:42:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:42:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:42:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 20:42:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:42:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:42:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:42:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:42:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:42:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:42:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:42:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:42:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:42:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:42:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:42:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-18 20:42:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:42:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 20:42:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-18 20:42:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-18 20:42:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-18 20:42:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:42:59,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669560899] [2022-11-18 20:42:59,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669560899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:59,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665006672] [2022-11-18 20:42:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:42:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:42:59,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:42:59,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:42:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:42:59,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:42:59,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 20:43:00,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665006672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 20:43:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880433169] [2022-11-18 20:43:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:00,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:43:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:43:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:00,056 INFO L87 Difference]: Start difference. First operand 8272 states and 9999 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-18 20:43:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:00,836 INFO L93 Difference]: Finished difference Result 21153 states and 25649 transitions. [2022-11-18 20:43:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:43:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 234 [2022-11-18 20:43:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:00,874 INFO L225 Difference]: With dead ends: 21153 [2022-11-18 20:43:00,874 INFO L226 Difference]: Without dead ends: 13251 [2022-11-18 20:43:00,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:00,892 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 65 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:00,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 365 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states. [2022-11-18 20:43:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 13136. [2022-11-18 20:43:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13136 states, 11166 states have (on average 1.1633530360021493) internal successors, (12990), 11188 states have internal predecessors, (12990), 1143 states have call successors, (1143), 715 states have call predecessors, (1143), 824 states have return successors, (1681), 1232 states have call predecessors, (1681), 1143 states have call successors, (1681) [2022-11-18 20:43:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13136 states to 13136 states and 15814 transitions. [2022-11-18 20:43:01,970 INFO L78 Accepts]: Start accepts. Automaton has 13136 states and 15814 transitions. Word has length 234 [2022-11-18 20:43:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:01,971 INFO L495 AbstractCegarLoop]: Abstraction has 13136 states and 15814 transitions. [2022-11-18 20:43:01,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-18 20:43:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states and 15814 transitions. [2022-11-18 20:43:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-18 20:43:01,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:01,984 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:01,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-18 20:43:02,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:02,189 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash 661330169, now seen corresponding path program 1 times [2022-11-18 20:43:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:02,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630738073] [2022-11-18 20:43:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 20:43:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:43:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:43:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:43:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:43:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:43:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:43:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:43:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:43:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:43:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:43:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-18 20:43:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:43:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 20:43:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-18 20:43:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-18 20:43:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-18 20:43:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:02,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630738073] [2022-11-18 20:43:02,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630738073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:02,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599623019] [2022-11-18 20:43:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:02,334 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:02,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:43:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:02,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:43:02,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-11-18 20:43:02,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:02,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599623019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:02,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:02,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 20:43:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539431631] [2022-11-18 20:43:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:02,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:43:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:43:02,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:02,505 INFO L87 Difference]: Start difference. First operand 13136 states and 15814 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-18 20:43:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:02,849 INFO L93 Difference]: Finished difference Result 18416 states and 22222 transitions. [2022-11-18 20:43:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:43:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 234 [2022-11-18 20:43:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:02,863 INFO L225 Difference]: With dead ends: 18416 [2022-11-18 20:43:02,863 INFO L226 Difference]: Without dead ends: 5596 [2022-11-18 20:43:02,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:02,880 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:02,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-11-18 20:43:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5346. [2022-11-18 20:43:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5346 states, 4507 states have (on average 1.1439982249833591) internal successors, (5156), 4525 states have internal predecessors, (5156), 466 states have call successors, (466), 317 states have call predecessors, (466), 370 states have return successors, (729), 503 states have call predecessors, (729), 466 states have call successors, (729) [2022-11-18 20:43:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 6351 transitions. [2022-11-18 20:43:03,315 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 6351 transitions. Word has length 234 [2022-11-18 20:43:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:03,316 INFO L495 AbstractCegarLoop]: Abstraction has 5346 states and 6351 transitions. [2022-11-18 20:43:03,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-18 20:43:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 6351 transitions. [2022-11-18 20:43:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-18 20:43:03,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:03,323 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:03,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:03,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:43:03,528 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -768448019, now seen corresponding path program 1 times [2022-11-18 20:43:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:03,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657022550] [2022-11-18 20:43:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 20:43:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:43:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:43:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:43:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:43:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:43:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:43:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:43:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:43:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:43:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:43:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-18 20:43:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-18 20:43:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-18 20:43:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-18 20:43:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-18 20:43:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 20:43:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-11-18 20:43:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:03,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657022550] [2022-11-18 20:43:03,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657022550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:03,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632690780] [2022-11-18 20:43:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:03,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:03,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:03,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:03,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:43:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:03,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:43:03,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 346 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-18 20:43:04,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:43:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-11-18 20:43:04,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632690780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:43:04,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:43:04,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-18 20:43:04,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608624008] [2022-11-18 20:43:04,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:43:04,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:43:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:43:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:04,270 INFO L87 Difference]: Start difference. First operand 5346 states and 6351 transitions. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2022-11-18 20:43:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:05,546 INFO L93 Difference]: Finished difference Result 13328 states and 16430 transitions. [2022-11-18 20:43:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:43:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) Word has length 257 [2022-11-18 20:43:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:05,561 INFO L225 Difference]: With dead ends: 13328 [2022-11-18 20:43:05,561 INFO L226 Difference]: Without dead ends: 8218 [2022-11-18 20:43:05,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 563 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:43:05,570 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 486 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:05,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1252 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:43:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2022-11-18 20:43:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 5323. [2022-11-18 20:43:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 4488 states have (on average 1.124554367201426) internal successors, (5047), 4514 states have internal predecessors, (5047), 459 states have call successors, (459), 312 states have call predecessors, (459), 373 states have return successors, (617), 496 states have call predecessors, (617), 459 states have call successors, (617) [2022-11-18 20:43:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 6123 transitions. [2022-11-18 20:43:06,092 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 6123 transitions. Word has length 257 [2022-11-18 20:43:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:06,093 INFO L495 AbstractCegarLoop]: Abstraction has 5323 states and 6123 transitions. [2022-11-18 20:43:06,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2022-11-18 20:43:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 6123 transitions. [2022-11-18 20:43:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-18 20:43:06,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:06,099 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:06,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:06,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 20:43:06,306 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash 234235241, now seen corresponding path program 1 times [2022-11-18 20:43:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551441853] [2022-11-18 20:43:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 20:43:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:43:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:43:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:43:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:43:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:43:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:43:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:43:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:43:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-18 20:43:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 20:43:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-18 20:43:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 20:43:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-18 20:43:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-18 20:43:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-18 20:43:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-18 20:43:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-11-18 20:43:06,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:06,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551441853] [2022-11-18 20:43:06,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551441853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:06,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:06,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:06,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146836222] [2022-11-18 20:43:06,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:06,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:06,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:06,397 INFO L87 Difference]: Start difference. First operand 5323 states and 6123 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:43:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:06,999 INFO L93 Difference]: Finished difference Result 5613 states and 6445 transitions. [2022-11-18 20:43:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:43:07,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 259 [2022-11-18 20:43:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:07,010 INFO L225 Difference]: With dead ends: 5613 [2022-11-18 20:43:07,010 INFO L226 Difference]: Without dead ends: 5330 [2022-11-18 20:43:07,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:07,013 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:07,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 205 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2022-11-18 20:43:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 5298. [2022-11-18 20:43:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 4469 states have (on average 1.1248601476840456) internal successors, (5027), 4495 states have internal predecessors, (5027), 456 states have call successors, (456), 309 states have call predecessors, (456), 370 states have return successors, (614), 493 states have call predecessors, (614), 456 states have call successors, (614) [2022-11-18 20:43:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 6097 transitions. [2022-11-18 20:43:07,407 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 6097 transitions. Word has length 259 [2022-11-18 20:43:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:07,408 INFO L495 AbstractCegarLoop]: Abstraction has 5298 states and 6097 transitions. [2022-11-18 20:43:07,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:43:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 6097 transitions. [2022-11-18 20:43:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-18 20:43:07,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:07,414 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:07,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:43:07,415 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash -351463149, now seen corresponding path program 1 times [2022-11-18 20:43:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:07,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294021692] [2022-11-18 20:43:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:43:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:43:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:43:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:43:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-18 20:43:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-18 20:43:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 20:43:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:43:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-18 20:43:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:43:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:43:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 20:43:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-18 20:43:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-18 20:43:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 20:43:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-18 20:43:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-18 20:43:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-11-18 20:43:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:07,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294021692] [2022-11-18 20:43:07,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294021692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:07,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:07,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060405035] [2022-11-18 20:43:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:07,607 INFO L87 Difference]: Start difference. First operand 5298 states and 6097 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:43:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:08,174 INFO L93 Difference]: Finished difference Result 5331 states and 6137 transitions. [2022-11-18 20:43:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 264 [2022-11-18 20:43:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:08,185 INFO L225 Difference]: With dead ends: 5331 [2022-11-18 20:43:08,186 INFO L226 Difference]: Without dead ends: 5069 [2022-11-18 20:43:08,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:08,189 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 102 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:08,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 293 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2022-11-18 20:43:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 5037. [2022-11-18 20:43:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 4246 states have (on average 1.1264719736222326) internal successors, (4783), 4272 states have internal predecessors, (4783), 435 states have call successors, (435), 294 states have call predecessors, (435), 353 states have return successors, (591), 470 states have call predecessors, (591), 435 states have call successors, (591) [2022-11-18 20:43:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 5809 transitions. [2022-11-18 20:43:08,575 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 5809 transitions. Word has length 264 [2022-11-18 20:43:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:08,575 INFO L495 AbstractCegarLoop]: Abstraction has 5037 states and 5809 transitions. [2022-11-18 20:43:08,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:43:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 5809 transitions. [2022-11-18 20:43:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-18 20:43:08,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:08,580 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:08,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-18 20:43:08,580 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:08,581 INFO L85 PathProgramCache]: Analyzing trace with hash 236893938, now seen corresponding path program 1 times [2022-11-18 20:43:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:08,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212095232] [2022-11-18 20:43:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 20:43:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-18 20:43:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-18 20:43:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:43:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-18 20:43:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-18 20:43:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-18 20:43:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-18 20:43:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-18 20:43:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-11-18 20:43:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:08,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212095232] [2022-11-18 20:43:08,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212095232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283574625] [2022-11-18 20:43:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:08,749 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:08,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:43:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:08,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:43:08,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-18 20:43:08,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283574625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:08,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-18 20:43:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490464811] [2022-11-18 20:43:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:43:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:43:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:08,997 INFO L87 Difference]: Start difference. First operand 5037 states and 5809 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:43:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:09,268 INFO L93 Difference]: Finished difference Result 8093 states and 9347 transitions. [2022-11-18 20:43:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:43:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 273 [2022-11-18 20:43:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:09,274 INFO L225 Difference]: With dead ends: 8093 [2022-11-18 20:43:09,275 INFO L226 Difference]: Without dead ends: 3263 [2022-11-18 20:43:09,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:09,280 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 55 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:09,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 344 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2022-11-18 20:43:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3096. [2022-11-18 20:43:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2673 states have (on average 1.1208380097268986) internal successors, (2996), 2675 states have internal predecessors, (2996), 229 states have call successors, (229), 156 states have call predecessors, (229), 191 states have return successors, (288), 264 states have call predecessors, (288), 229 states have call successors, (288) [2022-11-18 20:43:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3513 transitions. [2022-11-18 20:43:09,488 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3513 transitions. Word has length 273 [2022-11-18 20:43:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:09,488 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 3513 transitions. [2022-11-18 20:43:09,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:43:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3513 transitions. [2022-11-18 20:43:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-18 20:43:09,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:09,492 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:09,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:09,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:43:09,692 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash 58141560, now seen corresponding path program 1 times [2022-11-18 20:43:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:09,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239497702] [2022-11-18 20:43:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-18 20:43:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-18 20:43:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-18 20:43:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:43:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-18 20:43:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 20:43:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-18 20:43:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-18 20:43:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-18 20:43:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-18 20:43:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239497702] [2022-11-18 20:43:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239497702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130797322] [2022-11-18 20:43:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:09,864 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:09,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:43:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:43:10,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-18 20:43:10,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:10,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130797322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:10,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:10,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-18 20:43:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201190513] [2022-11-18 20:43:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:10,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:10,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:10,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:43:10,030 INFO L87 Difference]: Start difference. First operand 3096 states and 3513 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:43:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:10,348 INFO L93 Difference]: Finished difference Result 5875 states and 6711 transitions. [2022-11-18 20:43:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 274 [2022-11-18 20:43:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:10,355 INFO L225 Difference]: With dead ends: 5875 [2022-11-18 20:43:10,355 INFO L226 Difference]: Without dead ends: 2880 [2022-11-18 20:43:10,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:43:10,360 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:10,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 535 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2022-11-18 20:43:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2022-11-18 20:43:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2489 states have (on average 1.1169144234632382) internal successors, (2780), 2491 states have internal predecessors, (2780), 221 states have call successors, (221), 156 states have call predecessors, (221), 167 states have return successors, (248), 232 states have call predecessors, (248), 221 states have call successors, (248) [2022-11-18 20:43:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3249 transitions. [2022-11-18 20:43:10,600 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3249 transitions. Word has length 274 [2022-11-18 20:43:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:10,600 INFO L495 AbstractCegarLoop]: Abstraction has 2880 states and 3249 transitions. [2022-11-18 20:43:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:43:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3249 transitions. [2022-11-18 20:43:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-18 20:43:10,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:10,603 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:10,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:10,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:10,804 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1933642455, now seen corresponding path program 1 times [2022-11-18 20:43:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625708306] [2022-11-18 20:43:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:43:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:43:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:43:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:43:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-18 20:43:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:43:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:43:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:43:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:43:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:43:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:43:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-18 20:43:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-18 20:43:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-18 20:43:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-18 20:43:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-18 20:43:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-18 20:43:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-18 20:43:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-18 20:43:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-11-18 20:43:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625708306] [2022-11-18 20:43:10,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625708306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:10,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373969520] [2022-11-18 20:43:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:10,906 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:10,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:43:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:43:11,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-18 20:43:11,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:11,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373969520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:11,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:11,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-18 20:43:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491277565] [2022-11-18 20:43:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:43:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:43:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:11,133 INFO L87 Difference]: Start difference. First operand 2880 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:43:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:11,339 INFO L93 Difference]: Finished difference Result 3247 states and 3667 transitions. [2022-11-18 20:43:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:43:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 278 [2022-11-18 20:43:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:11,344 INFO L225 Difference]: With dead ends: 3247 [2022-11-18 20:43:11,344 INFO L226 Difference]: Without dead ends: 2881 [2022-11-18 20:43:11,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:11,346 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 47 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:11,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2022-11-18 20:43:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2880. [2022-11-18 20:43:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2489 states have (on average 1.1132985134592206) internal successors, (2771), 2491 states have internal predecessors, (2771), 221 states have call successors, (221), 156 states have call predecessors, (221), 167 states have return successors, (248), 232 states have call predecessors, (248), 221 states have call successors, (248) [2022-11-18 20:43:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3240 transitions. [2022-11-18 20:43:11,571 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3240 transitions. Word has length 278 [2022-11-18 20:43:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:11,572 INFO L495 AbstractCegarLoop]: Abstraction has 2880 states and 3240 transitions. [2022-11-18 20:43:11,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:43:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3240 transitions. [2022-11-18 20:43:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-18 20:43:11,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:11,574 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:11,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:11,775 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1445787055, now seen corresponding path program 1 times [2022-11-18 20:43:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772212456] [2022-11-18 20:43:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:43:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 20:43:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-18 20:43:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-18 20:43:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-18 20:43:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-18 20:43:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-18 20:43:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-18 20:43:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-11-18 20:43:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:11,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772212456] [2022-11-18 20:43:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772212456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:11,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:11,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803015158] [2022-11-18 20:43:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:11,903 INFO L87 Difference]: Start difference. First operand 2880 states and 3240 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:43:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:12,268 INFO L93 Difference]: Finished difference Result 5241 states and 5896 transitions. [2022-11-18 20:43:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 281 [2022-11-18 20:43:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:12,274 INFO L225 Difference]: With dead ends: 5241 [2022-11-18 20:43:12,274 INFO L226 Difference]: Without dead ends: 2746 [2022-11-18 20:43:12,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:12,278 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:12,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 350 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-18 20:43:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2740. [2022-11-18 20:43:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2357 states have (on average 1.1018243529910903) internal successors, (2597), 2359 states have internal predecessors, (2597), 217 states have call successors, (217), 152 states have call predecessors, (217), 163 states have return successors, (244), 228 states have call predecessors, (244), 217 states have call successors, (244) [2022-11-18 20:43:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3058 transitions. [2022-11-18 20:43:12,475 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3058 transitions. Word has length 281 [2022-11-18 20:43:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:12,476 INFO L495 AbstractCegarLoop]: Abstraction has 2740 states and 3058 transitions. [2022-11-18 20:43:12,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:43:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3058 transitions. [2022-11-18 20:43:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-11-18 20:43:12,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:12,479 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:43:12,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-18 20:43:12,479 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -775651037, now seen corresponding path program 1 times [2022-11-18 20:43:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:12,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139135737] [2022-11-18 20:43:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:43:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:43:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:43:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:43:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-18 20:43:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:43:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:43:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:43:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:43:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:43:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:43:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 20:43:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-18 20:43:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-18 20:43:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-18 20:43:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-18 20:43:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-18 20:43:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-18 20:43:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-11-18 20:43:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139135737] [2022-11-18 20:43:12,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139135737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:12,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187813737] [2022-11-18 20:43:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:12,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:12,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:12,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:12,609 INFO L87 Difference]: Start difference. First operand 2740 states and 3058 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-18 20:43:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:12,992 INFO L93 Difference]: Finished difference Result 2740 states and 3058 transitions. [2022-11-18 20:43:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:43:12,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 282 [2022-11-18 20:43:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:12,997 INFO L225 Difference]: With dead ends: 2740 [2022-11-18 20:43:12,997 INFO L226 Difference]: Without dead ends: 2353 [2022-11-18 20:43:12,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:43:12,999 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 165 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:12,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 488 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-11-18 20:43:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2333. [2022-11-18 20:43:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 2007 states have (on average 1.1006477329347284) internal successors, (2209), 2008 states have internal predecessors, (2209), 186 states have call successors, (186), 130 states have call predecessors, (186), 138 states have return successors, (210), 194 states have call predecessors, (210), 186 states have call successors, (210) [2022-11-18 20:43:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 2605 transitions. [2022-11-18 20:43:13,160 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 2605 transitions. Word has length 282 [2022-11-18 20:43:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:13,161 INFO L495 AbstractCegarLoop]: Abstraction has 2333 states and 2605 transitions. [2022-11-18 20:43:13,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-18 20:43:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2605 transitions. [2022-11-18 20:43:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2022-11-18 20:43:13,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:13,168 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-18 20:43:13,169 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1314744943, now seen corresponding path program 1 times [2022-11-18 20:43:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:13,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563162535] [2022-11-18 20:43:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:43:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:43:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:43:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:43:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:43:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 20:43:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-18 20:43:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-18 20:43:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-18 20:43:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-18 20:43:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-18 20:43:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-18 20:43:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-18 20:43:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-18 20:43:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-18 20:43:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-18 20:43:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-18 20:43:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-18 20:43:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-18 20:43:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-18 20:43:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-11-18 20:43:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-11-18 20:43:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-11-18 20:43:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-18 20:43:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-18 20:43:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-11-18 20:43:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-18 20:43:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-11-18 20:43:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2022-11-18 20:43:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-11-18 20:43:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 150 proven. 94 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2022-11-18 20:43:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:13,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563162535] [2022-11-18 20:43:13,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563162535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:13,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688340582] [2022-11-18 20:43:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:13,339 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:13,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:43:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:43:13,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2022-11-18 20:43:13,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688340582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:13,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-18 20:43:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353474166] [2022-11-18 20:43:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:13,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:43:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:43:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:13,650 INFO L87 Difference]: Start difference. First operand 2333 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:43:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:13,762 INFO L93 Difference]: Finished difference Result 3551 states and 3985 transitions. [2022-11-18 20:43:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:43:13,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 503 [2022-11-18 20:43:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:13,765 INFO L225 Difference]: With dead ends: 3551 [2022-11-18 20:43:13,765 INFO L226 Difference]: Without dead ends: 1465 [2022-11-18 20:43:13,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:13,768 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 76 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:13,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 219 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-11-18 20:43:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2022-11-18 20:43:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1275 states have (on average 1.0909803921568628) internal successors, (1391), 1276 states have internal predecessors, (1391), 106 states have call successors, (106), 74 states have call predecessors, (106), 82 states have return successors, (114), 114 states have call predecessors, (114), 106 states have call successors, (114) [2022-11-18 20:43:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1611 transitions. [2022-11-18 20:43:13,868 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1611 transitions. Word has length 503 [2022-11-18 20:43:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:13,868 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 1611 transitions. [2022-11-18 20:43:13,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:43:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1611 transitions. [2022-11-18 20:43:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2022-11-18 20:43:13,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:13,872 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:13,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:14,073 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2096536150, now seen corresponding path program 1 times [2022-11-18 20:43:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924370648] [2022-11-18 20:43:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-18 20:43:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 20:43:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:43:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-18 20:43:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-18 20:43:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-18 20:43:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-18 20:43:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-18 20:43:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-18 20:43:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-18 20:43:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-18 20:43:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-18 20:43:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-18 20:43:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-18 20:43:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-18 20:43:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-18 20:43:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-18 20:43:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-11-18 20:43:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-18 20:43:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-11-18 20:43:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-11-18 20:43:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-18 20:43:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-11-18 20:43:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2022-11-18 20:43:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-18 20:43:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-11-18 20:43:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2022-11-18 20:43:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2022-11-18 20:43:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 175 proven. 72 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2022-11-18 20:43:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924370648] [2022-11-18 20:43:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924370648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170590107] [2022-11-18 20:43:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:14,393 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:14,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:43:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:14,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:43:14,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 661 proven. 0 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2022-11-18 20:43:14,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170590107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:14,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-18 20:43:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450935463] [2022-11-18 20:43:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:14,649 INFO L87 Difference]: Start difference. First operand 1465 states and 1611 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:43:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:14,766 INFO L93 Difference]: Finished difference Result 2672 states and 2952 transitions. [2022-11-18 20:43:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 506 [2022-11-18 20:43:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:14,769 INFO L225 Difference]: With dead ends: 2672 [2022-11-18 20:43:14,769 INFO L226 Difference]: Without dead ends: 1289 [2022-11-18 20:43:14,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:14,771 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 30 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:14,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 510 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-11-18 20:43:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2022-11-18 20:43:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1115 states have (on average 1.0896860986547086) internal successors, (1215), 1116 states have internal predecessors, (1215), 98 states have call successors, (98), 74 states have call predecessors, (98), 74 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2022-11-18 20:43:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1411 transitions. [2022-11-18 20:43:14,853 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1411 transitions. Word has length 506 [2022-11-18 20:43:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:14,853 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1411 transitions. [2022-11-18 20:43:14,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:43:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1411 transitions. [2022-11-18 20:43:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2022-11-18 20:43:14,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:14,857 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:14,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:15,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:15,057 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash -572218028, now seen corresponding path program 1 times [2022-11-18 20:43:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:15,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975987260] [2022-11-18 20:43:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-18 20:43:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-18 20:43:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-18 20:43:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-18 20:43:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-18 20:43:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-18 20:43:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-18 20:43:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-18 20:43:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-18 20:43:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-18 20:43:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-18 20:43:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-18 20:43:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-18 20:43:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-11-18 20:43:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-18 20:43:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-18 20:43:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-11-18 20:43:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-11-18 20:43:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-11-18 20:43:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-11-18 20:43:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-11-18 20:43:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-11-18 20:43:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2022-11-18 20:43:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-11-18 20:43:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2022-11-18 20:43:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-11-18 20:43:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2022-11-18 20:43:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2022-11-18 20:43:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975987260] [2022-11-18 20:43:15,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975987260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:15,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:15,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446091570] [2022-11-18 20:43:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:15,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:15,221 INFO L87 Difference]: Start difference. First operand 1289 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:43:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:15,473 INFO L93 Difference]: Finished difference Result 2704 states and 2968 transitions. [2022-11-18 20:43:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:15,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 518 [2022-11-18 20:43:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:15,476 INFO L225 Difference]: With dead ends: 2704 [2022-11-18 20:43:15,476 INFO L226 Difference]: Without dead ends: 1068 [2022-11-18 20:43:15,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:15,479 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 107 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:15,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 405 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-18 20:43:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1060. [2022-11-18 20:43:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 913 states have (on average 1.0777656078860898) internal successors, (984), 914 states have internal predecessors, (984), 83 states have call successors, (83), 62 states have call predecessors, (83), 62 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-11-18 20:43:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1150 transitions. [2022-11-18 20:43:15,547 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1150 transitions. Word has length 518 [2022-11-18 20:43:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:15,547 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1150 transitions. [2022-11-18 20:43:15,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:43:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1150 transitions. [2022-11-18 20:43:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2022-11-18 20:43:15,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:15,550 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:15,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-18 20:43:15,551 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:43:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash -476883632, now seen corresponding path program 1 times [2022-11-18 20:43:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:15,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510098173] [2022-11-18 20:43:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:43:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:43:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:43:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 20:43:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:43:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:43:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:43:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:43:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:43:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:43:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:43:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:43:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-18 20:43:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-18 20:43:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-18 20:43:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-18 20:43:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-18 20:43:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-18 20:43:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-18 20:43:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-18 20:43:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-18 20:43:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-18 20:43:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-18 20:43:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-18 20:43:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-18 20:43:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-11-18 20:43:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-18 20:43:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-11-18 20:43:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-18 20:43:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-11-18 20:43:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2022-11-18 20:43:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-18 20:43:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-18 20:43:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-11-18 20:43:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-11-18 20:43:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-11-18 20:43:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2022-11-18 20:43:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2022-11-18 20:43:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2022-11-18 20:43:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1797 trivial. 0 not checked. [2022-11-18 20:43:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510098173] [2022-11-18 20:43:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510098173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315189940] [2022-11-18 20:43:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:15,844 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:15,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:43:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:43:16,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-11-18 20:43:17,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315189940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:17,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:17,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2022-11-18 20:43:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914928625] [2022-11-18 20:43:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:17,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:17,131 INFO L87 Difference]: Start difference. First operand 1060 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-11-18 20:43:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:17,268 INFO L93 Difference]: Finished difference Result 1064 states and 1154 transitions. [2022-11-18 20:43:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 530 [2022-11-18 20:43:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:17,270 INFO L225 Difference]: With dead ends: 1064 [2022-11-18 20:43:17,270 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:43:17,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:17,272 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 65 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:17,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 460 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:43:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:43:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:43:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:43:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:43:17,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 530 [2022-11-18 20:43:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:17,274 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:43:17,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-11-18 20:43:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:43:17,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:43:17,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-18 20:43:17,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-18 20:43:17,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-18 20:43:17,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-18 20:43:17,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-18 20:43:17,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-18 20:43:17,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-18 20:43:17,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-18 20:43:17,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:17,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:17,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:44:07,148 INFO L895 garLoopResultBuilder]: At program point L221(lines 195 223) the Hoare annotation is: (let ((.cse44 (<= 1 ~P_1_pc~0)) (.cse47 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse38 (<= |activate_threads_is_C_1_triggered_#res#1| 0)) (.cse48 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse49 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse50 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse51 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse39 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse41 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse52 (<= |activate_threads_~tmp~1#1| 0)) (.cse46 (= ~P_1_pc~0 0)) (.cse42 (<= 0 |activate_threads_is_C_1_triggered_#res#1|)) (.cse43 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse35 (<= ~max_loop~0 ~i~0)) (.cse45 (= ~P_1_st~0 0)) (.cse40 (= ~C_1_st~0 |old(~C_1_st~0)|))) (let ((.cse9 (and (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|) (<= 1 |activate_threads_is_C_1_triggered_#res#1|) .cse45 .cse40 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|) (<= 1 |activate_threads_~tmp~1#1|))) (.cse24 (not (<= ~num~0 2147483646))) (.cse25 (not .cse35)) (.cse22 (not (<= ~C_1_pc~0 1))) (.cse30 (and .cse47 .cse38 .cse48 .cse49 .cse50 .cse51 .cse39 .cse40 .cse41 .cse52 .cse46 .cse42 .cse43)) (.cse31 (and .cse38 .cse39 .cse40 (<= 2 ~C_1_pc~0) .cse41 .cse44 .cse42 .cse43)) (.cse1 (not (<= ~num~0 1))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse8 (not (<= 0 ~num~0))) (.cse32 (not (<= ~i~0 1))) (.cse5 (not (<= ~max_loop~0 2))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse26 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse27 (and .cse47 .cse38 .cse48 .cse49 .cse50 .cse51 .cse39 .cse40 .cse41 .cse52 .cse42 .cse43)) (.cse28 (not .cse46)) (.cse33 (not (<= ~P_1_ev~0 0))) (.cse16 (not (= ~num~0 0))) (.cse34 (not (<= ~C_1_ev~0 0))) (.cse29 (not (= ~i~0 0))) (.cse17 (not (<= 2 ~C_1_ev~0))) (.cse19 (not (<= 2 ~P_1_ev~0))) (.cse23 (and .cse38 .cse39 .cse45 .cse40 .cse44 .cse42 .cse43)) (.cse0 (not (<= 1 ~i~0))) (.cse2 (not (= ~P_1_ev~0 1))) (.cse3 (not (= ~C_1_i~0 1))) (.cse18 (and .cse38 .cse39 .cse40 .cse41 .cse44 .cse42 .cse43)) (.cse37 (not (<= ~num~0 2147483647))) (.cse20 (not (= ~C_1_pc~0 1))) (.cse7 (not (= ~C_1_ev~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse21 (not .cse44)) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (= ~C_1_pc~0 0))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse15 (and .cse38 .cse39 (< 1 ~P_1_pc~0) .cse40 .cse41 .cse42 .cse43)) (.cse12 (= |old(~C_1_st~0)| 0)) (.cse36 (not (<= 1 ~num~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse6 .cse15 .cse12 .cse16) (or .cse17 .cse0 .cse3 .cse18 .cse19 .cse20 .cse6 .cse11 .cse12 .cse16 .cse21) (or .cse13 .cse22 .cse6 .cse15 .cse11 .cse12 .cse16) (or .cse23 .cse0 .cse2 .cse3 .cse18 .cse20 .cse6 .cse7 .cse11 .cse12 .cse16 .cse21) (or .cse0 .cse2 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse26 .cse27 .cse11 .cse28 .cse16 .cse29) (or .cse14 .cse6 .cse28 .cse12 .cse16 .cse30) (or .cse17 .cse31 .cse0 .cse24 .cse3 .cse4 .cse19 .cse25 .cse6 .cse8 .cse10 .cse11 .cse12) (or .cse3 .cse18 (and (or .cse0 .cse1 .cse19 .cse6 .cse11 .cse12 .cse21) (or .cse0 .cse1 .cse6 .cse32 .cse11 .cse33 .cse12 .cse34 .cse21)) .cse20 .cse35 .cse36) (or .cse13 .cse22 .cse6 .cse15 .cse11 .cse12 .cse36) (or .cse22 .cse6 .cse11 .cse28 .cse12 .cse16 .cse30) (or .cse31 (and (or .cse17 .cse0 .cse1 .cse3 .cse4 .cse19 .cse6 .cse8 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse32 .cse11 .cse33 .cse12 .cse34)) .cse5 .cse10) (or .cse3 .cse26 .cse27 .cse11 (not (= ~max_loop~0 2)) .cse28 .cse33 .cse16 .cse34 (not .cse12) .cse29) (or .cse17 .cse0 .cse3 .cse18 .cse37 .cse19 .cse20 .cse6 .cse35 .cse11 .cse12 .cse36 .cse21) (or .cse23 .cse0 .cse2 .cse3 .cse18 .cse37 .cse20 .cse6 .cse7 .cse35 .cse11 .cse12 .cse36 .cse21) (or .cse13 .cse14 .cse6 .cse15 .cse12 .cse36)))) [2022-11-18 20:44:07,149 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-11-18 20:44:07,149 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-11-18 20:44:07,149 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-11-18 20:44:07,149 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2022-11-18 20:44:07,149 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-11-18 20:44:07,150 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-11-18 20:44:07,150 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-11-18 20:44:07,151 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse36 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse37 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse38 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse39 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse40 (= ~P_1_pc~0 0))) (let ((.cse16 (and .cse36 .cse37 .cse38 .cse39 .cse40)) (.cse10 (not (<= ~i~0 1))) (.cse2 (not (<= ~num~0 1))) (.cse13 (not (<= ~max_loop~0 2))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse22 (and .cse38 .cse39)) (.cse28 (not (<= ~num~0 2147483647))) (.cse23 (not (= ~C_1_pc~0 1))) (.cse25 (not (<= 1 ~P_1_pc~0))) (.cse17 (not (<= ~C_1_pc~0 1))) (.cse34 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse18 (not .cse40)) (.cse11 (not (<= ~P_1_ev~0 0))) (.cse15 (and .cse36 .cse37 .cse38 .cse39)) (.cse19 (not (= ~num~0 0))) (.cse12 (not (<= ~C_1_ev~0 0))) (.cse35 (not (= ~i~0 0))) (.cse1 (not (<= 1 ~i~0))) (.cse21 (not (= ~P_1_ev~0 1))) (.cse30 (not (<= ~num~0 2147483646))) (.cse3 (not (= ~C_1_i~0 1))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse31 (not .cse26)) (.cse24 (not (= ~C_1_ev~0 1))) (.cse29 (and .cse38 .cse39 (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse7 (not (<= 0 ~num~0))) (.cse14 (not (= ~P_1_pc~0 1))) (.cse8 (not (<= ~e~0 0))) (.cse32 (<= ~P_1_pc~0 1)) (.cse33 (and .cse36 .cse37 (< 1 ~P_1_pc~0) .cse38 .cse39)) (.cse20 (not (= ~C_1_pc~0 0))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse9 (= |old(~C_1_st~0)| 0)) (.cse27 (not (<= 1 ~num~0)))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse11 .cse9 .cse12)) .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse6 .cse8 .cse18 .cse9 .cse19) (or .cse16 .cse20 .cse6 .cse18 .cse9 .cse19) (or .cse1 .cse21 .cse3 .cse22 .cse23 .cse6 .cse24 .cse8 .cse9 .cse19 .cse25) (or .cse3 (and (or .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse25) (or .cse1 .cse2 .cse6 .cse10 .cse8 .cse11 .cse9 .cse12 .cse25)) .cse23 .cse26 .cse15 .cse27) (or .cse0 .cse1 .cse3 .cse28 .cse5 .cse23 .cse6 .cse26 .cse8 .cse9 .cse15 .cse27 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse23 .cse6 .cse8 .cse9 .cse15 .cse19 .cse25) (or .cse1 .cse2 .cse21 .cse3 .cse4 .cse13 .cse6 .cse24 .cse29 .cse7 .cse14 .cse8 .cse9) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse5 .cse31 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15) (or .cse32 .cse33 .cse20 .cse6 .cse9 .cse19) (or .cse6 .cse34 .cse8 .cse18 .cse15 .cse19 .cse35) (or .cse1 .cse21 .cse3 .cse22 .cse28 .cse23 .cse6 .cse24 .cse26 .cse8 .cse9 .cse27 .cse25) (or .cse32 .cse33 .cse17 .cse6 .cse8 .cse9 .cse19) (or .cse32 .cse33 .cse17 .cse6 .cse8 .cse9 .cse27) (or .cse3 .cse34 .cse8 (not (= ~max_loop~0 2)) .cse18 .cse11 .cse15 .cse19 .cse12 (not .cse9) .cse35) (or .cse1 .cse21 .cse30 .cse3 .cse4 .cse31 .cse6 .cse24 .cse29 .cse7 .cse14 .cse8 .cse9) (or .cse32 .cse33 .cse20 .cse6 .cse9 .cse27)))) [2022-11-18 20:44:07,151 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-11-18 20:44:07,152 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-11-18 20:44:07,153 INFO L895 garLoopResultBuilder]: At program point L129(lines 113 131) the Hoare annotation is: (let ((.cse42 (= ~P_1_pc~0 0)) (.cse36 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse37 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse38 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse39 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse7 (<= ~max_loop~0 ~i~0)) (.cse40 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse41 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse21 (not (<= ~max_loop~0 2))) (.cse13 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse16 (not (= ~i~0 0))) (.cse19 (and .cse40 .cse41 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse34 (not (<= ~num~0 2147483646))) (.cse20 (not (= 2 ~C_1_pc~0))) (.cse35 (not .cse7)) (.cse23 (not (<= 0 ~num~0))) (.cse24 (not (= ~P_1_pc~0 1))) (.cse18 (not (= ~P_1_ev~0 1))) (.cse28 (and .cse40 .cse41)) (.cse3 (not (<= ~num~0 2147483647))) (.cse22 (not (= ~C_1_ev~0 1))) (.cse29 (<= ~P_1_pc~0 1)) (.cse32 (not (<= ~C_1_pc~0 1))) (.cse31 (and .cse36 .cse37 .cse38 .cse39 (< 1 ~P_1_pc~0) .cse40 .cse41)) (.cse30 (not (= ~C_1_pc~0 0))) (.cse33 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42)) (.cse14 (not .cse42)) (.cse15 (not (= ~num~0 0))) (.cse2 (not (= ~C_1_i~0 1))) (.cse4 (not (<= 2 ~P_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse17 (not (<= ~num~0 1))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse25 (not (<= ~i~0 1))) (.cse8 (not (<= ~e~0 0))) (.cse26 (not (<= ~P_1_ev~0 0))) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse27 (not (<= ~C_1_ev~0 0))) (.cse12 (not (<= 1 ~P_1_pc~0))) (.cse5 (not (= ~C_1_pc~0 1))) (.cse9 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse11 (not (<= 1 ~num~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse18 .cse2 .cse19 .cse20 .cse21 .cse6 .cse22 .cse23 .cse24 .cse8 .cse10) (or (and (or .cse0 .cse1 .cse17 .cse2 .cse20 .cse4 .cse6 .cse23 .cse8 .cse10) (or .cse1 .cse17 .cse2 .cse20 .cse6 .cse23 .cse25 .cse8 .cse26 .cse10 .cse27)) .cse21 .cse24 .cse9) (or .cse1 .cse18 .cse2 .cse28 .cse5 .cse6 .cse22 .cse8 .cse10 .cse15 .cse12) (or .cse29 .cse30 .cse6 .cse31 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse12) (or .cse2 .cse13 .cse8 (not (= ~max_loop~0 2)) .cse9 .cse14 .cse26 .cse15 .cse27 (not .cse10) .cse16) (or .cse32 .cse33 .cse6 .cse8 .cse14 .cse10 .cse15) (or .cse29 .cse32 .cse6 .cse31 .cse8 .cse10 .cse15) (or .cse29 .cse30 .cse6 .cse31 .cse10 .cse15) (or .cse1 .cse18 .cse34 .cse2 .cse19 .cse20 .cse35 .cse6 .cse22 .cse23 .cse24 .cse8 .cse10) (or .cse0 .cse1 .cse34 .cse2 .cse20 .cse4 .cse35 .cse6 .cse23 .cse24 .cse8 .cse9 .cse10) (or .cse1 .cse18 .cse2 .cse28 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse29 .cse32 .cse6 .cse31 .cse8 .cse10 .cse11) (or .cse30 .cse33 .cse6 .cse14 .cse10 .cse15) (or .cse2 (and (or .cse1 .cse17 .cse4 .cse6 .cse8 .cse10 .cse12) (or .cse1 .cse17 .cse6 .cse25 .cse8 .cse26 .cse10 .cse27 .cse12)) .cse5 .cse7 .cse9 .cse11)))) [2022-11-18 20:44:07,154 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse38 (= ~P_1_pc~0 0)) (.cse39 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse40 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse41 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse42 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse43 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse47 (<= |activate_threads_~tmp~1#1| 0)) (.cse50 (= ~P_1_st~0 0)) (.cse19 (<= ~max_loop~0 ~i~0)) (.cse44 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse45 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse46 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse49 (<= 1 ~P_1_pc~0)) (.cse48 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0))) (let ((.cse14 (not (<= ~max_loop~0 2))) (.cse0 (and .cse44 .cse45 (<= 2 ~C_1_pc~0) .cse46 .cse49 .cse48)) (.cse36 (not (<= ~num~0 2147483646))) (.cse5 (not (= 2 ~C_1_pc~0))) (.cse37 (not .cse19)) (.cse8 (not (<= 0 ~num~0))) (.cse15 (not (= ~P_1_pc~0 1))) (.cse32 (and (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|) .cse50 .cse45 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|) (<= 1 |activate_threads_~tmp~1#1|))) (.cse3 (not (<= ~num~0 1))) (.cse11 (not (<= ~i~0 1))) (.cse12 (not (<= ~P_1_ev~0 0))) (.cse13 (not (<= ~C_1_ev~0 0))) (.cse1 (not (<= 2 ~C_1_ev~0))) (.cse6 (not (<= 2 ~P_1_ev~0))) (.cse22 (<= ~P_1_pc~0 1)) (.cse23 (and .cse44 (< 1 ~P_1_pc~0) .cse45 .cse46 .cse48)) (.cse33 (not (<= ~C_1_pc~0 1))) (.cse25 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse26 (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48)) (.cse29 (not (= ~i~0 0))) (.cse16 (and .cse44 .cse45 .cse46 .cse49 .cse48)) (.cse2 (not (<= 1 ~i~0))) (.cse30 (not (= ~P_1_ev~0 1))) (.cse4 (not (= ~C_1_i~0 1))) (.cse17 (not (<= ~num~0 2147483647))) (.cse18 (not (= ~C_1_pc~0 1))) (.cse31 (not (= ~C_1_ev~0 1))) (.cse35 (and .cse44 .cse50 .cse45 .cse49 .cse48)) (.cse9 (not (<= ~e~0 0))) (.cse20 (not (<= 1 ~num~0))) (.cse21 (not .cse49)) (.cse24 (not (= ~C_1_pc~0 0))) (.cse34 (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse38 .cse48)) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse27 (not .cse38)) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse28 (not (= ~num~0 0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse12 .cse10 .cse13)) .cse14 .cse15) (or .cse16 .cse1 .cse2 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse20 .cse21) (or .cse22 .cse23 .cse24 .cse7 .cse10 .cse20) (or .cse4 .cse25 .cse26 .cse9 (not (= ~max_loop~0 2)) .cse27 .cse12 .cse28 .cse13 (not .cse10) .cse29) (or .cse2 .cse3 .cse30 .cse4 .cse5 .cse14 .cse7 .cse31 .cse8 .cse15 .cse9 .cse32 .cse10) (or .cse33 .cse34 .cse7 .cse9 .cse27 .cse10 .cse28) (or .cse22 .cse23 .cse24 .cse7 .cse10 .cse28) (or .cse16 .cse2 .cse30 .cse4 .cse18 .cse7 .cse31 .cse35 .cse9 .cse10 .cse28 .cse21) (or .cse22 .cse23 .cse33 .cse7 .cse9 .cse10 .cse20) (or .cse1 .cse2 .cse36 .cse4 .cse0 .cse5 .cse6 .cse37 .cse7 .cse8 .cse15 .cse9 .cse10) (or .cse2 .cse30 .cse36 .cse4 .cse5 .cse37 .cse7 .cse31 .cse8 .cse15 .cse9 .cse32 .cse10) (or .cse16 .cse4 (and (or .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 .cse21) (or .cse2 .cse3 .cse7 .cse11 .cse9 .cse12 .cse10 .cse13 .cse21)) .cse18 .cse19 .cse20) (or .cse16 .cse1 .cse2 .cse4 .cse6 .cse18 .cse7 .cse9 .cse10 .cse28 .cse21) (or .cse22 .cse23 .cse33 .cse7 .cse9 .cse10 .cse28) (or .cse7 .cse25 .cse26 .cse9 .cse27 .cse28 .cse29) (or .cse16 .cse2 .cse30 .cse4 .cse17 .cse18 .cse7 .cse31 .cse19 .cse35 .cse9 .cse10 .cse20 .cse21) (or .cse24 .cse34 .cse7 .cse27 .cse10 .cse28)))) [2022-11-18 20:44:07,154 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-11-18 20:44:07,154 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-11-18 20:44:07,155 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 374 399) the Hoare annotation is: (let ((.cse8 (<= ~max_loop~0 ~i~0)) (.cse34 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse35 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse36 (= ~P_1_pc~0 0))) (let ((.cse23 (not (<= ~max_loop~0 2))) (.cse20 (and .cse34 .cse35 .cse36)) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse21 (not (<= ~num~0 1))) (.cse26 (not (<= ~i~0 1))) (.cse27 (not (<= ~P_1_ev~0 0))) (.cse28 (not (<= ~C_1_ev~0 0))) (.cse29 (not (= ~C_1_pc~0 0))) (.cse4 (not (<= ~num~0 2147483647))) (.cse6 (not (= ~C_1_pc~0 1))) (.cse12 (not (<= 1 ~P_1_pc~0))) (.cse32 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse19 (not .cse36)) (.cse15 (not (= ~num~0 0))) (.cse33 (not (= ~i~0 0))) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (<= ~C_1_pc~0 1))) (.cse11 (not (<= 1 ~num~0))) (.cse16 (and (< 1 ~P_1_pc~0) .cse34 .cse35)) (.cse1 (not (<= 1 ~i~0))) (.cse17 (not (= ~P_1_ev~0 1))) (.cse30 (not (<= ~num~0 2147483646))) (.cse2 (not (= ~C_1_i~0 1))) (.cse3 (and .cse34 .cse35)) (.cse22 (not (= 2 ~C_1_pc~0))) (.cse31 (not .cse8)) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse18 (not (= ~C_1_ev~0 1))) (.cse24 (not (<= 0 ~num~0))) (.cse25 (not (= ~P_1_pc~0 1))) (.cse9 (not (<= ~e~0 0))) (.cse10 (= |old(~C_1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse6 .cse7 .cse18 .cse9 .cse10 .cse15 .cse12) (or .cse14 .cse7 .cse9 .cse19 .cse10 .cse15 .cse20) (or .cse1 .cse21 .cse17 .cse2 .cse3 .cse22 .cse23 .cse7 .cse18 .cse24 .cse25 .cse9 .cse10) (or .cse3 (and (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse5 .cse7 .cse24 .cse9 .cse10) (or .cse1 .cse21 .cse2 .cse22 .cse7 .cse24 .cse26 .cse9 .cse27 .cse10 .cse28)) .cse23 .cse25) (or .cse29 .cse7 .cse19 .cse10 .cse15 .cse20) (or .cse0 .cse1 .cse30 .cse2 .cse3 .cse22 .cse5 .cse31 .cse7 .cse24 .cse25 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse12) (or .cse2 .cse3 (and (or .cse1 .cse21 .cse5 .cse7 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse7 .cse26 .cse9 .cse27 .cse10 .cse28 .cse12)) .cse6 .cse8 .cse11) (or .cse13 .cse29 .cse7 .cse10 .cse11 .cse16) (or .cse2 .cse3 .cse32 .cse9 (not (= ~max_loop~0 2)) .cse19 .cse27 .cse15 .cse28 (not .cse10) .cse33) (or .cse13 .cse29 .cse7 .cse10 .cse15 .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse7 .cse32 .cse9 .cse19 .cse15 .cse33) (or .cse13 .cse14 .cse7 .cse9 .cse10 .cse11 .cse16) (or .cse1 .cse17 .cse30 .cse2 .cse3 .cse22 .cse31 .cse7 .cse18 .cse24 .cse25 .cse9 .cse10)))) [2022-11-18 20:44:07,155 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-11-18 20:44:07,155 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-11-18 20:44:07,156 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-11-18 20:44:07,156 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-11-18 20:44:07,156 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 269) the Hoare annotation is: true [2022-11-18 20:44:07,157 INFO L895 garLoopResultBuilder]: At program point L267(lines 251 269) the Hoare annotation is: (let ((.cse12 (= ~P_1_st~0 0)) (.cse27 (<= ~max_loop~0 ~i~0)) (.cse23 (= ~C_1_st~0 0))) (let ((.cse3 (not (= ~max_loop~0 2))) (.cse10 (not (= ~i~0 0))) (.cse11 (not (<= ~num~0 1))) (.cse25 (not (<= 1 ~P_1_pc~0))) (.cse24 (not (= ~C_1_pc~0 1))) (.cse4 (not (= ~P_1_pc~0 0))) (.cse5 (not (<= ~P_1_ev~0 0))) (.cse7 (not (= ~num~0 0))) (.cse8 (not (<= ~C_1_ev~0 0))) (.cse26 (not (<= ~num~0 2147483647))) (.cse22 (not (<= ~max_loop~0 2))) (.cse6 (not .cse23)) (.cse14 (not (<= 1 ~num~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse15 (not (<= 2 ~C_1_ev~0))) (.cse16 (not (<= 1 ~i~0))) (.cse17 (not (<= ~num~0 2147483646))) (.cse1 (not (= ~C_1_i~0 1))) (.cse18 (not (= 2 ~C_1_pc~0))) (.cse19 (not (<= 2 ~P_1_ev~0))) (.cse20 (not .cse27)) (.cse21 (not (<= 0 ~num~0))) (.cse13 (not (= ~P_1_pc~0 1))) (.cse2 (not (<= ~e~0 0))) (.cse9 (not .cse12))) (and (or .cse0 .cse1 (not (= ~C_1_pc~0 ~P_1_pc~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 (not (= ~C_1_pc~0 0)) .cse12 .cse13 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8 .cse10) (or .cse0 .cse15 .cse16 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse13 .cse2 .cse6) (or .cse0 .cse15 .cse16 .cse11 .cse1 .cse18 .cse19 .cse22 .cse21 .cse13 .cse2 .cse6 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse19 .cse24 .cse2 .cse7 .cse25 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse26 .cse19 .cse24 .cse27 .cse2 .cse14 .cse25 .cse9) (or .cse0 .cse16 .cse1 .cse23 .cse24 (not (<= ~i~0 1)) .cse2 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse26 .cse18 .cse19 .cse12 .cse22 .cse27 .cse13 .cse2 .cse6 .cse14) (or .cse0 .cse15 .cse16 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse13 .cse2 .cse9)))) [2022-11-18 20:44:07,157 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2022-11-18 20:44:07,157 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 269) no Hoare annotation was computed. [2022-11-18 20:44:07,157 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-11-18 20:44:07,157 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-11-18 20:44:07,157 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-11-18 20:44:07,157 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-11-18 20:44:07,158 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-11-18 20:44:07,158 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-11-18 20:44:07,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-18 20:44:07,158 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-11-18 20:44:07,158 INFO L895 garLoopResultBuilder]: At program point L52(lines 32 54) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 0 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483646) .cse3 .cse4 .cse5) (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))))) [2022-11-18 20:44:07,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:44:07,159 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-11-18 20:44:07,159 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-11-18 20:44:07,160 INFO L895 garLoopResultBuilder]: At program point L86(lines 81 111) the Hoare annotation is: (let ((.cse18 (= ~C_1_st~0 0)) (.cse16 (<= ~max_loop~0 ~i~0))) (let ((.cse14 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse12 (<= ~num~0 1)) (.cse17 (<= 0 ~num~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse11 (not .cse16)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse13 (<= 1 ~num~0)) (.cse3 (= ~C_1_pc~0 1)) (.cse0 (<= 1 ~i~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse8 (not .cse18)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse19 (<= ~P_1_ev~0 0)) (.cse20 (<= ~C_1_ev~0 0)) (.cse21 (= ~P_1_pc~0 0)) (.cse7 (= ~num~0 0)) (.cse9 (= ~C_1_i~0 1)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse12 .cse8 .cse13 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 (<= ~num~0 2147483646) .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse18 .cse15 .cse4 .cse5 (<= ~max_loop~0 2) .cse12 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse6 .cse8 .cse13 .cse9 .cse10) (and .cse3 (or (and .cse0 .cse4 .cse5 .cse19 (<= ~i~0 1) .cse20 .cse21 .cse7 .cse8 .cse10) (and .cse0 .cse2 .cse5 (or (and .cse4 (< 1 ~P_1_pc~0) .cse7 .cse8 .cse10) (and .cse4 .cse21 .cse7 .cse8 .cse10)))) .cse9) (and .cse18 (= ~i~0 0) .cse4 .cse5 .cse19 (= ~max_loop~0 2) .cse20 .cse21 (= ~C_1_pc~0 0) .cse7 .cse9 .cse10)))) [2022-11-18 20:44:07,160 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-18 20:44:07,160 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-11-18 20:44:07,160 INFO L895 garLoopResultBuilder]: At program point L483(lines 430 488) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-11-18 20:44:07,161 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse23 (= ~P_1_st~0 0)) (.cse22 (= ~C_1_st~0 0)) (.cse16 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (<= ~num~0 2147483646)) (.cse8 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse19 (not .cse16)) (.cse15 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse5 (<= 1 ~i~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse20 (<= ~num~0 1)) (.cse18 (<= 0 ~num~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse22)) (.cse21 (<= 1 ~num~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse9 .cse16 .cse17 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse3 .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse24 .cse20 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse16 .cse17 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse10 .cse3 .cse21 .cse11) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse20 .cse3 .cse21 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse20 .cse3 .cse21 .cse4)) .cse19 .cse11) (and .cse15 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse20 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse20 .cse3 .cse18 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse21 .cse4) (and .cse12 .cse1 .cse3 .cse21 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,161 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2022-11-18 20:44:07,161 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2022-11-18 20:44:07,161 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2022-11-18 20:44:07,161 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-11-18 20:44:07,162 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-11-18 20:44:07,162 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2022-11-18 20:44:07,162 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse19)) (.cse9 (= ~C_1_pc~0 1)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse5 (< 1 ~P_1_pc~0)) (.cse15 (<= 1 ~num~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (<= 1 ~i~0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse10 (= ~P_1_ev~0 1)) (.cse13 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse20 (<= 0 ~num~0)) (.cse14 (= ~C_1_ev~0 1)) (.cse16 (= ~C_1_i~0 1)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse12 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse12 .cse2 .cse3 .cse14 .cse16 .cse4) (and .cse5 .cse1 .cse3 .cse15 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 (<= ~num~0 2147483646) .cse3 .cse20 .cse14 .cse16 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 (<= ~max_loop~0 2) .cse13 .cse3 .cse20 .cse14 .cse16 .cse4)))) [2022-11-18 20:44:07,162 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2022-11-18 20:44:07,162 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2022-11-18 20:44:07,163 INFO L895 garLoopResultBuilder]: At program point L518(lines 499 520) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-11-18 20:44:07,163 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2022-11-18 20:44:07,163 INFO L895 garLoopResultBuilder]: At program point L353(lines 342 355) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse19)) (.cse9 (= ~C_1_pc~0 1)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse5 (< 1 ~P_1_pc~0)) (.cse15 (<= 1 ~num~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (<= 1 ~i~0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse10 (= ~P_1_ev~0 1)) (.cse13 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse20 (<= 0 ~num~0)) (.cse14 (= ~C_1_ev~0 1)) (.cse16 (= ~C_1_i~0 1)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse12 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse12 .cse2 .cse3 .cse14 .cse16 .cse4) (and .cse5 .cse1 .cse3 .cse15 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 (<= ~num~0 2147483646) .cse3 .cse20 .cse14 .cse16 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 (<= ~max_loop~0 2) .cse13 .cse3 .cse20 .cse14 .cse16 .cse4)))) [2022-11-18 20:44:07,164 INFO L895 garLoopResultBuilder]: At program point L320(lines 271 325) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,164 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse28 (<= ~max_loop~0 ~i~0)) (.cse30 (= ~P_1_st~0 0)) (.cse4 (= ~C_1_st~0 0))) (let ((.cse18 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse25 (= ~max_loop~0 2)) (.cse9 (<= ~num~0 2147483647)) (.cse5 (= ~P_1_pc~0 1)) (.cse8 (<= ~max_loop~0 2)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse3 (= 2 ~C_1_pc~0)) (.cse29 (<= 0 ~num~0)) (.cse27 (<= ~C_1_pc~0 1)) (.cse23 (< 1 ~P_1_pc~0)) (.cse24 (= ~i~0 0)) (.cse13 (= ~P_1_pc~0 0)) (.cse14 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse19 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse21 (<= ~C_1_ev~0 0)) (.cse0 (<= 1 ~i~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse6 (<= ~e~0 0)) (.cse22 (<= 1 ~P_1_pc~0)) (.cse26 (<= ~num~0 1)) (.cse16 (not .cse4)) (.cse12 (not .cse30)) (.cse7 (not .cse28)) (.cse10 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse12) (and .cse0 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse13 .cse15 .cse16 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse22 .cse15 .cse16 .cse11) (and .cse23 .cse14 .cse15 .cse16 .cse12) (and .cse4 .cse5 .cse24 .cse6 .cse18 .cse19 .cse25 .cse21 .cse14 .cse26 .cse10 .cse11 .cse12) (and .cse27 .cse6 .cse23 .cse15 .cse16 .cse12) (and .cse4 .cse24 .cse6 .cse19 .cse25 .cse21 .cse13 .cse14 .cse15 .cse11) (and .cse27 .cse6 .cse13 .cse15 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse28 (<= ~num~0 2147483646) .cse29 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 .cse22 .cse26 .cse16 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse8 .cse26 .cse29 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse9 .cse22 .cse16 .cse10 .cse11) (and .cse5 .cse8 (or (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse26 .cse16 .cse29 .cse11 .cse12) (and .cse0 .cse3 .cse6 .cse19 .cse20 .cse21 .cse26 .cse16 .cse29 .cse11 .cse12))) (and .cse27 .cse6 .cse23 .cse16 .cse10 .cse12) (and .cse23 .cse14 .cse16 .cse10 .cse12) (and .cse24 .cse6 .cse13 .cse14 .cse15 .cse12) (and .cse17 (or (and .cse0 .cse6 .cse19 .cse20 .cse21 .cse22 .cse26 .cse16 .cse12) (and .cse0 .cse2 .cse6 .cse22 .cse26 .cse16 .cse12)) .cse7 .cse10 .cse11)))) [2022-11-18 20:44:07,165 INFO L895 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-11-18 20:44:07,165 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,165 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-11-18 20:44:07,165 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-11-18 20:44:07,165 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-11-18 20:44:07,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:44:07,166 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-11-18 20:44:07,166 INFO L895 garLoopResultBuilder]: At program point L438(line 438) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2022-11-18 20:44:07,166 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2022-11-18 20:44:07,166 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-11-18 20:44:07,167 INFO L895 garLoopResultBuilder]: At program point L191(lines 137 194) the Hoare annotation is: (let ((.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse20 (<= ~C_1_pc~0 1)) (.cse0 (= ~P_1_pc~0 0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse14 (= ~P_1_pc~0 1)) (.cse19 (<= 0 ~num~0)) (.cse13 (< 1 ~P_1_pc~0)) (.cse1 (= ~C_1_pc~0 0)) (.cse4 (not (= ~P_1_st~0 0))) (.cse5 (<= 1 ~i~0)) (.cse15 (<= 2 ~C_1_ev~0)) (.cse16 (<= 2 ~P_1_ev~0)) (.cse6 (= ~C_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse2 (= ~num~0 0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse12 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse3 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4) (and .cse14 (<= ~max_loop~0 2) (let ((.cse18 (<= ~num~0 1))) (or (and .cse5 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse3 .cse19 .cse12 .cse4) (and .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse3 .cse19 .cse12 .cse4)))) (and .cse20 .cse7 .cse13 .cse2 .cse3 .cse4) (and .cse20 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse15 .cse16 .cse17 .cse14 .cse7 .cse8 (<= ~max_loop~0 ~i~0) (<= ~num~0 2147483646) .cse3 .cse19 .cse12) (and .cse13 .cse1 .cse3 (<= 1 ~num~0) .cse4) (and .cse5 .cse15 .cse16 .cse6 .cse7 .cse8 (<= 1 ~P_1_pc~0) .cse2 .cse3 .cse12))) [2022-11-18 20:44:07,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-18 20:44:07,167 INFO L895 garLoopResultBuilder]: At program point L158(lines 140 193) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 1 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))) (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483647) .cse3 .cse4 .cse5))) [2022-11-18 20:44:07,167 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-11-18 20:44:07,168 INFO L895 garLoopResultBuilder]: At program point L241-1(lines 232 249) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-11-18 20:44:07,168 INFO L895 garLoopResultBuilder]: At program point L109(lines 78 112) the Hoare annotation is: (let ((.cse14 (= ~C_1_st~0 0)) (.cse23 (<= ~max_loop~0 ~i~0))) (let ((.cse1 (<= 2 ~C_1_ev~0)) (.cse22 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse25 (<= ~num~0 2147483647)) (.cse21 (<= ~C_1_pc~0 1)) (.cse3 (= ~C_1_pc~0 1)) (.cse24 (not .cse23)) (.cse17 (<= ~P_1_ev~0 0)) (.cse18 (<= ~C_1_ev~0 0)) (.cse0 (<= 1 ~i~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse19 (<= ~num~0 1)) (.cse9 (= ~C_1_i~0 1)) (.cse13 (< 1 ~P_1_pc~0)) (.cse8 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~i~0 0)) (.cse4 (<= ~e~0 0)) (.cse11 (= ~P_1_pc~0 0)) (.cse12 (= ~C_1_pc~0 0)) (.cse7 (= ~num~0 0)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse8 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse10) (and .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 (= ~max_loop~0 2) .cse18 .cse12 .cse19 .cse20 .cse9 .cse10) (and .cse21 .cse4 .cse13 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse22 .cse15 .cse4 .cse5 .cse23 (<= ~num~0 2147483646) (<= 0 ~num~0) .cse9 .cse10) (and .cse21 .cse4 .cse11 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse25 .cse6 .cse8 .cse20 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse22 .cse14 .cse15 .cse4 .cse5 .cse24 (<= ~max_loop~0 2) .cse25 .cse20 .cse9 .cse10) (and .cse21 .cse4 .cse13 .cse8 .cse20 .cse10) (and .cse3 .cse24 (or (and .cse0 .cse4 .cse5 .cse17 (<= ~i~0 1) .cse18 .cse6 .cse19 .cse8 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10)) .cse20 .cse9) (and .cse13 .cse12 .cse8 .cse20 .cse10) (and .cse16 .cse4 .cse11 .cse12 .cse7 .cse10)))) [2022-11-18 20:44:07,168 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-18 20:44:07,168 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-11-18 20:44:07,169 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-11-18 20:44:07,169 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-18 20:44:07,169 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,169 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-18 20:44:07,170 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,170 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-18 20:44:07,170 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-18 20:44:07,170 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-11-18 20:44:07,170 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-11-18 20:44:07,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:44:07,171 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-11-18 20:44:07,171 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-11-18 20:44:07,171 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,171 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-11-18 20:44:07,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-18 20:44:07,172 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-11-18 20:44:07,172 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-11-18 20:44:07,172 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-11-18 20:44:07,173 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse13 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (not .cse13)) (.cse16 (= ~C_1_pc~0 1)) (.cse18 (<= 1 ~P_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse8 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~i~0 1)) (.cse22 (<= ~C_1_ev~0 0)) (.cse23 (<= ~num~0 1)) (.cse14 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse19 (<= 1 ~num~0)) (.cse7 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 (<= ~num~0 2147483646) .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse17 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse18 .cse3 .cse19 .cse15 .cse4) (and .cse16 (or (and .cse8 .cse7 .cse20 .cse21 .cse22 .cse18 .cse23 .cse3 .cse19 .cse4) (and .cse8 .cse10 .cse7 .cse18 .cse23 .cse3 .cse19 .cse4)) .cse17 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse7 .cse18 .cse2 .cse3 .cse15 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse23 .cse3 .cse14 .cse15 .cse4) (and .cse8 .cse11 .cse7 .cse20 .cse21 .cse22 .cse23 .cse3 .cse14 .cse15 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse19 .cse4) (and .cse5 .cse1 .cse3 .cse19 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,173 INFO L895 garLoopResultBuilder]: At program point L426(lines 415 428) the Hoare annotation is: (let ((.cse23 (= ~P_1_st~0 0)) (.cse22 (= ~C_1_st~0 0)) (.cse16 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (<= ~num~0 2147483646)) (.cse8 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse19 (not .cse16)) (.cse15 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse5 (<= 1 ~i~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse20 (<= ~num~0 1)) (.cse18 (<= 0 ~num~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse22)) (.cse21 (<= 1 ~num~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse9 .cse16 .cse17 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse3 .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse24 .cse20 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse16 .cse17 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse10 .cse3 .cse21 .cse11) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse20 .cse3 .cse21 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse20 .cse3 .cse21 .cse4)) .cse19 .cse11) (and .cse15 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse20 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse20 .cse3 .cse18 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse21 .cse4) (and .cse12 .cse1 .cse3 .cse21 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,173 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-11-18 20:44:07,173 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2022-11-18 20:44:07,174 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-18 20:44:07,174 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-18 20:44:07,174 INFO L895 garLoopResultBuilder]: At program point L427(lines 411 429) the Hoare annotation is: (let ((.cse23 (= ~P_1_st~0 0)) (.cse22 (= ~C_1_st~0 0)) (.cse16 (<= ~max_loop~0 ~i~0))) (let ((.cse17 (<= ~num~0 2147483646)) (.cse8 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse19 (not .cse16)) (.cse15 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse5 (<= 1 ~i~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse20 (<= ~num~0 1)) (.cse18 (<= 0 ~num~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse22)) (.cse21 (<= 1 ~num~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse9 .cse16 .cse17 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse3 .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse24 .cse20 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse22 .cse15 .cse9 .cse23 .cse16 .cse17 .cse18 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse10 .cse3 .cse21 .cse11) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse20 .cse3 .cse21 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse20 .cse3 .cse21 .cse4)) .cse19 .cse11) (and .cse15 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse20 .cse3 .cse18 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse20 .cse3 .cse18 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse21 .cse4) (and .cse12 .cse1 .cse3 .cse21 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,174 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-18 20:44:07,174 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-18 20:44:07,175 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-11-18 20:44:07,175 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-11-18 20:44:07,175 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:44:07,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-18 20:44:07,175 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 442 482) the Hoare annotation is: (let ((.cse26 (= ~P_1_st~0 0)) (.cse14 (= ~C_1_st~0 0)) (.cse20 (<= ~max_loop~0 ~i~0))) (let ((.cse21 (<= ~num~0 2147483646)) (.cse8 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse23 (not .cse20)) (.cse19 (= ~P_1_pc~0 1)) (.cse27 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse5 (<= 1 ~i~0)) (.cse18 (= 2 ~C_1_pc~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse28 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse24 (<= ~num~0 1)) (.cse22 (<= 0 ~num~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse14)) (.cse25 (<= 1 ~num~0)) (.cse15 (= ~i~0 0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse9 .cse16 (= ~max_loop~0 2) .cse17 .cse0 .cse1 .cse2 .cse11) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse3 .cse22 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse3 .cse25 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse14 .cse19 .cse9 .cse26 .cse27 .cse24 .cse22 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse14 .cse19 .cse9 .cse26 .cse20 .cse21 .cse22 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse10 .cse3 .cse25 .cse11) (and .cse8 (or (and .cse5 .cse9 .cse16 .cse28 .cse17 .cse10 .cse24 .cse3 .cse25 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse24 .cse3 .cse25 .cse4)) .cse23 .cse11) (and .cse19 .cse27 (or (and .cse5 .cse6 .cse7 .cse18 .cse9 .cse24 .cse3 .cse22 .cse11 .cse4) (and .cse5 .cse18 .cse9 .cse16 .cse28 .cse17 .cse24 .cse3 .cse22 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse25 .cse4) (and .cse12 .cse1 .cse3 .cse25 .cse4) (and .cse15 .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,176 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse28 (<= ~max_loop~0 ~i~0)) (.cse30 (= ~P_1_st~0 0)) (.cse4 (= ~C_1_st~0 0))) (let ((.cse18 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse25 (= ~max_loop~0 2)) (.cse9 (<= ~num~0 2147483647)) (.cse5 (= ~P_1_pc~0 1)) (.cse8 (<= ~max_loop~0 2)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse3 (= 2 ~C_1_pc~0)) (.cse29 (<= 0 ~num~0)) (.cse27 (<= ~C_1_pc~0 1)) (.cse23 (< 1 ~P_1_pc~0)) (.cse24 (= ~i~0 0)) (.cse13 (= ~P_1_pc~0 0)) (.cse14 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse19 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse21 (<= ~C_1_ev~0 0)) (.cse0 (<= 1 ~i~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse6 (<= ~e~0 0)) (.cse22 (<= 1 ~P_1_pc~0)) (.cse26 (<= ~num~0 1)) (.cse16 (not .cse4)) (.cse12 (not .cse30)) (.cse7 (not .cse28)) (.cse10 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse12) (and .cse0 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse13 .cse15 .cse16 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse22 .cse15 .cse16 .cse11) (and .cse23 .cse14 .cse15 .cse16 .cse12) (and .cse4 .cse5 .cse24 .cse6 .cse18 .cse19 .cse25 .cse21 .cse14 .cse26 .cse10 .cse11 .cse12) (and .cse27 .cse6 .cse23 .cse15 .cse16 .cse12) (and .cse4 .cse24 .cse6 .cse19 .cse25 .cse21 .cse13 .cse14 .cse15 .cse11) (and .cse27 .cse6 .cse13 .cse15 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse28 (<= ~num~0 2147483646) .cse29 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 .cse22 .cse26 .cse16 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse8 .cse26 .cse29 .cse11) (and .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse9 .cse22 .cse16 .cse10 .cse11) (and .cse5 .cse8 (or (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse26 .cse16 .cse29 .cse11 .cse12) (and .cse0 .cse3 .cse6 .cse19 .cse20 .cse21 .cse26 .cse16 .cse29 .cse11 .cse12))) (and .cse27 .cse6 .cse23 .cse16 .cse10 .cse12) (and .cse23 .cse14 .cse16 .cse10 .cse12) (and .cse24 .cse6 .cse13 .cse14 .cse15 .cse12) (and .cse17 (or (and .cse0 .cse6 .cse19 .cse20 .cse21 .cse22 .cse26 .cse16 .cse12) (and .cse0 .cse2 .cse6 .cse22 .cse26 .cse16 .cse12)) .cse7 .cse10 .cse11)))) [2022-11-18 20:44:07,176 INFO L895 garLoopResultBuilder]: At program point L148(lines 140 193) the Hoare annotation is: (let ((.cse13 (= ~P_1_st~0 0))) (let ((.cse15 (<= ~num~0 1)) (.cse14 (<= ~max_loop~0 2)) (.cse21 (<= 1 ~num~0)) (.cse6 (not .cse13)) (.cse7 (<= 1 ~i~0)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse11 (= ~P_1_pc~0 1)) (.cse22 (<= ~max_loop~0 ~i~0)) (.cse16 (<= 0 ~num~0)) (.cse0 (= ~i~0 0)) (.cse1 (<= ~e~0 0)) (.cse12 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse18 (<= ~P_1_ev~0 0)) (.cse19 (= ~max_loop~0 2)) (.cse20 (<= ~C_1_ev~0 0)) (.cse2 (= ~P_1_pc~0 0)) (.cse3 (= ~C_1_pc~0 0)) (.cse4 (= ~num~0 0)) (.cse5 (not (= ~C_1_st~0 0))) (.cse17 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15 .cse5 .cse16 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse18 .cse19 .cse20 .cse3 .cse15 .cse5 .cse21 .cse17 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 (not .cse22) .cse14 (<= ~num~0 2147483647) .cse5 .cse21 .cse17 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse22 (<= ~num~0 2147483646) .cse5 .cse16 .cse17) (and .cse0 .cse1 .cse12 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse17)))) [2022-11-18 20:44:07,176 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2022-11-18 20:44:07,177 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-11-18 20:44:07,177 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-11-18 20:44:07,177 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 55 73) the Hoare annotation is: (let ((.cse3 (= ~C_1_st~0 0))) (let ((.cse13 (<= ~P_1_ev~0 0)) (.cse14 (<= ~C_1_ev~0 0)) (.cse15 (= ~num~0 0)) (.cse0 (<= 1 ~i~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse12 (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0))) (.cse11 (= ~C_1_pc~0 1)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse6 (not (<= ~max_loop~0 ~i~0))) (.cse7 (<= ~num~0 |ULTIMATE.start_write_data_~i___0#1|)) (.cse8 (<= ~num~0 1)) (.cse16 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= 2 ~C_1_pc~0) .cse3 (= ~P_1_pc~0 1) .cse4 .cse5 .cse6 (<= ~max_loop~0 2) .cse7 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse11 .cse6 (or (and .cse0 .cse12 .cse4 .cse5 .cse13 (<= ~i~0 1) .cse14 .cse15 .cse16 .cse10) (and .cse0 .cse2 .cse12 .cse4 .cse5 .cse15 .cse16 .cse10)) .cse7 .cse9) (and .cse12 .cse3 (= ~i~0 0) .cse4 .cse5 .cse13 (= ~max_loop~0 2) .cse7 .cse14 (= ~C_1_pc~0 0) .cse15 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 (<= 1 ~num~0) .cse9 .cse10)))) [2022-11-18 20:44:07,177 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-18 20:44:07,177 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-18 20:44:07,178 INFO L895 garLoopResultBuilder]: At program point L496(lines 489 498) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2022-11-18 20:44:07,178 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-11-18 20:44:07,178 INFO L895 garLoopResultBuilder]: At program point L51(lines 36 53) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 0 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483646) .cse3 .cse4 .cse5) (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))))) [2022-11-18 20:44:07,178 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2022-11-18 20:44:07,178 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-11-18 20:44:07,179 INFO L895 garLoopResultBuilder]: At program point L365-1(lines 356 373) the Hoare annotation is: (let ((.cse20 (= ~P_1_st~0 0)) (.cse18 (= ~C_1_st~0 0)) (.cse22 (<= ~max_loop~0 ~i~0))) (let ((.cse15 (<= ~num~0 1)) (.cse17 (= 2 ~C_1_pc~0)) (.cse19 (= ~P_1_pc~0 1)) (.cse21 (<= 0 ~num~0)) (.cse5 (<= 1 ~i~0)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse8 (= ~C_1_pc~0 1)) (.cse14 (not .cse22)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse18)) (.cse16 (<= 1 ~num~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse15 .cse3 .cse16 .cse11) (and .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse9 .cse20 (<= ~max_loop~0 2) .cse15 .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse9 .cse20 .cse22 (<= ~num~0 2147483646) .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (<= ~num~0 2147483647) .cse10 .cse3 .cse16 .cse11) (and .cse13 .cse9 .cse12 .cse3 .cse16 .cse4) (and .cse12 .cse1 .cse3 .cse16 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-18 20:44:07,179 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-18 20:44:07,179 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-18 20:44:07,179 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-18 20:44:07,183 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:44:07,186 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:44:07,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:44:07 BoogieIcfgContainer [2022-11-18 20:44:07,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:44:07,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:44:07,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:44:07,285 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:44:07,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:42:26" (3/4) ... [2022-11-18 20:44:07,289 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:44:07,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-18 20:44:07,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-18 20:44:07,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-18 20:44:07,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-18 20:44:07,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-18 20:44:07,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-18 20:44:07,303 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-18 20:44:07,303 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-18 20:44:07,304 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:44:07,304 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:44:07,330 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) && ((((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(P_1_pc == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num)) [2022-11-18 20:44:07,330 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((!(C_1_pc <= 1) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && (((((!(C_1_pc == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) [2022-11-18 20:44:07,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1)) && ((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((!(C_1_pc <= 1) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || (((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && (((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(C_1_i == 1)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((!(C_1_pc == 0) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) [2022-11-18 20:44:07,332 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((!(C_1_pc == 0) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((((!(2 <= C_1_ev) || (((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((!(C_1_i == 1) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((!(C_1_pc <= 1) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) [2022-11-18 20:44:07,366 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:44:07,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:44:07,367 INFO L158 Benchmark]: Toolchain (without parser) took 102110.07ms. Allocated memory was 134.2MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 102.8MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-18 20:44:07,367 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:44:07,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 107.8MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:44:07,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.55ms. Allocated memory is still 134.2MB. Free memory was 107.8MB in the beginning and 105.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:44:07,368 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:44:07,368 INFO L158 Benchmark]: RCFGBuilder took 707.35ms. Allocated memory is still 134.2MB. Free memory was 104.0MB in the beginning and 85.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:44:07,368 INFO L158 Benchmark]: TraceAbstraction took 100843.80ms. Allocated memory was 134.2MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 84.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-11-18 20:44:07,368 INFO L158 Benchmark]: Witness Printer took 81.39ms. Allocated memory is still 5.0GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:44:07,370 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.32ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 107.8MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.55ms. Allocated memory is still 134.2MB. Free memory was 107.8MB in the beginning and 105.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 104.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.35ms. Allocated memory is still 134.2MB. Free memory was 104.0MB in the beginning and 85.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 100843.80ms. Allocated memory was 134.2MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 84.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 81.39ms. Allocated memory is still 5.0GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 100.7s, OverallIterations: 37, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7225 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7043 mSDsluCounter, 17256 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10124 mSDsCounter, 968 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3627 IncrementalHoareTripleChecker+Invalid, 4595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 968 mSolverCounterUnsat, 7132 mSDtfsCounter, 3627 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6556 GetRequests, 6331 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13136occurred in iteration=24, InterpolantAutomatonStates: 216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 10238 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 21337 PreInvPairs, 22768 NumberOfFragments, 14160 HoareAnnotationTreeSize, 21337 FomulaSimplifications, 178486 FormulaSimplificationTreeSizeReduction, 8.6s HoareSimplificationTime, 45 FomulaSimplificationsInter, 125952 FormulaSimplificationTreeSizeReductionInter, 40.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 11733 NumberOfCodeBlocks, 11733 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 12102 ConstructedInterpolants, 0 QuantifiedInterpolants, 19628 SizeOfPredicates, 9 NumberOfNonLiveVariables, 12175 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 58 InterpolantComputations, 35 PerfectInterpolantSequences, 22254/22787 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((1 <= i && 2 <= P_1_ev) && 1 <= tmp___2) && (((((e <= 0 && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((e <= 0 && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)))))) && C_1_i == 1)) || (((((((((((C_1_st == 0 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: P_1_pc == 0 || 1 <= P_1_pc - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1)) && ((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((!(C_1_pc <= 1) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || (((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && (((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(C_1_i == 1)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((!(C_1_pc == 0) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) || ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((!(C_1_pc <= 1) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && (((((!(C_1_pc == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)))) && !(max_loop <= i)) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((!(C_1_pc == 0) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((((!(2 <= C_1_ev) || (((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((!(C_1_i == 1) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((!(C_1_pc <= 1) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) && ((((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(P_1_pc == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num)) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: P_1_pc == 0 || 1 <= P_1_pc - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)))) && !(max_loop <= i)) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0)) || ((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((((C_1_st == 0 && P_1_pc == 1) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((C_1_pc == 1 && !(max_loop <= i)) && ((((((((((1 <= i && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && 1 <= num) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(C_1_i == 1)) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(C_1_st == 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(P_1_st == 0)) || !(i == 0)) && ((((((((((((1 <= __retres1 || !(num <= 1)) || !(C_1_i == 1)) || !(C_1_pc == 0)) || P_1_st == 0) || !(P_1_pc == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_ev <= 0)) || !(C_1_st == 0)) || !(1 <= num)) || !(C_1_ev <= 0)) || !(i == 0))) && (((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0))) && ((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= 2)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) || !(P_1_st == 0))) && ((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) || !(P_1_st == 0))) && ((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || max_loop <= i) || !(e <= 0)) || !(1 <= num)) || !(1 <= P_1_pc)) || !(P_1_st == 0))) && (((((((((((1 <= __retres1 || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(C_1_pc == 1)) || !(i <= 1)) || !(e <= 0)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(P_1_st == 0))) && (((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || P_1_st == 0) || !(max_loop <= 2)) || max_loop <= i) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) || !(1 <= num))) && (((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(num <= 2147483646)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_st == 0)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= i___0) && num <= 1) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((C_1_pc == 1 && !(max_loop <= i)) && ((((((((((1 <= i && (P_1_pc == 0 || 1 <= P_1_pc)) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && (P_1_pc == 0 || 1 <= P_1_pc)) && e <= 0) && 1 <= tmp___2) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)))) && num <= i___0) && C_1_i == 1)) || (((((((((((((P_1_pc == 0 || 1 <= P_1_pc) && C_1_st == 0) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && num <= i___0) && C_1_ev <= 0) && C_1_pc == 0) && num == 0) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && (P_1_pc == 0 || 1 <= P_1_pc)) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && num <= i___0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && C_1_ev == 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && C_1_ev == 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && P_1_ev == 1) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && P_1_ev == 1) && max_loop <= 2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((P_1_pc == 1 && max_loop <= 2) && (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && 1 <= tmp___2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || (((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((i == 0 && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((((i == 0 && e <= 0) && P_1_ev <= 0) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_st == 0) && max_loop <= 2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((((((((i == 0 && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)))) && !(max_loop <= i)) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((((C_1_st == 0 && P_1_pc == 1) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && max_loop <= i) && num <= 2147483646) && 0 <= num) && C_1_i == 1)) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && max_loop <= i) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0)))) && !(max_loop <= i)) && C_1_i == 1)) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0))) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483646) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) || ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_st == 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1 RESULT: Ultimate proved your program to be correct! [2022-11-18 20:44:07,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65499ab-1174-4eac-aa8a-cf45dad64aa7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE