./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 10:30:41,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:41,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:41,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:41,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:41,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:41,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:41,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:41,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:41,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:41,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:41,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:41,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:41,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:41,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:41,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:41,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:41,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:41,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:41,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:41,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:41,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:41,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:41,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:41,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:41,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:41,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:41,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:41,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:41,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:41,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:41,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:41,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:41,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:41,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:41,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:41,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:41,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:41,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:41,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:41,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:41,896 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:30:41,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:41,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:41,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:41,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:41,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:41,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:41,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:41,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:41,942 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:41,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:41,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:41,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:30:41,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:41,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:41,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:41,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:41,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:41,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:41,945 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:30:41,945 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:41,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:41,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:41,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:41,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:41,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:41,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:41,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:41,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:41,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:41,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:41,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:41,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:41,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:41,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:41,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:41,950 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_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/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_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN 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-20 10:30:42,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:42,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:42,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:42,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:42,309 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:42,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-20 10:30:45,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:45,520 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:45,520 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-20 10:30:45,540 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/data/eb25ca363/5dfe79d8215e46a2a58493aa3266e74f/FLAGd6c51e225 [2022-11-20 10:30:45,554 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/data/eb25ca363/5dfe79d8215e46a2a58493aa3266e74f [2022-11-20 10:30:45,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:45,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:45,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:45,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:45,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:45,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:45,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f567b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45, skipping insertion in model container [2022-11-20 10:30:45,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:45,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:45,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:45,752 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-20 10:30:45,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:45,849 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:45,863 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-20 10:30:45,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:45,937 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:45,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45 WrapperNode [2022-11-20 10:30:45,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:45,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:45,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:45,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:45,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:45,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,008 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-11-20 10:30:46,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:46,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:46,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:46,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:46,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:46,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:46,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:46,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:46,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (1/1) ... [2022-11-20 10:30:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:46,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:46,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 10:30:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 10:30:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 10:30:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 10:30:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 10:30:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 10:30:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 10:30:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 10:30:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 10:30:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 10:30:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 10:30:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 10:30:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:46,277 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:46,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:46,624 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:46,644 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:46,649 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:30:46,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:46 BoogieIcfgContainer [2022-11-20 10:30:46,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:46,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:46,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:46,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:46,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:45" (1/3) ... [2022-11-20 10:30:46,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57472d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:46, skipping insertion in model container [2022-11-20 10:30:46,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:45" (2/3) ... [2022-11-20 10:30:46,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57472d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:46, skipping insertion in model container [2022-11-20 10:30:46,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:46" (3/3) ... [2022-11-20 10:30:46,668 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-11-20 10:30:46,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:46,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-20 10:30:46,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:46,759 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;@4c96edc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:46,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 10:30:46,764 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-20 10:30:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:30:46,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:46,799 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-20 10:30:46,800 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-20 10:30:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1283588667, now seen corresponding path program 1 times [2022-11-20 10:30:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:46,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161813331] [2022-11-20 10:30:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:30:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,215 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-20 10:30:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:47,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161813331] [2022-11-20 10:30:47,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161813331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:47,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:47,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:30:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361174936] [2022-11-20 10:30:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:47,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:47,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:47,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:47,252 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-20 10:30:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:47,617 INFO L93 Difference]: Finished difference Result 359 states and 511 transitions. [2022-11-20 10:30:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:47,625 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-20 10:30:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:47,635 INFO L225 Difference]: With dead ends: 359 [2022-11-20 10:30:47,636 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 10:30:47,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:47,648 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:47,649 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.2s Time] [2022-11-20 10:30:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 10:30:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2022-11-20 10:30:47,709 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-20 10:30:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2022-11-20 10:30:47,714 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2022-11-20 10:30:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:47,714 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2022-11-20 10:30:47,714 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-20 10:30:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2022-11-20 10:30:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:30:47,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:47,717 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-20 10:30:47,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:47,717 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-20 10:30:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1434820870, now seen corresponding path program 1 times [2022-11-20 10:30:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:47,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978991104] [2022-11-20 10:30:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:30:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,942 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-20 10:30:47,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:47,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978991104] [2022-11-20 10:30:47,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978991104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:47,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:47,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:47,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384041819] [2022-11-20 10:30:47,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:47,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:47,946 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-20 10:30:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:48,227 INFO L93 Difference]: Finished difference Result 411 states and 568 transitions. [2022-11-20 10:30:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:48,228 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-20 10:30:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:48,233 INFO L225 Difference]: With dead ends: 411 [2022-11-20 10:30:48,234 INFO L226 Difference]: Without dead ends: 226 [2022-11-20 10:30:48,236 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-20 10:30:48,242 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-20 10:30:48,243 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-20 10:30:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-20 10:30:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2022-11-20 10:30:48,271 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-20 10:30:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2022-11-20 10:30:48,274 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2022-11-20 10:30:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:48,274 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2022-11-20 10:30:48,275 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-20 10:30:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2022-11-20 10:30:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:30:48,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:48,277 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-20 10:30:48,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:48,277 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-20 10:30:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1473943032, now seen corresponding path program 1 times [2022-11-20 10:30:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:48,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118162358] [2022-11-20 10:30:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:30:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,436 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-20 10:30:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:48,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118162358] [2022-11-20 10:30:48,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118162358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:48,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:48,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075729263] [2022-11-20 10:30:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:48,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:48,439 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-20 10:30:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:49,016 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2022-11-20 10:30:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:49,017 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-20 10:30:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:49,021 INFO L225 Difference]: With dead ends: 784 [2022-11-20 10:30:49,022 INFO L226 Difference]: Without dead ends: 596 [2022-11-20 10:30:49,023 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-20 10:30:49,024 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 515 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-20 10:30:49,025 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-20 10:30:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-20 10:30:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2022-11-20 10:30:49,107 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-20 10:30:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2022-11-20 10:30:49,114 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2022-11-20 10:30:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:49,114 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2022-11-20 10:30:49,115 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-20 10:30:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2022-11-20 10:30:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:30:49,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:49,122 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-20 10:30:49,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:30:49,123 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-20 10:30:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -24370336, now seen corresponding path program 1 times [2022-11-20 10:30:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:49,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136973804] [2022-11-20 10:30:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,226 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-20 10:30:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136973804] [2022-11-20 10:30:49,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136973804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:49,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:49,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:30:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033133445] [2022-11-20 10:30:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:49,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:49,230 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-20 10:30:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:49,616 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2022-11-20 10:30:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:49,616 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-20 10:30:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:49,627 INFO L225 Difference]: With dead ends: 1262 [2022-11-20 10:30:49,628 INFO L226 Difference]: Without dead ends: 919 [2022-11-20 10:30:49,630 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-20 10:30:49,641 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-20 10:30:49,643 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-20 10:30:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-11-20 10:30:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2022-11-20 10:30:49,766 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-20 10:30:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2022-11-20 10:30:49,772 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2022-11-20 10:30:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:49,774 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2022-11-20 10:30:49,779 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-20 10:30:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2022-11-20 10:30:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:30:49,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:49,782 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-20 10:30:49,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:30:49,782 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-20 10:30:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash -332809345, now seen corresponding path program 1 times [2022-11-20 10:30:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:49,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598075041] [2022-11-20 10:30:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,973 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-20 10:30:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:49,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598075041] [2022-11-20 10:30:49,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598075041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:49,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:49,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72635056] [2022-11-20 10:30:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:49,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:49,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:49,976 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-20 10:30:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:50,301 INFO L93 Difference]: Finished difference Result 1635 states and 2234 transitions. [2022-11-20 10:30:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:30:50,302 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-20 10:30:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:50,307 INFO L225 Difference]: With dead ends: 1635 [2022-11-20 10:30:50,307 INFO L226 Difference]: Without dead ends: 863 [2022-11-20 10:30:50,310 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-20 10:30:50,313 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-20 10:30:50,314 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-20 10:30:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-20 10:30:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 800. [2022-11-20 10:30:50,414 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-20 10:30:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2022-11-20 10:30:50,420 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2022-11-20 10:30:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:50,421 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2022-11-20 10:30:50,421 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-20 10:30:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2022-11-20 10:30:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:30:50,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:50,423 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-20 10:30:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:50,424 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-20 10:30:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -466822851, now seen corresponding path program 1 times [2022-11-20 10:30:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464357491] [2022-11-20 10:30:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,569 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-20 10:30:50,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:50,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464357491] [2022-11-20 10:30:50,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464357491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:50,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:30:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431294077] [2022-11-20 10:30:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:50,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:50,573 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-20 10:30:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:50,899 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2022-11-20 10:30:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:50,899 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-20 10:30:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:50,908 INFO L225 Difference]: With dead ends: 2356 [2022-11-20 10:30:50,908 INFO L226 Difference]: Without dead ends: 1567 [2022-11-20 10:30:50,910 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-20 10:30:50,912 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-20 10:30:50,913 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-20 10:30:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-11-20 10:30:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2022-11-20 10:30:51,064 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-20 10:30:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2022-11-20 10:30:51,072 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2022-11-20 10:30:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:51,073 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2022-11-20 10:30:51,073 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-20 10:30:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2022-11-20 10:30:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:30:51,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:51,074 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-20 10:30:51,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:30:51,074 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-20 10:30:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1537614413, now seen corresponding path program 1 times [2022-11-20 10:30:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:51,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812730101] [2022-11-20 10:30:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,134 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-20 10:30:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812730101] [2022-11-20 10:30:51,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812730101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:51,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:51,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732203213] [2022-11-20 10:30:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:51,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:51,139 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-20 10:30:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:51,542 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2022-11-20 10:30:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:51,543 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-20 10:30:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:51,561 INFO L225 Difference]: With dead ends: 4093 [2022-11-20 10:30:51,561 INFO L226 Difference]: Without dead ends: 2700 [2022-11-20 10:30:51,588 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-20 10:30:51,589 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-20 10:30:51,589 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-20 10:30:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-11-20 10:30:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2022-11-20 10:30:51,814 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-20 10:30:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2022-11-20 10:30:51,857 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2022-11-20 10:30:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:51,858 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2022-11-20 10:30:51,858 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-20 10:30:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2022-11-20 10:30:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:30:51,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:51,859 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-20 10:30:51,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:30:51,860 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-20 10:30:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -663779837, now seen corresponding path program 1 times [2022-11-20 10:30:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712183743] [2022-11-20 10:30:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,961 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-20 10:30:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:51,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712183743] [2022-11-20 10:30:51,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712183743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:51,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611145329] [2022-11-20 10:30:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:51,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:51,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:51,964 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-20 10:30:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:52,350 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2022-11-20 10:30:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:52,351 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-20 10:30:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:52,364 INFO L225 Difference]: With dead ends: 3062 [2022-11-20 10:30:52,364 INFO L226 Difference]: Without dead ends: 3058 [2022-11-20 10:30:52,365 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-20 10:30:52,367 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-20 10:30:52,367 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-20 10:30:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2022-11-20 10:30:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2022-11-20 10:30:52,626 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-20 10:30:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2022-11-20 10:30:52,641 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2022-11-20 10:30:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:52,641 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2022-11-20 10:30:52,642 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-20 10:30:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2022-11-20 10:30:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:30:52,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:52,643 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-20 10:30:52,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:30:52,643 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-20 10:30:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash -472171120, now seen corresponding path program 1 times [2022-11-20 10:30:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:52,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662730081] [2022-11-20 10:30:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:52,727 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-20 10:30:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:52,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662730081] [2022-11-20 10:30:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662730081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:52,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:52,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:30:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875612139] [2022-11-20 10:30:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:52,730 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-20 10:30:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:53,273 INFO L93 Difference]: Finished difference Result 4382 states and 5803 transitions. [2022-11-20 10:30:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:53,274 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-20 10:30:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:53,293 INFO L225 Difference]: With dead ends: 4382 [2022-11-20 10:30:53,293 INFO L226 Difference]: Without dead ends: 4380 [2022-11-20 10:30:53,295 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-20 10:30:53,296 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-20 10:30:53,296 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-20 10:30:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2022-11-20 10:30:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4203. [2022-11-20 10:30:53,683 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-20 10:30:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 5490 transitions. [2022-11-20 10:30:53,698 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 5490 transitions. Word has length 59 [2022-11-20 10:30:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:53,698 INFO L495 AbstractCegarLoop]: Abstraction has 4203 states and 5490 transitions. [2022-11-20 10:30:53,699 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-20 10:30:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 5490 transitions. [2022-11-20 10:30:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 10:30:53,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:53,700 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-20 10:30:53,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:30:53,701 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-20 10:30:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1752402570, now seen corresponding path program 1 times [2022-11-20 10:30:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:53,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128853745] [2022-11-20 10:30:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,770 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-20 10:30:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:53,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128853745] [2022-11-20 10:30:53,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128853745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:53,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:53,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:30:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214352818] [2022-11-20 10:30:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:53,773 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-20 10:30:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:54,350 INFO L93 Difference]: Finished difference Result 7863 states and 10400 transitions. [2022-11-20 10:30:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:54,351 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-20 10:30:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:54,373 INFO L225 Difference]: With dead ends: 7863 [2022-11-20 10:30:54,374 INFO L226 Difference]: Without dead ends: 5045 [2022-11-20 10:30:54,383 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-20 10:30:54,384 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-20 10:30:54,427 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-20 10:30:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2022-11-20 10:30:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4828. [2022-11-20 10:30:54,832 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-20 10:30:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6285 transitions. [2022-11-20 10:30:54,848 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6285 transitions. Word has length 60 [2022-11-20 10:30:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:54,849 INFO L495 AbstractCegarLoop]: Abstraction has 4828 states and 6285 transitions. [2022-11-20 10:30:54,849 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-20 10:30:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6285 transitions. [2022-11-20 10:30:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 10:30:54,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:54,850 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-20 10:30:54,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:30:54,851 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-20 10:30:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2044119821, now seen corresponding path program 1 times [2022-11-20 10:30:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:54,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929873126] [2022-11-20 10:30:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:30:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,931 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-20 10:30:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:54,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929873126] [2022-11-20 10:30:54,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929873126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:54,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:54,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:30:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086262955] [2022-11-20 10:30:54,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:54,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:54,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:54,934 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-20 10:30:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:56,105 INFO L93 Difference]: Finished difference Result 13334 states and 17742 transitions. [2022-11-20 10:30:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:56,106 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-20 10:30:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:56,153 INFO L225 Difference]: With dead ends: 13334 [2022-11-20 10:30:56,154 INFO L226 Difference]: Without dead ends: 8522 [2022-11-20 10:30:56,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:56,166 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 455 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:56,166 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.2s Time] [2022-11-20 10:30:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2022-11-20 10:30:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 8240. [2022-11-20 10:30:56,890 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-20 10:30:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 10936 transitions. [2022-11-20 10:30:56,921 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 10936 transitions. Word has length 70 [2022-11-20 10:30:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:56,921 INFO L495 AbstractCegarLoop]: Abstraction has 8240 states and 10936 transitions. [2022-11-20 10:30:56,922 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-20 10:30:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 10936 transitions. [2022-11-20 10:30:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-20 10:30:56,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:56,930 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-20 10:30:56,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:30:56,931 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-20 10:30:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1887373238, now seen corresponding path program 1 times [2022-11-20 10:30:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:56,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780691166] [2022-11-20 10:30:56,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:30:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,028 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-20 10:30:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:57,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780691166] [2022-11-20 10:30:57,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780691166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:57,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:57,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851653818] [2022-11-20 10:30:57,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:57,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:57,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:57,031 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-20 10:30:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:58,044 INFO L93 Difference]: Finished difference Result 16595 states and 22008 transitions. [2022-11-20 10:30:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:58,044 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-20 10:30:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:58,075 INFO L225 Difference]: With dead ends: 16595 [2022-11-20 10:30:58,076 INFO L226 Difference]: Without dead ends: 7948 [2022-11-20 10:30:58,098 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-20 10:30:58,099 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-20 10:30:58,100 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-20 10:30:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2022-11-20 10:30:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 7720. [2022-11-20 10:30:59,033 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-20 10:30:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 10010 transitions. [2022-11-20 10:30:59,073 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 10010 transitions. Word has length 81 [2022-11-20 10:30:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:59,073 INFO L495 AbstractCegarLoop]: Abstraction has 7720 states and 10010 transitions. [2022-11-20 10:30:59,073 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-20 10:30:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 10010 transitions. [2022-11-20 10:30:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-20 10:30:59,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:59,084 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-20 10:30:59,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:30:59,085 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-20 10:30:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 398620961, now seen corresponding path program 1 times [2022-11-20 10:30:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:59,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605346178] [2022-11-20 10:30:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:59,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:30:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:30:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:30:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:30:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:30:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:30:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:30:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:30:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 10:30:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:30:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:30:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:30:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,304 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-20 10:30:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:59,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605346178] [2022-11-20 10:30:59,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605346178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:59,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93476419] [2022-11-20 10:30:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:59,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:59,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:59,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:30:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:59,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:30:59,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:59,634 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-20 10:30:59,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:59,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93476419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:59,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:59,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-20 10:30:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401061285] [2022-11-20 10:30:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:59,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:59,637 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-20 10:31:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:00,274 INFO L93 Difference]: Finished difference Result 12037 states and 15722 transitions. [2022-11-20 10:31:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:00,275 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-20 10:31:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:00,293 INFO L225 Difference]: With dead ends: 12037 [2022-11-20 10:31:00,293 INFO L226 Difference]: Without dead ends: 5588 [2022-11-20 10:31:00,308 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-20 10:31:00,308 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-20 10:31:00,309 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-20 10:31:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2022-11-20 10:31:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5588. [2022-11-20 10:31:00,755 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-20 10:31:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 7133 transitions. [2022-11-20 10:31:00,777 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 7133 transitions. Word has length 127 [2022-11-20 10:31:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:00,777 INFO L495 AbstractCegarLoop]: Abstraction has 5588 states and 7133 transitions. [2022-11-20 10:31:00,777 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-20 10:31:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 7133 transitions. [2022-11-20 10:31:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 10:31:00,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:00,784 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-20 10:31:00,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:00,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:00,990 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-20 10:31:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1617965029, now seen corresponding path program 1 times [2022-11-20 10:31:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:00,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544592241] [2022-11-20 10:31:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:31:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:31:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:31:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 10:31:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,141 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-20 10:31:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544592241] [2022-11-20 10:31:01,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544592241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496145365] [2022-11-20 10:31:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:01,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:01,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:31:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:01,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:01,395 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-20 10:31:01,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:01,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496145365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:01,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:01,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-20 10:31:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517154287] [2022-11-20 10:31:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:01,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:01,397 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-20 10:31:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:01,996 INFO L93 Difference]: Finished difference Result 12744 states and 16168 transitions. [2022-11-20 10:31:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:01,996 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-20 10:31:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:02,025 INFO L225 Difference]: With dead ends: 12744 [2022-11-20 10:31:02,025 INFO L226 Difference]: Without dead ends: 8427 [2022-11-20 10:31:02,038 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-20 10:31:02,038 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-20 10:31:02,039 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-20 10:31:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2022-11-20 10:31:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 8424. [2022-11-20 10:31:02,758 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-20 10:31:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 10451 transitions. [2022-11-20 10:31:02,783 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 10451 transitions. Word has length 130 [2022-11-20 10:31:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:02,784 INFO L495 AbstractCegarLoop]: Abstraction has 8424 states and 10451 transitions. [2022-11-20 10:31:02,784 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-20 10:31:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 10451 transitions. [2022-11-20 10:31:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-20 10:31:02,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:02,791 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-20 10:31:02,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:31:02,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:31:02,996 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-20 10:31:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -593042927, now seen corresponding path program 1 times [2022-11-20 10:31:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864801333] [2022-11-20 10:31:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:31:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:31:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:31:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 10:31:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:31:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,162 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-20 10:31:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864801333] [2022-11-20 10:31:03,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864801333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225741155] [2022-11-20 10:31:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:03,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:03,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:31:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:03,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:03,400 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-20 10:31:03,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:03,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225741155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:03,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:03,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-20 10:31:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942454931] [2022-11-20 10:31:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:03,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:03,403 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-20 10:31:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:03,894 INFO L93 Difference]: Finished difference Result 13897 states and 17415 transitions. [2022-11-20 10:31:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:03,895 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-20 10:31:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:03,917 INFO L225 Difference]: With dead ends: 13897 [2022-11-20 10:31:03,918 INFO L226 Difference]: Without dead ends: 6509 [2022-11-20 10:31:03,939 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-20 10:31:03,940 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-20 10:31:03,941 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-20 10:31:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2022-11-20 10:31:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 6509. [2022-11-20 10:31:04,688 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-20 10:31:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8186 transitions. [2022-11-20 10:31:04,718 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8186 transitions. Word has length 140 [2022-11-20 10:31:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:04,719 INFO L495 AbstractCegarLoop]: Abstraction has 6509 states and 8186 transitions. [2022-11-20 10:31:04,719 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-20 10:31:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8186 transitions. [2022-11-20 10:31:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-20 10:31:04,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:04,729 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-20 10:31:04,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:04,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:31:04,934 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-20 10:31:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 646813658, now seen corresponding path program 1 times [2022-11-20 10:31:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:04,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287270292] [2022-11-20 10:31:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:31:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:31:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:31:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 10:31:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 10:31:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,110 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-20 10:31:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287270292] [2022-11-20 10:31:05,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287270292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155179586] [2022-11-20 10:31:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:05,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:05,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:31:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:05,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:05,312 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-20 10:31:05,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155179586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:05,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:05,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 10:31:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255205325] [2022-11-20 10:31:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:05,315 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-20 10:31:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:05,798 INFO L93 Difference]: Finished difference Result 8732 states and 11095 transitions. [2022-11-20 10:31:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:05,798 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-20 10:31:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:05,813 INFO L225 Difference]: With dead ends: 8732 [2022-11-20 10:31:05,813 INFO L226 Difference]: Without dead ends: 3717 [2022-11-20 10:31:05,825 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-20 10:31:05,826 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-20 10:31:05,827 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-20 10:31:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-11-20 10:31:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3714. [2022-11-20 10:31:06,246 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-20 10:31:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4560 transitions. [2022-11-20 10:31:06,262 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4560 transitions. Word has length 151 [2022-11-20 10:31:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:06,263 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 4560 transitions. [2022-11-20 10:31:06,263 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-20 10:31:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4560 transitions. [2022-11-20 10:31:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-20 10:31:06,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:06,271 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-20 10:31:06,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:31:06,477 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-20 10:31:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1912398517, now seen corresponding path program 1 times [2022-11-20 10:31:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:06,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636074063] [2022-11-20 10:31:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:31:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:31:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:31:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 10:31:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:31:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:31:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,674 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-20 10:31:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:06,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636074063] [2022-11-20 10:31:06,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636074063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:06,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813293426] [2022-11-20 10:31:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:06,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:06,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:06,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:31:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:06,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:06,821 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-20 10:31:06,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813293426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 10:31:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341256291] [2022-11-20 10:31:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:06,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:06,824 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-20 10:31:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:07,251 INFO L93 Difference]: Finished difference Result 8894 states and 10980 transitions. [2022-11-20 10:31:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:07,251 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-20 10:31:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:07,268 INFO L225 Difference]: With dead ends: 8894 [2022-11-20 10:31:07,268 INFO L226 Difference]: Without dead ends: 5730 [2022-11-20 10:31:07,275 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-20 10:31:07,276 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-20 10:31:07,276 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-20 10:31:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2022-11-20 10:31:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5720. [2022-11-20 10:31:07,632 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-20 10:31:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 6929 transitions. [2022-11-20 10:31:07,648 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 6929 transitions. Word has length 163 [2022-11-20 10:31:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:07,648 INFO L495 AbstractCegarLoop]: Abstraction has 5720 states and 6929 transitions. [2022-11-20 10:31:07,649 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-20 10:31:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 6929 transitions. [2022-11-20 10:31:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-20 10:31:07,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:07,655 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-20 10:31:07,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:07,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:31:07,860 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-20 10:31:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1664252023, now seen corresponding path program 1 times [2022-11-20 10:31:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:07,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161036956] [2022-11-20 10:31:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:31:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:31:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:31:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 10:31:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:31:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:31:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,011 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-20 10:31:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:08,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161036956] [2022-11-20 10:31:08,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161036956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:08,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361338797] [2022-11-20 10:31:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:08,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:08,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:31:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:31:08,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:08,184 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-20 10:31:08,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:08,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361338797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:08,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:08,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-11-20 10:31:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276876421] [2022-11-20 10:31:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:08,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:31:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:31:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:31:08,187 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-20 10:31:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:08,587 INFO L93 Difference]: Finished difference Result 9242 states and 11245 transitions. [2022-11-20 10:31:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:08,588 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-20 10:31:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:08,601 INFO L225 Difference]: With dead ends: 9242 [2022-11-20 10:31:08,601 INFO L226 Difference]: Without dead ends: 3537 [2022-11-20 10:31:08,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:31:08,612 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-20 10:31:08,613 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-20 10:31:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-11-20 10:31:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3357. [2022-11-20 10:31:09,003 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-20 10:31:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4060 transitions. [2022-11-20 10:31:09,040 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4060 transitions. Word has length 163 [2022-11-20 10:31:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:09,041 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4060 transitions. [2022-11-20 10:31:09,041 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-20 10:31:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4060 transitions. [2022-11-20 10:31:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-20 10:31:09,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:09,046 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-20 10:31:09,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:09,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:09,251 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-20 10:31:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1733832050, now seen corresponding path program 1 times [2022-11-20 10:31:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653200243] [2022-11-20 10:31:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:31:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:31:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:31:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 10:31:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,350 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-20 10:31:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:09,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653200243] [2022-11-20 10:31:09,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653200243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:09,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72429327] [2022-11-20 10:31:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:09,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:09,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:31:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:09,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:09,639 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-20 10:31:09,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:09,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72429327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:09,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:09,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-20 10:31:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443848566] [2022-11-20 10:31:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:09,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:09,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:09,644 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-20 10:31:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:09,896 INFO L93 Difference]: Finished difference Result 3357 states and 4060 transitions. [2022-11-20 10:31:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:09,897 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-20 10:31:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:09,906 INFO L225 Difference]: With dead ends: 3357 [2022-11-20 10:31:09,906 INFO L226 Difference]: Without dead ends: 3355 [2022-11-20 10:31:09,908 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-20 10:31:09,909 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-20 10:31:09,909 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-20 10:31:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-11-20 10:31:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2022-11-20 10:31:10,185 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-20 10:31:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4042 transitions. [2022-11-20 10:31:10,193 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4042 transitions. Word has length 169 [2022-11-20 10:31:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:10,194 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4042 transitions. [2022-11-20 10:31:10,194 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-20 10:31:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4042 transitions. [2022-11-20 10:31:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-20 10:31:10,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:10,198 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-20 10:31:10,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:10,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:10,410 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-20 10:31:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1404056422, now seen corresponding path program 1 times [2022-11-20 10:31:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:10,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497944905] [2022-11-20 10:31:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:31:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:31:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:31:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 10:31:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,515 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-20 10:31:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:10,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497944905] [2022-11-20 10:31:10,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497944905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:10,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845939716] [2022-11-20 10:31:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:10,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:10,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:31:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:10,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:10,678 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-20 10:31:10,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:10,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845939716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:10,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:10,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-20 10:31:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269006345] [2022-11-20 10:31:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:10,681 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-20 10:31:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:10,920 INFO L93 Difference]: Finished difference Result 5963 states and 7299 transitions. [2022-11-20 10:31:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:10,921 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-20 10:31:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:10,930 INFO L225 Difference]: With dead ends: 5963 [2022-11-20 10:31:10,930 INFO L226 Difference]: Without dead ends: 3276 [2022-11-20 10:31:10,935 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-20 10:31:10,936 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-20 10:31:10,936 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-20 10:31:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-11-20 10:31:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3275. [2022-11-20 10:31:11,174 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-20 10:31:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3920 transitions. [2022-11-20 10:31:11,183 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3920 transitions. Word has length 169 [2022-11-20 10:31:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:11,184 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 3920 transitions. [2022-11-20 10:31:11,184 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-20 10:31:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3920 transitions. [2022-11-20 10:31:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-20 10:31:11,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:11,188 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-20 10:31:11,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:11,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:11,393 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-20 10:31:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1943202269, now seen corresponding path program 1 times [2022-11-20 10:31:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085473268] [2022-11-20 10:31:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,517 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-20 10:31:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085473268] [2022-11-20 10:31:11,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085473268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:11,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658873559] [2022-11-20 10:31:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:11,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:11,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:31:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:11,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:11,888 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-20 10:31:11,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:12,086 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-20 10:31:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658873559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:12,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-20 10:31:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175100307] [2022-11-20 10:31:12,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:31:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:31:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:12,089 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-20 10:31:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:13,201 INFO L93 Difference]: Finished difference Result 10587 states and 12830 transitions. [2022-11-20 10:31:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:31:13,202 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-20 10:31:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:13,237 INFO L225 Difference]: With dead ends: 10587 [2022-11-20 10:31:13,237 INFO L226 Difference]: Without dead ends: 10585 [2022-11-20 10:31:13,243 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-20 10:31:13,243 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-20 10:31:13,244 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-20 10:31:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2022-11-20 10:31:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 8578. [2022-11-20 10:31:13,945 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-20 10:31:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 10447 transitions. [2022-11-20 10:31:13,965 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 10447 transitions. Word has length 170 [2022-11-20 10:31:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 8578 states and 10447 transitions. [2022-11-20 10:31:13,966 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-20 10:31:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 10447 transitions. [2022-11-20 10:31:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-20 10:31:13,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:13,970 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-20 10:31:13,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 10:31:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-20 10:31:14,176 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-20 10:31:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash 109728449, now seen corresponding path program 1 times [2022-11-20 10:31:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:14,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062746504] [2022-11-20 10:31:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,325 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-20 10:31:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062746504] [2022-11-20 10:31:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062746504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697468199] [2022-11-20 10:31:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:14,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:14,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:31:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:14,690 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-20 10:31:14,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:14,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697468199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:14,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:14,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 10:31:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408251964] [2022-11-20 10:31:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:14,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:14,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:14,692 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-20 10:31:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:15,280 INFO L93 Difference]: Finished difference Result 8579 states and 10447 transitions. [2022-11-20 10:31:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:31:15,284 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-20 10:31:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:15,314 INFO L225 Difference]: With dead ends: 8579 [2022-11-20 10:31:15,314 INFO L226 Difference]: Without dead ends: 8575 [2022-11-20 10:31:15,319 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-20 10:31:15,321 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-20 10:31:15,321 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-20 10:31:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8575 states. [2022-11-20 10:31:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8575 to 8574. [2022-11-20 10:31:16,040 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-20 10:31:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 10385 transitions. [2022-11-20 10:31:16,064 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 10385 transitions. Word has length 171 [2022-11-20 10:31:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:16,065 INFO L495 AbstractCegarLoop]: Abstraction has 8574 states and 10385 transitions. [2022-11-20 10:31:16,065 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-20 10:31:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 10385 transitions. [2022-11-20 10:31:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-20 10:31:16,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:16,071 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-20 10:31:16,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:16,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 10:31:16,276 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-20 10:31:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1511508257, now seen corresponding path program 1 times [2022-11-20 10:31:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:16,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476711335] [2022-11-20 10:31:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,401 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-20 10:31:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:16,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476711335] [2022-11-20 10:31:16,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476711335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:16,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:16,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787557107] [2022-11-20 10:31:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:16,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:16,404 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-20 10:31:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:17,670 INFO L93 Difference]: Finished difference Result 11115 states and 13509 transitions. [2022-11-20 10:31:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:31:17,670 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-20 10:31:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:17,707 INFO L225 Difference]: With dead ends: 11115 [2022-11-20 10:31:17,707 INFO L226 Difference]: Without dead ends: 11113 [2022-11-20 10:31:17,713 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-20 10:31:17,714 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-20 10:31:17,714 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-20 10:31:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-20 10:31:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 8272. [2022-11-20 10:31:18,573 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-20 10:31:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 9999 transitions. [2022-11-20 10:31:18,594 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 9999 transitions. Word has length 179 [2022-11-20 10:31:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:18,594 INFO L495 AbstractCegarLoop]: Abstraction has 8272 states and 9999 transitions. [2022-11-20 10:31:18,594 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-20 10:31:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 9999 transitions. [2022-11-20 10:31:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-20 10:31:18,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:18,604 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-20 10:31:18,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:31:18,604 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-20 10:31:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1267602057, now seen corresponding path program 1 times [2022-11-20 10:31:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:18,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893824788] [2022-11-20 10:31:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:31:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:31:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:31:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 10:31:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:31:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-20 10:31:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 10:31:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 10:31:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-20 10:31:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-20 10:31:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 10:31:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-20 10:31:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 10:31:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,747 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-20 10:31:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893824788] [2022-11-20 10:31:18,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893824788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927430474] [2022-11-20 10:31:18,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:18,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:18,749 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:18,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:31:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:18,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:18,982 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-20 10:31:18,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927430474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:18,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:18,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:31:18,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819580503] [2022-11-20 10:31:18,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:18,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:18,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:18,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:18,984 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-20 10:31:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:19,790 INFO L93 Difference]: Finished difference Result 21153 states and 25649 transitions. [2022-11-20 10:31:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:19,790 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-20 10:31:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:19,826 INFO L225 Difference]: With dead ends: 21153 [2022-11-20 10:31:19,826 INFO L226 Difference]: Without dead ends: 13251 [2022-11-20 10:31:19,838 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-20 10:31:19,839 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-20 10:31:19,839 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-20 10:31:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states. [2022-11-20 10:31:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 13136. [2022-11-20 10:31:20,744 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-20 10:31:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13136 states to 13136 states and 15814 transitions. [2022-11-20 10:31:20,774 INFO L78 Accepts]: Start accepts. Automaton has 13136 states and 15814 transitions. Word has length 234 [2022-11-20 10:31:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,775 INFO L495 AbstractCegarLoop]: Abstraction has 13136 states and 15814 transitions. [2022-11-20 10:31:20,775 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-20 10:31:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states and 15814 transitions. [2022-11-20 10:31:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-20 10:31:20,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,786 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-20 10:31:20,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:20,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 10:31:20,991 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-20 10:31:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 661330169, now seen corresponding path program 1 times [2022-11-20 10:31:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44415701] [2022-11-20 10:31:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:31:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:31:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:31:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 10:31:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:31:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-20 10:31:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 10:31:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 10:31:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-20 10:31:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-20 10:31:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 10:31:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-20 10:31:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 10:31:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,151 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-20 10:31:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:21,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44415701] [2022-11-20 10:31:21,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44415701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:21,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356265696] [2022-11-20 10:31:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:21,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:21,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:21,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:31:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:21,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:21,321 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-20 10:31:21,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:21,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356265696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:21,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:21,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:31:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322265346] [2022-11-20 10:31:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:21,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:21,325 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-20 10:31:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:21,694 INFO L93 Difference]: Finished difference Result 18416 states and 22222 transitions. [2022-11-20 10:31:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:21,694 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-20 10:31:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:21,711 INFO L225 Difference]: With dead ends: 18416 [2022-11-20 10:31:21,711 INFO L226 Difference]: Without dead ends: 5596 [2022-11-20 10:31:21,728 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-20 10:31:21,729 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-20 10:31:21,729 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-20 10:31:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-11-20 10:31:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5346. [2022-11-20 10:31:22,356 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-20 10:31:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 6351 transitions. [2022-11-20 10:31:22,368 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 6351 transitions. Word has length 234 [2022-11-20 10:31:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:22,368 INFO L495 AbstractCegarLoop]: Abstraction has 5346 states and 6351 transitions. [2022-11-20 10:31:22,368 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-20 10:31:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 6351 transitions. [2022-11-20 10:31:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-20 10:31:22,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:22,375 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-20 10:31:22,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:22,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 10:31:22,580 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-20 10:31:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash -768448019, now seen corresponding path program 1 times [2022-11-20 10:31:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:22,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662610916] [2022-11-20 10:31:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:31:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:31:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:31:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 10:31:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:31:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-20 10:31:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 10:31:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 10:31:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-20 10:31:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 10:31:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 10:31:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-20 10:31:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-20 10:31:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,710 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-20 10:31:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662610916] [2022-11-20 10:31:22,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662610916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:22,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475936782] [2022-11-20 10:31:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:22,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:22,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:31:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:31:22,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:23,100 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-20 10:31:23,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:23,284 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-20 10:31:23,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475936782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:23,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:23,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-20 10:31:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165100648] [2022-11-20 10:31:23,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:23,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:31:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:31:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:23,288 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-20 10:31:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,447 INFO L93 Difference]: Finished difference Result 13328 states and 16430 transitions. [2022-11-20 10:31:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:31:24,448 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-20 10:31:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:24,464 INFO L225 Difference]: With dead ends: 13328 [2022-11-20 10:31:24,464 INFO L226 Difference]: Without dead ends: 8218 [2022-11-20 10:31:24,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 563 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:31:24,472 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 486 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 10:31:24,472 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-20 10:31:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2022-11-20 10:31:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 5323. [2022-11-20 10:31:25,073 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-20 10:31:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 6123 transitions. [2022-11-20 10:31:25,086 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 6123 transitions. Word has length 257 [2022-11-20 10:31:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:25,086 INFO L495 AbstractCegarLoop]: Abstraction has 5323 states and 6123 transitions. [2022-11-20 10:31:25,086 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-20 10:31:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 6123 transitions. [2022-11-20 10:31:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-20 10:31:25,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:25,093 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-20 10:31:25,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:25,298 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-20 10:31:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 234235241, now seen corresponding path program 1 times [2022-11-20 10:31:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522533251] [2022-11-20 10:31:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:31:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:31:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:31:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:31:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 10:31:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:31:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-20 10:31:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-20 10:31:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-20 10:31:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-20 10:31:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-20 10:31:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 10:31:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-20 10:31:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-20 10:31:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,385 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-20 10:31:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522533251] [2022-11-20 10:31:25,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522533251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:25,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:25,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74057161] [2022-11-20 10:31:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:25,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:25,388 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-20 10:31:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,837 INFO L93 Difference]: Finished difference Result 5613 states and 6445 transitions. [2022-11-20 10:31:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:31:25,837 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-20 10:31:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:25,848 INFO L225 Difference]: With dead ends: 5613 [2022-11-20 10:31:25,848 INFO L226 Difference]: Without dead ends: 5330 [2022-11-20 10:31:25,851 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-20 10:31:25,851 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-20 10:31:25,852 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-20 10:31:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2022-11-20 10:31:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 5298. [2022-11-20 10:31:26,327 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-20 10:31:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 6097 transitions. [2022-11-20 10:31:26,334 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 6097 transitions. Word has length 259 [2022-11-20 10:31:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:26,334 INFO L495 AbstractCegarLoop]: Abstraction has 5298 states and 6097 transitions. [2022-11-20 10:31:26,335 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-20 10:31:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 6097 transitions. [2022-11-20 10:31:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-20 10:31:26,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:26,339 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-20 10:31:26,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:31:26,339 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-20 10:31:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash -351463149, now seen corresponding path program 1 times [2022-11-20 10:31:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:26,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068303896] [2022-11-20 10:31:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:31:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:31:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:31:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:31:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 10:31:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:31:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 10:31:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-20 10:31:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-20 10:31:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 10:31:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:31:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-20 10:31:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-20 10:31:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-20 10:31:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 10:31:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-20 10:31:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-20 10:31:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,515 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-20 10:31:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:26,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068303896] [2022-11-20 10:31:26,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068303896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:26,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:26,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459620695] [2022-11-20 10:31:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:26,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:26,518 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-20 10:31:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:26,938 INFO L93 Difference]: Finished difference Result 5331 states and 6137 transitions. [2022-11-20 10:31:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:26,939 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-20 10:31:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:26,946 INFO L225 Difference]: With dead ends: 5331 [2022-11-20 10:31:26,946 INFO L226 Difference]: Without dead ends: 5069 [2022-11-20 10:31:26,948 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-20 10:31:26,948 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-20 10:31:26,948 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-20 10:31:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2022-11-20 10:31:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 5037. [2022-11-20 10:31:27,349 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-20 10:31:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 5809 transitions. [2022-11-20 10:31:27,360 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 5809 transitions. Word has length 264 [2022-11-20 10:31:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:27,360 INFO L495 AbstractCegarLoop]: Abstraction has 5037 states and 5809 transitions. [2022-11-20 10:31:27,360 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-20 10:31:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 5809 transitions. [2022-11-20 10:31:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-20 10:31:27,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:27,367 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-20 10:31:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 10:31:27,368 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-20 10:31:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 236893938, now seen corresponding path program 1 times [2022-11-20 10:31:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404857035] [2022-11-20 10:31:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-20 10:31:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-20 10:31:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 10:31:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-20 10:31:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-20 10:31:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-20 10:31:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-20 10:31:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,526 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-20 10:31:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404857035] [2022-11-20 10:31:27,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404857035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:27,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620578313] [2022-11-20 10:31:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:27,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:27,532 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:27,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:31:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:27,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:27,791 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-20 10:31:27,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:27,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620578313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:27,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:27,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:31:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541706623] [2022-11-20 10:31:27,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:27,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:27,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:27,794 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-20 10:31:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:28,035 INFO L93 Difference]: Finished difference Result 8093 states and 9347 transitions. [2022-11-20 10:31:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:28,036 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-20 10:31:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:28,042 INFO L225 Difference]: With dead ends: 8093 [2022-11-20 10:31:28,042 INFO L226 Difference]: Without dead ends: 3263 [2022-11-20 10:31:28,049 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-20 10:31:28,049 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-20 10:31:28,050 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-20 10:31:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2022-11-20 10:31:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3096. [2022-11-20 10:31:28,288 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-20 10:31:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3513 transitions. [2022-11-20 10:31:28,292 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3513 transitions. Word has length 273 [2022-11-20 10:31:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:28,293 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 3513 transitions. [2022-11-20 10:31:28,293 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-20 10:31:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3513 transitions. [2022-11-20 10:31:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-20 10:31:28,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:28,296 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-20 10:31:28,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:28,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:31:28,497 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-20 10:31:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 58141560, now seen corresponding path program 1 times [2022-11-20 10:31:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:28,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578372929] [2022-11-20 10:31:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-20 10:31:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-20 10:31:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-20 10:31:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 10:31:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-20 10:31:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-20 10:31:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-20 10:31:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,661 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-20 10:31:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578372929] [2022-11-20 10:31:28,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578372929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020324899] [2022-11-20 10:31:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:28,663 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:28,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:31:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:31:28,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:28,865 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-20 10:31:28,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020324899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:28,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:28,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-20 10:31:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045194236] [2022-11-20 10:31:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:28,868 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-20 10:31:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:29,096 INFO L93 Difference]: Finished difference Result 5875 states and 6711 transitions. [2022-11-20 10:31:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:29,097 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-20 10:31:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:29,102 INFO L225 Difference]: With dead ends: 5875 [2022-11-20 10:31:29,102 INFO L226 Difference]: Without dead ends: 2880 [2022-11-20 10:31:29,106 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-20 10:31:29,106 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-20 10:31:29,107 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-20 10:31:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2022-11-20 10:31:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2022-11-20 10:31:29,319 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-20 10:31:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3249 transitions. [2022-11-20 10:31:29,323 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3249 transitions. Word has length 274 [2022-11-20 10:31:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:29,324 INFO L495 AbstractCegarLoop]: Abstraction has 2880 states and 3249 transitions. [2022-11-20 10:31:29,324 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-20 10:31:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3249 transitions. [2022-11-20 10:31:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-20 10:31:29,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:29,327 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-20 10:31:29,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:29,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:29,532 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-20 10:31:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1933642455, now seen corresponding path program 1 times [2022-11-20 10:31:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644325918] [2022-11-20 10:31:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:31:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 10:31:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 10:31:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 10:31:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:31:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:31:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-20 10:31:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:31:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:31:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-20 10:31:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 10:31:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 10:31:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-20 10:31:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-20 10:31:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-20 10:31:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-20 10:31:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,644 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-20 10:31:29,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:29,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644325918] [2022-11-20 10:31:29,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644325918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:29,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137506316] [2022-11-20 10:31:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:29,646 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:29,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:31:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:29,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:29,877 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-20 10:31:29,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:29,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137506316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:29,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:29,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-20 10:31:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678208042] [2022-11-20 10:31:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:29,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:29,880 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-20 10:31:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:30,108 INFO L93 Difference]: Finished difference Result 3247 states and 3667 transitions. [2022-11-20 10:31:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:30,108 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-20 10:31:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:30,113 INFO L225 Difference]: With dead ends: 3247 [2022-11-20 10:31:30,113 INFO L226 Difference]: Without dead ends: 2881 [2022-11-20 10:31:30,114 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-20 10:31:30,114 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-20 10:31:30,115 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-20 10:31:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2022-11-20 10:31:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2880. [2022-11-20 10:31:30,334 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-20 10:31:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3240 transitions. [2022-11-20 10:31:30,338 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3240 transitions. Word has length 278 [2022-11-20 10:31:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:30,339 INFO L495 AbstractCegarLoop]: Abstraction has 2880 states and 3240 transitions. [2022-11-20 10:31:30,339 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-20 10:31:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3240 transitions. [2022-11-20 10:31:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-20 10:31:30,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:30,341 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-20 10:31:30,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 10:31:30,542 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-20 10:31:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1445787055, now seen corresponding path program 1 times [2022-11-20 10:31:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484483744] [2022-11-20 10:31:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 10:31:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 10:31:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-20 10:31:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-20 10:31:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-20 10:31:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-20 10:31:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-20 10:31:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-20 10:31:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,650 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-20 10:31:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:30,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484483744] [2022-11-20 10:31:30,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484483744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:30,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:30,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70262276] [2022-11-20 10:31:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:30,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:30,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:30,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:30,652 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-20 10:31:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:31,070 INFO L93 Difference]: Finished difference Result 5241 states and 5896 transitions. [2022-11-20 10:31:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:31,070 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-20 10:31:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:31,075 INFO L225 Difference]: With dead ends: 5241 [2022-11-20 10:31:31,075 INFO L226 Difference]: Without dead ends: 2746 [2022-11-20 10:31:31,078 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-20 10:31:31,079 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-20 10:31:31,079 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-20 10:31:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-20 10:31:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2740. [2022-11-20 10:31:31,278 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-20 10:31:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3058 transitions. [2022-11-20 10:31:31,282 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3058 transitions. Word has length 281 [2022-11-20 10:31:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:31,282 INFO L495 AbstractCegarLoop]: Abstraction has 2740 states and 3058 transitions. [2022-11-20 10:31:31,283 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-20 10:31:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3058 transitions. [2022-11-20 10:31:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-11-20 10:31:31,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:31,287 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-20 10:31:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 10:31:31,287 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-20 10:31:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash -775651037, now seen corresponding path program 1 times [2022-11-20 10:31:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:31,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404932998] [2022-11-20 10:31:31,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:31:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 10:31:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 10:31:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 10:31:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 10:31:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:31:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:31:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-20 10:31:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 10:31:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 10:31:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-20 10:31:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-20 10:31:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-20 10:31:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-20 10:31:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-20 10:31:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-20 10:31:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,414 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-20 10:31:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:31,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404932998] [2022-11-20 10:31:31,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404932998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:31,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241677494] [2022-11-20 10:31:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:31,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:31,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:31,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:31,417 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-20 10:31:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:31,823 INFO L93 Difference]: Finished difference Result 2740 states and 3058 transitions. [2022-11-20 10:31:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:31,823 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-20 10:31:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:31,826 INFO L225 Difference]: With dead ends: 2740 [2022-11-20 10:31:31,827 INFO L226 Difference]: Without dead ends: 2353 [2022-11-20 10:31:31,827 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-20 10:31:31,828 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-20 10:31:31,828 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-20 10:31:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-11-20 10:31:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2333. [2022-11-20 10:31:32,022 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-20 10:31:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 2605 transitions. [2022-11-20 10:31:32,024 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 2605 transitions. Word has length 282 [2022-11-20 10:31:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:32,025 INFO L495 AbstractCegarLoop]: Abstraction has 2333 states and 2605 transitions. [2022-11-20 10:31:32,025 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-20 10:31:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2605 transitions. [2022-11-20 10:31:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2022-11-20 10:31:32,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:32,029 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-20 10:31:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 10:31:32,029 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-20 10:31:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1314744943, now seen corresponding path program 1 times [2022-11-20 10:31:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270874286] [2022-11-20 10:31:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:31:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:31:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:31:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:31:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 10:31:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 10:31:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-20 10:31:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-20 10:31:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 10:31:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-20 10:31:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-20 10:31:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-20 10:31:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-20 10:31:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-20 10:31:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-20 10:31:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-20 10:31:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-20 10:31:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-20 10:31:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-20 10:31:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-20 10:31:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-11-20 10:31:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-11-20 10:31:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-11-20 10:31:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-20 10:31:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-20 10:31:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-11-20 10:31:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-20 10:31:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-11-20 10:31:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2022-11-20 10:31:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-11-20 10:31:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,204 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-20 10:31:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:32,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270874286] [2022-11-20 10:31:32,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270874286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618173762] [2022-11-20 10:31:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:32,208 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:32,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 10:31:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:32,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:31:32,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:32,506 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-20 10:31:32,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:32,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618173762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:32,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:32,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-20 10:31:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070773228] [2022-11-20 10:31:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:32,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:32,508 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-20 10:31:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:32,660 INFO L93 Difference]: Finished difference Result 3551 states and 3985 transitions. [2022-11-20 10:31:32,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:32,660 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-20 10:31:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:32,663 INFO L225 Difference]: With dead ends: 3551 [2022-11-20 10:31:32,663 INFO L226 Difference]: Without dead ends: 1465 [2022-11-20 10:31:32,665 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-20 10:31:32,665 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-20 10:31:32,665 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-20 10:31:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-11-20 10:31:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2022-11-20 10:31:32,756 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-20 10:31:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1611 transitions. [2022-11-20 10:31:32,758 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1611 transitions. Word has length 503 [2022-11-20 10:31:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:32,758 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 1611 transitions. [2022-11-20 10:31:32,758 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-20 10:31:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1611 transitions. [2022-11-20 10:31:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2022-11-20 10:31:32,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:32,761 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-20 10:31:32,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:32,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 10:31:32,964 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-20 10:31:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2096536150, now seen corresponding path program 1 times [2022-11-20 10:31:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:32,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718345344] [2022-11-20 10:31:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-20 10:31:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-20 10:31:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-20 10:31:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-20 10:31:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 10:31:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-20 10:31:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-20 10:31:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-20 10:31:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-20 10:31:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-20 10:31:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-20 10:31:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-20 10:31:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-20 10:31:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-20 10:31:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-20 10:31:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-20 10:31:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-11-20 10:31:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-20 10:31:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-11-20 10:31:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-11-20 10:31:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-20 10:31:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-11-20 10:31:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2022-11-20 10:31:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-20 10:31:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-11-20 10:31:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2022-11-20 10:31:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2022-11-20 10:31:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,213 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-20 10:31:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718345344] [2022-11-20 10:31:33,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718345344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84838350] [2022-11-20 10:31:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:33,215 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:33,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 10:31:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:31:33,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:33,479 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-20 10:31:33,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84838350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:33,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:33,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-20 10:31:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665942354] [2022-11-20 10:31:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:33,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:33,482 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-20 10:31:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:33,625 INFO L93 Difference]: Finished difference Result 2672 states and 2952 transitions. [2022-11-20 10:31:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:33,625 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-20 10:31:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:33,628 INFO L225 Difference]: With dead ends: 2672 [2022-11-20 10:31:33,628 INFO L226 Difference]: Without dead ends: 1289 [2022-11-20 10:31:33,630 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-20 10:31:33,631 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-20 10:31:33,631 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-20 10:31:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-11-20 10:31:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2022-11-20 10:31:33,731 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-20 10:31:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1411 transitions. [2022-11-20 10:31:33,733 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1411 transitions. Word has length 506 [2022-11-20 10:31:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:33,733 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1411 transitions. [2022-11-20 10:31:33,734 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-20 10:31:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1411 transitions. [2022-11-20 10:31:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2022-11-20 10:31:33,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:33,736 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-20 10:31:33,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:33,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:33,937 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-20 10:31:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:33,937 INFO L85 PathProgramCache]: Analyzing trace with hash -572218028, now seen corresponding path program 1 times [2022-11-20 10:31:33,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:33,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320487470] [2022-11-20 10:31:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 10:31:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-20 10:31:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-20 10:31:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-20 10:31:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-20 10:31:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-20 10:31:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-20 10:31:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-20 10:31:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-20 10:31:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-20 10:31:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-20 10:31:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-20 10:31:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-11-20 10:31:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-20 10:31:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-20 10:31:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-11-20 10:31:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-11-20 10:31:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-11-20 10:31:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-11-20 10:31:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-11-20 10:31:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-11-20 10:31:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2022-11-20 10:31:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-11-20 10:31:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2022-11-20 10:31:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-11-20 10:31:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2022-11-20 10:31:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,099 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-20 10:31:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:34,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320487470] [2022-11-20 10:31:34,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320487470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:34,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:34,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204728889] [2022-11-20 10:31:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:34,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:34,101 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-20 10:31:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:34,383 INFO L93 Difference]: Finished difference Result 2704 states and 2968 transitions. [2022-11-20 10:31:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:34,383 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-20 10:31:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:34,385 INFO L225 Difference]: With dead ends: 2704 [2022-11-20 10:31:34,386 INFO L226 Difference]: Without dead ends: 1068 [2022-11-20 10:31:34,387 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-20 10:31:34,388 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-20 10:31:34,388 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-20 10:31:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-20 10:31:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1060. [2022-11-20 10:31:34,461 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-20 10:31:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1150 transitions. [2022-11-20 10:31:34,462 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1150 transitions. Word has length 518 [2022-11-20 10:31:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:34,463 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1150 transitions. [2022-11-20 10:31:34,463 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-20 10:31:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1150 transitions. [2022-11-20 10:31:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2022-11-20 10:31:34,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:34,466 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-20 10:31:34,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-20 10:31:34,466 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-20 10:31:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -476883632, now seen corresponding path program 1 times [2022-11-20 10:31:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:34,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871567183] [2022-11-20 10:31:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:31:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:31:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 10:31:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:31:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:31:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:31:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:31:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:31:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:31:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:31:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:31:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-20 10:31:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-20 10:31:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-20 10:31:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 10:31:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 10:31:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-20 10:31:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-20 10:31:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-20 10:31:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-20 10:31:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-20 10:31:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-20 10:31:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-20 10:31:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-20 10:31:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-11-20 10:31:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-20 10:31:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-11-20 10:31:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-20 10:31:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-11-20 10:31:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2022-11-20 10:31:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-20 10:31:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-20 10:31:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-11-20 10:31:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-11-20 10:31:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-11-20 10:31:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2022-11-20 10:31:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2022-11-20 10:31:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2022-11-20 10:31:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,753 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-20 10:31:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:34,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871567183] [2022-11-20 10:31:34,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871567183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489720133] [2022-11-20 10:31:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:34,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:34,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:34,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:34,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 10:31:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:34,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:31:34,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:36,006 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-20 10:31:36,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:36,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489720133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:36,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:36,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2022-11-20 10:31:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361685258] [2022-11-20 10:31:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:36,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:36,009 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-20 10:31:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:36,145 INFO L93 Difference]: Finished difference Result 1064 states and 1154 transitions. [2022-11-20 10:31:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:36,145 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-20 10:31:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:36,146 INFO L225 Difference]: With dead ends: 1064 [2022-11-20 10:31:36,146 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:31:36,147 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-20 10:31:36,148 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-20 10:31:36,148 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-20 10:31:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:31:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:31:36,149 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-20 10:31:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:31:36,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 530 [2022-11-20 10:31:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:36,150 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:31:36,150 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-20 10:31:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:31:36,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:31:36,152 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-20 10:31:36,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-20 10:31:36,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-20 10:31:36,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-20 10:31:36,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-20 10:31:36,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-20 10:31:36,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-20 10:31:36,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-20 10:31:36,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:36,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 10:31:36,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:32:26,357 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-20 10:32:26,357 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-11-20 10:32:26,358 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-11-20 10:32:26,359 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-20 10:32:26,359 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-11-20 10:32:26,360 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-11-20 10:32:26,360 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-20 10:32:26,361 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-20 10:32:26,361 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-11-20 10:32:26,361 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-11-20 10:32:26,362 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-20 10:32:26,362 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-11-20 10:32:26,362 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-11-20 10:32:26,362 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-11-20 10:32:26,362 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-11-20 10:32:26,362 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 269) the Hoare annotation is: true [2022-11-20 10:32:26,363 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-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2022-11-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 269) no Hoare annotation was computed. [2022-11-20 10:32:26,363 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-11-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-11-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-11-20 10:32:26,363 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-11-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-11-20 10:32:26,363 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-11-20 10:32:26,363 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-20 10:32:26,364 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-11-20 10:32:26,364 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-20 10:32:26,364 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:32:26,364 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-11-20 10:32:26,364 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-11-20 10:32:26,364 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-20 10:32:26,365 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-20 10:32:26,365 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-11-20 10:32:26,365 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-20 10:32:26,365 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-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2022-11-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2022-11-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2022-11-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-11-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-11-20 10:32:26,366 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2022-11-20 10:32:26,367 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-20 10:32:26,367 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2022-11-20 10:32:26,367 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2022-11-20 10:32:26,367 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-20 10:32:26,367 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2022-11-20 10:32:26,368 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-20 10:32:26,368 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-20 10:32:26,369 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-20 10:32:26,369 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-20 10:32:26,369 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-20 10:32:26,369 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-11-20 10:32:26,369 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-11-20 10:32:26,370 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-11-20 10:32:26,370 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:32:26,370 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-11-20 10:32:26,370 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-20 10:32:26,370 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2022-11-20 10:32:26,370 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-11-20 10:32:26,371 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-20 10:32:26,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-20 10:32:26,371 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-20 10:32:26,372 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-11-20 10:32:26,372 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-20 10:32:26,372 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-20 10:32:26,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-20 10:32:26,373 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-20 10:32:26,373 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-20 10:32:26,373 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-20 10:32:26,374 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-20 10:32:26,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-20 10:32:26,374 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-20 10:32:26,374 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-20 10:32:26,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-20 10:32:26,375 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-11-20 10:32:26,375 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-11-20 10:32:26,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:32:26,375 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-20 10:32:26,376 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-11-20 10:32:26,376 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-20 10:32:26,376 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-11-20 10:32:26,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-20 10:32:26,376 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-11-20 10:32:26,377 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-20 10:32:26,377 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-11-20 10:32:26,377 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-20 10:32:26,378 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-20 10:32:26,378 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-11-20 10:32:26,378 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2022-11-20 10:32:26,378 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-20 10:32:26,378 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-20 10:32:26,378 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-20 10:32:26,378 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-20 10:32:26,379 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-20 10:32:26,379 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-11-20 10:32:26,379 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-11-20 10:32:26,379 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:32:26,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-20 10:32:26,379 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-20 10:32:26,380 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-20 10:32:26,380 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-20 10:32:26,380 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2022-11-20 10:32:26,380 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-11-20 10:32:26,380 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-20 10:32:26,380 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-20 10:32:26,381 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-20 10:32:26,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-20 10:32:26,381 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-20 10:32:26,381 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-11-20 10:32:26,381 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-20 10:32:26,382 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2022-11-20 10:32:26,382 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-11-20 10:32:26,382 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-20 10:32:26,382 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-20 10:32:26,382 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-20 10:32:26,383 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-20 10:32:26,386 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-20 10:32:26,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:32:26,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:32:26 BoogieIcfgContainer [2022-11-20 10:32:26,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:32:26,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:32:26,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:32:26,500 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:32:26,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:46" (3/4) ... [2022-11-20 10:32:26,504 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:32:26,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-20 10:32:26,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-20 10:32:26,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-20 10:32:26,511 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-20 10:32:26,511 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-20 10:32:26,511 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-20 10:32:26,527 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-20 10:32:26,528 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:32:26,528 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:32:26,529 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:32:26,558 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-20 10:32:26,559 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-20 10:32:26,561 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-20 10:32:26,561 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-20 10:32:26,597 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:32:26,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:32:26,598 INFO L158 Benchmark]: Toolchain (without parser) took 101039.71ms. Allocated memory was 178.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 135.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 673.1MB. Max. memory is 16.1GB. [2022-11-20 10:32:26,598 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 123.7MB. Free memory was 88.7MB in the beginning and 88.7MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:32:26,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.38ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 122.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:32:26,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.19ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 119.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:32:26,599 INFO L158 Benchmark]: Boogie Preprocessor took 36.30ms. Allocated memory is still 178.3MB. Free memory was 119.5MB in the beginning and 118.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:32:26,599 INFO L158 Benchmark]: RCFGBuilder took 589.38ms. Allocated memory is still 178.3MB. Free memory was 118.0MB in the beginning and 99.4MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:32:26,600 INFO L158 Benchmark]: TraceAbstraction took 99843.68ms. Allocated memory was 178.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 98.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-20 10:32:26,600 INFO L158 Benchmark]: Witness Printer took 98.00ms. Allocated memory is still 3.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:32:26,601 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.22ms. Allocated memory is still 123.7MB. Free memory was 88.7MB in the beginning and 88.7MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.38ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 122.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.19ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 119.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.30ms. Allocated memory is still 178.3MB. Free memory was 119.5MB in the beginning and 118.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 589.38ms. Allocated memory is still 178.3MB. Free memory was 118.0MB in the beginning and 99.4MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 99843.68ms. Allocated memory was 178.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 98.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 98.00ms. Allocated memory is still 3.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 99.7s, OverallIterations: 37, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7225 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7043 mSDsluCounter, 17256 SdHoareTripleChecker+Invalid, 3.3s 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.1s 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.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 10238 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 21337 PreInvPairs, 22768 NumberOfFragments, 14160 HoareAnnotationTreeSize, 21337 FomulaSimplifications, 178486 FormulaSimplificationTreeSizeReduction, 9.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 125952 FormulaSimplificationTreeSizeReductionInter, 40.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.3s 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-20 10:32:26,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53242dd-5d79-43df-95a7-33cf8683f79c/bin/uautomizer-ug76WZFUDN/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