./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-38b53e6 [2022-11-25 17:14:47,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:14:47,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:14:47,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:14:47,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:14:47,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:14:47,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:14:47,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:14:47,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:14:47,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:14:47,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:14:47,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:14:47,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:14:47,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:14:47,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:14:47,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:14:47,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:14:47,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:14:47,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:14:47,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:14:47,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:14:47,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:14:47,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:14:47,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:14:47,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:14:47,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:14:47,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:14:47,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:14:47,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:14:47,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:14:47,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:14:47,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:14:47,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:14:47,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:14:47,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:14:47,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:14:47,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:14:47,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:14:47,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:14:47,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:14:47,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:14:47,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 17:14:47,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:14:47,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:14:47,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:14:47,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:14:47,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:14:47,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:14:47,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:14:47,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:14:47,243 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:14:47,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:14:47,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:14:47,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:14:47,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:14:47,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:14:47,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:14:47,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:14:47,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:14:47,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:14:47,247 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:14:47,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:14:47,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:14:47,248 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:14:47,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:14:47,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:14:47,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:14:47,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:14:47,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:14:47,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:14:47,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:14:47,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:14:47,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:14:47,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:14:47,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:14:47,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:14:47,253 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:14:47,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:14:47,254 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-11-25 17:14:47,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:14:47,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:14:47,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:14:47,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:14:47,614 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:14:47,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-25 17:14:51,266 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:14:51,582 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:14:51,586 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-25 17:14:51,603 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/data/fdeb92e2a/2959ab897c7a442fae4dd662ffd590fb/FLAGf1042fec0 [2022-11-25 17:14:51,623 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/data/fdeb92e2a/2959ab897c7a442fae4dd662ffd590fb [2022-11-25 17:14:51,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:14:51,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:14:51,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:14:51,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:14:51,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:14:51,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:14:51" (1/1) ... [2022-11-25 17:14:51,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a1e094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:51, skipping insertion in model container [2022-11-25 17:14:51,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:14:51" (1/1) ... [2022-11-25 17:14:51,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:14:51,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:14:51,920 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_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-25 17:14:51,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:14:51,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:14:52,008 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_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-25 17:14:52,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:14:52,059 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:14:52,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52 WrapperNode [2022-11-25 17:14:52,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:14:52,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:14:52,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:14:52,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:14:52,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,109 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-11-25 17:14:52,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:14:52,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:14:52,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:14:52,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:14:52,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:14:52,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:14:52,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:14:52,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:14:52,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (1/1) ... [2022-11-25 17:14:52,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:14:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:14:52,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:14:52,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:14:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:14:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-25 17:14:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-25 17:14:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-25 17:14:52,299 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-25 17:14:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-25 17:14:52,300 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-25 17:14:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-25 17:14:52,301 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-25 17:14:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-25 17:14:52,301 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-25 17:14:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:14:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-25 17:14:52,302 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-25 17:14:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:14:52,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:14:52,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:14:52,449 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:14:52,914 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:14:52,929 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:14:52,929 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 17:14:52,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:52 BoogieIcfgContainer [2022-11-25 17:14:52,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:14:52,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:14:52,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:14:52,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:14:52,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:14:51" (1/3) ... [2022-11-25 17:14:52,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57283e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:14:52, skipping insertion in model container [2022-11-25 17:14:52,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:52" (2/3) ... [2022-11-25 17:14:52,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57283e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:14:52, skipping insertion in model container [2022-11-25 17:14:52,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:52" (3/3) ... [2022-11-25 17:14:52,960 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-11-25 17:14:52,989 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:14:52,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 17:14:53,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:14:53,135 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;@53993cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:14:53,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 17:14:53,147 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-25 17:14:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:14:53,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:53,167 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-25 17:14:53,168 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-25 17:14:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1283588667, now seen corresponding path program 1 times [2022-11-25 17:14:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382355177] [2022-11-25 17:14:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 17:14:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:14:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382355177] [2022-11-25 17:14:53,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382355177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:53,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:53,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373754896] [2022-11-25 17:14:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:53,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:53,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:53,922 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-25 17:14:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:54,442 INFO L93 Difference]: Finished difference Result 359 states and 511 transitions. [2022-11-25 17:14:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:14:54,454 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-25 17:14:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:54,468 INFO L225 Difference]: With dead ends: 359 [2022-11-25 17:14:54,469 INFO L226 Difference]: Without dead ends: 231 [2022-11-25 17:14:54,474 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-25 17:14:54,479 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 321 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:54,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 732 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:14:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-25 17:14:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2022-11-25 17:14:54,592 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-25 17:14:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2022-11-25 17:14:54,615 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2022-11-25 17:14:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:54,617 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2022-11-25 17:14:54,618 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-25 17:14:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2022-11-25 17:14:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:14:54,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:54,646 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-25 17:14:54,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:14:54,646 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-25 17:14:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1434820870, now seen corresponding path program 1 times [2022-11-25 17:14:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933484580] [2022-11-25 17:14:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 17:14:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:14:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933484580] [2022-11-25 17:14:55,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933484580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:55,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:55,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:14:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313429029] [2022-11-25 17:14:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:55,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:55,053 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-25 17:14:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:55,429 INFO L93 Difference]: Finished difference Result 411 states and 568 transitions. [2022-11-25 17:14:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:14:55,430 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-25 17:14:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:55,434 INFO L225 Difference]: With dead ends: 411 [2022-11-25 17:14:55,434 INFO L226 Difference]: Without dead ends: 226 [2022-11-25 17:14:55,436 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-25 17:14:55,438 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 116 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:55,439 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.2s Time] [2022-11-25 17:14:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-25 17:14:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2022-11-25 17:14:55,470 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-25 17:14:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2022-11-25 17:14:55,473 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2022-11-25 17:14:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:55,474 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2022-11-25 17:14:55,474 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-25 17:14:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2022-11-25 17:14:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:14:55,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:55,477 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-25 17:14:55,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:14:55,478 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-25 17:14:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1473943032, now seen corresponding path program 1 times [2022-11-25 17:14:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:55,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429333139] [2022-11-25 17:14:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 17:14:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:14:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:55,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429333139] [2022-11-25 17:14:55,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429333139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:55,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:55,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:14:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364267741] [2022-11-25 17:14:55,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:55,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:55,660 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-25 17:14:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:56,451 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2022-11-25 17:14:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:14:56,452 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-25 17:14:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:56,463 INFO L225 Difference]: With dead ends: 784 [2022-11-25 17:14:56,464 INFO L226 Difference]: Without dead ends: 596 [2022-11-25 17:14:56,475 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-25 17:14:56,478 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 508 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:56,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 805 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:14:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-25 17:14:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2022-11-25 17:14:56,581 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-25 17:14:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2022-11-25 17:14:56,585 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2022-11-25 17:14:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:56,586 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2022-11-25 17:14:56,586 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-25 17:14:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2022-11-25 17:14:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:14:56,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:56,589 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-25 17:14:56,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:14:56,590 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-25 17:14:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash -24370336, now seen corresponding path program 1 times [2022-11-25 17:14:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463927494] [2022-11-25 17:14:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:14:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463927494] [2022-11-25 17:14:56,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463927494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:56,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:56,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371320926] [2022-11-25 17:14:56,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:56,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:56,688 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-25 17:14:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:57,181 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2022-11-25 17:14:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:14:57,182 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-25 17:14:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:57,188 INFO L225 Difference]: With dead ends: 1262 [2022-11-25 17:14:57,189 INFO L226 Difference]: Without dead ends: 919 [2022-11-25 17:14:57,191 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-25 17:14:57,192 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.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:57,193 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.3s Time] [2022-11-25 17:14:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-11-25 17:14:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2022-11-25 17:14:57,340 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-25 17:14:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2022-11-25 17:14:57,346 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2022-11-25 17:14:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:57,347 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2022-11-25 17:14:57,347 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-25 17:14:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2022-11-25 17:14:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:14:57,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:57,349 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-25 17:14:57,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:14:57,350 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-25 17:14:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -332809345, now seen corresponding path program 1 times [2022-11-25 17:14:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:57,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136346378] [2022-11-25 17:14:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:14:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:57,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136346378] [2022-11-25 17:14:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136346378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:57,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:57,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:14:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815223279] [2022-11-25 17:14:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:57,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:57,500 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-25 17:14:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:57,896 INFO L93 Difference]: Finished difference Result 1635 states and 2234 transitions. [2022-11-25 17:14:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:14:57,897 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-25 17:14:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:57,903 INFO L225 Difference]: With dead ends: 1635 [2022-11-25 17:14:57,904 INFO L226 Difference]: Without dead ends: 863 [2022-11-25 17:14:57,906 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-25 17:14:57,908 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-25 17:14:57,908 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-25 17:14:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-25 17:14:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 800. [2022-11-25 17:14:58,026 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-25 17:14:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2022-11-25 17:14:58,032 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2022-11-25 17:14:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:58,033 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2022-11-25 17:14:58,034 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-25 17:14:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2022-11-25 17:14:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:14:58,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:58,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:58,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:14:58,036 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-25 17:14:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -466822851, now seen corresponding path program 1 times [2022-11-25 17:14:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:58,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272683193] [2022-11-25 17:14:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:14:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:58,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272683193] [2022-11-25 17:14:58,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272683193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:58,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:58,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589559147] [2022-11-25 17:14:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:58,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:58,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:58,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:58,153 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-25 17:14:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:58,555 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2022-11-25 17:14:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:14:58,556 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-25 17:14:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:58,566 INFO L225 Difference]: With dead ends: 2356 [2022-11-25 17:14:58,566 INFO L226 Difference]: Without dead ends: 1567 [2022-11-25 17:14:58,570 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-25 17:14:58,571 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 184 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:58,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 443 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:14:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-11-25 17:14:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2022-11-25 17:14:58,795 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-25 17:14:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2022-11-25 17:14:58,806 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2022-11-25 17:14:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:58,806 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2022-11-25 17:14:58,807 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-25 17:14:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2022-11-25 17:14:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 17:14:58,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:58,809 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-25 17:14:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:14:58,810 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-25 17:14:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1537614413, now seen corresponding path program 1 times [2022-11-25 17:14:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:58,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272623324] [2022-11-25 17:14:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:14:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272623324] [2022-11-25 17:14:58,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272623324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:58,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:58,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:58,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240022158] [2022-11-25 17:14:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:58,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:14:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:58,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:14:58,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:14:58,887 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-25 17:14:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:59,423 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2022-11-25 17:14:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:14:59,424 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-25 17:14:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:59,440 INFO L225 Difference]: With dead ends: 4093 [2022-11-25 17:14:59,440 INFO L226 Difference]: Without dead ends: 2700 [2022-11-25 17:14:59,446 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-25 17:14:59,447 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:59,447 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.2s Time] [2022-11-25 17:14:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-11-25 17:14:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2022-11-25 17:14:59,827 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-25 17:14:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2022-11-25 17:14:59,847 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2022-11-25 17:14:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:59,848 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2022-11-25 17:14:59,848 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-25 17:14:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2022-11-25 17:14:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 17:14:59,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:59,850 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-25 17:14:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:14:59,851 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-25 17:14:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -663779837, now seen corresponding path program 1 times [2022-11-25 17:14:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645428327] [2022-11-25 17:14:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:14:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:14:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:14:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:14:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645428327] [2022-11-25 17:14:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645428327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:59,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744210312] [2022-11-25 17:14:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:14:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:14:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:14:59,931 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-25 17:15:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:00,397 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2022-11-25 17:15:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:00,398 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-25 17:15:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:00,416 INFO L225 Difference]: With dead ends: 3062 [2022-11-25 17:15:00,417 INFO L226 Difference]: Without dead ends: 3058 [2022-11-25 17:15:00,419 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-25 17:15:00,420 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-25 17:15:00,421 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-25 17:15:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2022-11-25 17:15:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2022-11-25 17:15:00,747 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-25 17:15:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2022-11-25 17:15:00,766 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2022-11-25 17:15:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:00,767 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2022-11-25 17:15:00,767 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-25 17:15:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2022-11-25 17:15:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 17:15:00,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:00,769 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-25 17:15:00,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:15:00,770 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-25 17:15:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -472171120, now seen corresponding path program 1 times [2022-11-25 17:15:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:00,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659559771] [2022-11-25 17:15:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:00,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659559771] [2022-11-25 17:15:00,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659559771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:00,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:00,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818553661] [2022-11-25 17:15:00,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:00,862 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-25 17:15:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:01,472 INFO L93 Difference]: Finished difference Result 5264 states and 6962 transitions. [2022-11-25 17:15:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:01,473 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-25 17:15:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:01,493 INFO L225 Difference]: With dead ends: 5264 [2022-11-25 17:15:01,493 INFO L226 Difference]: Without dead ends: 3386 [2022-11-25 17:15:01,501 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-25 17:15:01,502 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 305 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 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.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:01,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 630 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-11-25 17:15:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3248. [2022-11-25 17:15:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2679 states have (on average 1.2695035460992907) internal successors, (3401), 2696 states have internal predecessors, (3401), 343 states have call successors, (343), 210 states have call predecessors, (343), 218 states have return successors, (486), 343 states have call predecessors, (486), 343 states have call successors, (486) [2022-11-25 17:15:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4230 transitions. [2022-11-25 17:15:01,932 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4230 transitions. Word has length 59 [2022-11-25 17:15:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:01,933 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 4230 transitions. [2022-11-25 17:15:01,933 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-25 17:15:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4230 transitions. [2022-11-25 17:15:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 17:15:01,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:01,935 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-25 17:15:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:15:01,936 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-25 17:15:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1752402570, now seen corresponding path program 1 times [2022-11-25 17:15:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:01,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576520531] [2022-11-25 17:15:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:02,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576520531] [2022-11-25 17:15:02,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576520531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:02,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:02,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20847568] [2022-11-25 17:15:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:02,052 INFO L87 Difference]: Start difference. First operand 3248 states and 4230 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-25 17:15:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:02,765 INFO L93 Difference]: Finished difference Result 5046 states and 6653 transitions. [2022-11-25 17:15:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:02,766 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-25 17:15:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:02,793 INFO L225 Difference]: With dead ends: 5046 [2022-11-25 17:15:02,793 INFO L226 Difference]: Without dead ends: 5044 [2022-11-25 17:15:02,796 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-25 17:15:02,797 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 322 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:02,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 516 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:15:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2022-11-25 17:15:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4823. [2022-11-25 17:15:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3989 states have (on average 1.266984206568062) internal successors, (5054), 4011 states have internal predecessors, (5054), 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-25 17:15:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6277 transitions. [2022-11-25 17:15:03,331 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6277 transitions. Word has length 60 [2022-11-25 17:15:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:03,332 INFO L495 AbstractCegarLoop]: Abstraction has 4823 states and 6277 transitions. [2022-11-25 17:15:03,333 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-25 17:15:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6277 transitions. [2022-11-25 17:15:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 17:15:03,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:03,335 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-25 17:15:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:15:03,336 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-25 17:15:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2044119821, now seen corresponding path program 1 times [2022-11-25 17:15:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:03,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538604138] [2022-11-25 17:15:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,470 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-25 17:15:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538604138] [2022-11-25 17:15:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538604138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:03,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:03,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:15:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148427416] [2022-11-25 17:15:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:03,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:03,475 INFO L87 Difference]: Start difference. First operand 4823 states and 6277 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-25 17:15:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:04,898 INFO L93 Difference]: Finished difference Result 13328 states and 17731 transitions. [2022-11-25 17:15:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:15:04,899 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-25 17:15:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:04,962 INFO L225 Difference]: With dead ends: 13328 [2022-11-25 17:15:04,962 INFO L226 Difference]: Without dead ends: 8521 [2022-11-25 17:15:04,989 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-25 17:15:04,990 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 455 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:04,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 632 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2022-11-25 17:15:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8239. [2022-11-25 17:15:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8239 states, 6727 states have (on average 1.2430503939348891) internal successors, (8362), 6799 states have internal predecessors, (8362), 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-25 17:15:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 10933 transitions. [2022-11-25 17:15:05,979 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 10933 transitions. Word has length 70 [2022-11-25 17:15:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:05,980 INFO L495 AbstractCegarLoop]: Abstraction has 8239 states and 10933 transitions. [2022-11-25 17:15:05,981 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-25 17:15:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 10933 transitions. [2022-11-25 17:15:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 17:15:05,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:05,993 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, 1] [2022-11-25 17:15:05,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:15:05,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1620972028, now seen corresponding path program 1 times [2022-11-25 17:15:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:05,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497582834] [2022-11-25 17:15:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:15:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:06,135 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-25 17:15:06,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:06,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497582834] [2022-11-25 17:15:06,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497582834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:06,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:06,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:15:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339095723] [2022-11-25 17:15:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:15:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:15:06,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:06,140 INFO L87 Difference]: Start difference. First operand 8239 states and 10933 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-25 17:15:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:07,708 INFO L93 Difference]: Finished difference Result 16593 states and 22002 transitions. [2022-11-25 17:15:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:15:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 82 [2022-11-25 17:15:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:07,772 INFO L225 Difference]: With dead ends: 16593 [2022-11-25 17:15:07,772 INFO L226 Difference]: Without dead ends: 7947 [2022-11-25 17:15:07,813 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-25 17:15:07,815 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 678 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:07,816 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.5s Time] [2022-11-25 17:15:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-11-25 17:15:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 7719. [2022-11-25 17:15:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7719 states, 6301 states have (on average 1.228059038247897) internal successors, (7738), 6372 states have internal predecessors, (7738), 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-25 17:15:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 10007 transitions. [2022-11-25 17:15:09,042 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 10007 transitions. Word has length 82 [2022-11-25 17:15:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:09,043 INFO L495 AbstractCegarLoop]: Abstraction has 7719 states and 10007 transitions. [2022-11-25 17:15:09,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-25 17:15:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 10007 transitions. [2022-11-25 17:15:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-25 17:15:09,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:09,054 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-25 17:15:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:15:09,056 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-25 17:15:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash 398620961, now seen corresponding path program 1 times [2022-11-25 17:15:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:09,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612769638] [2022-11-25 17:15:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:15:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 17:15:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 17:15:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:15:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 17:15:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:15:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,286 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-25 17:15:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:09,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612769638] [2022-11-25 17:15:09,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612769638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:09,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308693936] [2022-11-25 17:15:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:09,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:09,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:09,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:09,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:15:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:09,739 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-25 17:15:09,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:09,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308693936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:09,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:09,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-25 17:15:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178741944] [2022-11-25 17:15:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:09,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:09,742 INFO L87 Difference]: Start difference. First operand 7719 states and 10007 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-25 17:15:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:10,231 INFO L93 Difference]: Finished difference Result 12033 states and 15714 transitions. [2022-11-25 17:15:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:10,232 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-25 17:15:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:10,258 INFO L225 Difference]: With dead ends: 12033 [2022-11-25 17:15:10,258 INFO L226 Difference]: Without dead ends: 5587 [2022-11-25 17:15:10,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:10,282 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-25 17:15:10,283 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-25 17:15:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2022-11-25 17:15:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5587. [2022-11-25 17:15:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4555 states have (on average 1.2169045005488475) internal successors, (5543), 4604 states have internal predecessors, (5543), 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-25 17:15:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7130 transitions. [2022-11-25 17:15:10,911 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7130 transitions. Word has length 127 [2022-11-25 17:15:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:10,912 INFO L495 AbstractCegarLoop]: Abstraction has 5587 states and 7130 transitions. [2022-11-25 17:15:10,912 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-25 17:15:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7130 transitions. [2022-11-25 17:15:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 17:15:10,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:10,920 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-25 17:15:10,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:11,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:15:11,129 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-25 17:15:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1617965029, now seen corresponding path program 1 times [2022-11-25 17:15:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:11,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622044696] [2022-11-25 17:15:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:15:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 17:15:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:15:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:15:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,328 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-25 17:15:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622044696] [2022-11-25 17:15:11,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622044696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023525817] [2022-11-25 17:15:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:11,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:11,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:15:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:11,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:11,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:11,653 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-25 17:15:11,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:11,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023525817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:11,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:11,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-25 17:15:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623867849] [2022-11-25 17:15:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:11,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:11,657 INFO L87 Difference]: Start difference. First operand 5587 states and 7130 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-25 17:15:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:12,497 INFO L93 Difference]: Finished difference Result 12745 states and 16166 transitions. [2022-11-25 17:15:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:12,498 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-25 17:15:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:12,538 INFO L225 Difference]: With dead ends: 12745 [2022-11-25 17:15:12,538 INFO L226 Difference]: Without dead ends: 8431 [2022-11-25 17:15:12,555 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-25 17:15:12,556 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-25 17:15:12,556 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-25 17:15:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2022-11-25 17:15:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8428. [2022-11-25 17:15:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 6846 states have (on average 1.1958808063102542) internal successors, (8187), 6905 states have internal predecessors, (8187), 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-25 17:15:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 10454 transitions. [2022-11-25 17:15:13,456 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 10454 transitions. Word has length 130 [2022-11-25 17:15:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:13,457 INFO L495 AbstractCegarLoop]: Abstraction has 8428 states and 10454 transitions. [2022-11-25 17:15:13,457 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-25 17:15:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 10454 transitions. [2022-11-25 17:15:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 17:15:13,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:13,468 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, 1] [2022-11-25 17:15:13,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:13,675 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1204461291, now seen corresponding path program 1 times [2022-11-25 17:15:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:13,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428744507] [2022-11-25 17:15:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:15:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:15:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:15:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:15:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:15:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 17:15:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:13,946 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-25 17:15:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428744507] [2022-11-25 17:15:13,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428744507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778044185] [2022-11-25 17:15:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:13,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:13,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:13,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:15:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:14,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:14,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:14,213 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-25 17:15:14,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778044185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:14,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:14,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-25 17:15:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815518254] [2022-11-25 17:15:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:14,216 INFO L87 Difference]: Start difference. First operand 8428 states and 10454 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-25 17:15:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:14,949 INFO L93 Difference]: Finished difference Result 13900 states and 17415 transitions. [2022-11-25 17:15:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:14,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 141 [2022-11-25 17:15:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:14,999 INFO L225 Difference]: With dead ends: 13900 [2022-11-25 17:15:14,999 INFO L226 Difference]: Without dead ends: 6508 [2022-11-25 17:15:15,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 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-25 17:15:15,028 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-25 17:15:15,029 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-25 17:15:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2022-11-25 17:15:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6508. [2022-11-25 17:15:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 5284 states have (on average 1.2036336109008328) internal successors, (6360), 5333 states have internal predecessors, (6360), 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-25 17:15:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 8183 transitions. [2022-11-25 17:15:15,815 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 8183 transitions. Word has length 141 [2022-11-25 17:15:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:15,816 INFO L495 AbstractCegarLoop]: Abstraction has 6508 states and 8183 transitions. [2022-11-25 17:15:15,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-25 17:15:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 8183 transitions. [2022-11-25 17:15:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-25 17:15:15,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:15,824 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-25 17:15:15,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:16,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:15:16,031 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-25 17:15:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash 646813658, now seen corresponding path program 1 times [2022-11-25 17:15:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:16,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556709088] [2022-11-25 17:15:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:15:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 17:15:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:15:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 17:15:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 17:15:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,181 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-25 17:15:16,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:16,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556709088] [2022-11-25 17:15:16,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556709088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:16,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568811181] [2022-11-25 17:15:16,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:16,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:16,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:16,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:16,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:15:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:16,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:16,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:16,402 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-25 17:15:16,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:16,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568811181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:16,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:16,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-25 17:15:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621719638] [2022-11-25 17:15:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:16,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:16,406 INFO L87 Difference]: Start difference. First operand 6508 states and 8183 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-25 17:15:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:16,726 INFO L93 Difference]: Finished difference Result 8734 states and 11097 transitions. [2022-11-25 17:15:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:16,726 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-25 17:15:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:16,740 INFO L225 Difference]: With dead ends: 8734 [2022-11-25 17:15:16,740 INFO L226 Difference]: Without dead ends: 3722 [2022-11-25 17:15:16,751 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-25 17:15:16,751 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-25 17:15:16,752 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-25 17:15:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-11-25 17:15:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3719. [2022-11-25 17:15:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3031 states have (on average 1.1956450016496205) internal successors, (3624), 3059 states have internal predecessors, (3624), 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-25 17:15:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4567 transitions. [2022-11-25 17:15:17,097 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4567 transitions. Word has length 151 [2022-11-25 17:15:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:17,097 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 4567 transitions. [2022-11-25 17:15:17,098 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-25 17:15:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4567 transitions. [2022-11-25 17:15:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 17:15:17,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:17,105 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, 1] [2022-11-25 17:15:17,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 17:15:17,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:15:17,310 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash -845187855, now seen corresponding path program 1 times [2022-11-25 17:15:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:17,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470496321] [2022-11-25 17:15:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:15:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:15:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:15:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:15:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:15:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:15:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:15:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,546 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-25 17:15:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470496321] [2022-11-25 17:15:17,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470496321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955130074] [2022-11-25 17:15:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:17,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:17,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:15:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:17,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:17,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:17,713 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-25 17:15:17,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:17,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955130074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:17,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:17,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-25 17:15:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237408259] [2022-11-25 17:15:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:17,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:17,716 INFO L87 Difference]: Start difference. First operand 3719 states and 4567 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-25 17:15:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:18,178 INFO L93 Difference]: Finished difference Result 8907 states and 10999 transitions. [2022-11-25 17:15:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 164 [2022-11-25 17:15:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:18,199 INFO L225 Difference]: With dead ends: 8907 [2022-11-25 17:15:18,199 INFO L226 Difference]: Without dead ends: 5738 [2022-11-25 17:15:18,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 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-25 17:15:18,208 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-25 17:15:18,209 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-25 17:15:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2022-11-25 17:15:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5728. [2022-11-25 17:15:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 4712 states have (on average 1.1808149405772497) internal successors, (5564), 4751 states have internal predecessors, (5564), 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-25 17:15:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 6941 transitions. [2022-11-25 17:15:18,722 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 6941 transitions. Word has length 164 [2022-11-25 17:15:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:18,722 INFO L495 AbstractCegarLoop]: Abstraction has 5728 states and 6941 transitions. [2022-11-25 17:15:18,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-25 17:15:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 6941 transitions. [2022-11-25 17:15:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 17:15:18,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:18,729 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, 1] [2022-11-25 17:15:18,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:18,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:15:18,936 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 52205423, now seen corresponding path program 1 times [2022-11-25 17:15:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:18,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771375877] [2022-11-25 17:15:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:15:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:15:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:15:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:15:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:15:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:15:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:15:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,153 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-25 17:15:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771375877] [2022-11-25 17:15:19,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771375877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:19,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229046813] [2022-11-25 17:15:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:19,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:19,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:15:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:15:19,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:19,339 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-25 17:15:19,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:19,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229046813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:19,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:19,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-11-25 17:15:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201825397] [2022-11-25 17:15:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:15:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:15:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:15:19,343 INFO L87 Difference]: Start difference. First operand 5728 states and 6941 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 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-25 17:15:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:19,810 INFO L93 Difference]: Finished difference Result 9257 states and 11268 transitions. [2022-11-25 17:15:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:19,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 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 164 [2022-11-25 17:15:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:19,824 INFO L225 Difference]: With dead ends: 9257 [2022-11-25 17:15:19,825 INFO L226 Difference]: Without dead ends: 3544 [2022-11-25 17:15:19,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:15:19,837 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-25 17:15:19,837 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-25 17:15:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2022-11-25 17:15:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3364. [2022-11-25 17:15:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2871 states have (on average 1.1894810170672239) internal successors, (3415), 2884 states have internal predecessors, (3415), 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-25 17:15:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4071 transitions. [2022-11-25 17:15:20,085 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4071 transitions. Word has length 164 [2022-11-25 17:15:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:20,085 INFO L495 AbstractCegarLoop]: Abstraction has 3364 states and 4071 transitions. [2022-11-25 17:15:20,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 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-25 17:15:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4071 transitions. [2022-11-25 17:15:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-25 17:15:20,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:20,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:20,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:20,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:15:20,301 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 471572056, now seen corresponding path program 1 times [2022-11-25 17:15:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:20,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209429036] [2022-11-25 17:15:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:15:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 17:15:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:15:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 17:15:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 17:15:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:20,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209429036] [2022-11-25 17:15:20,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209429036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:20,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623917680] [2022-11-25 17:15:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:20,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:20,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:15:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:20,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-25 17:15:20,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623917680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:20,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:20,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-25 17:15:20,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461315548] [2022-11-25 17:15:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:20,700 INFO L87 Difference]: Start difference. First operand 3364 states and 4071 transitions. Second operand has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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-25 17:15:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:20,970 INFO L93 Difference]: Finished difference Result 3364 states and 4071 transitions. [2022-11-25 17:15:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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 168 [2022-11-25 17:15:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:20,981 INFO L225 Difference]: With dead ends: 3364 [2022-11-25 17:15:20,981 INFO L226 Difference]: Without dead ends: 3362 [2022-11-25 17:15:20,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 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-25 17:15:20,984 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 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-25 17:15:20,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2022-11-25 17:15:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3362. [2022-11-25 17:15:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 2871 states have (on average 1.1818181818181819) internal successors, (3393), 2882 states have internal predecessors, (3393), 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-25 17:15:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4049 transitions. [2022-11-25 17:15:21,236 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4049 transitions. Word has length 168 [2022-11-25 17:15:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:21,237 INFO L495 AbstractCegarLoop]: Abstraction has 3362 states and 4049 transitions. [2022-11-25 17:15:21,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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-25 17:15:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4049 transitions. [2022-11-25 17:15:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 17:15:21,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:21,241 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-25 17:15:21,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:21,448 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-25 17:15:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1404056422, now seen corresponding path program 1 times [2022-11-25 17:15:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091759073] [2022-11-25 17:15:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:15:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 17:15:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:15:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 17:15:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,563 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-25 17:15:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091759073] [2022-11-25 17:15:21,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091759073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117849546] [2022-11-25 17:15:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:21,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:21,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:15:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:21,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:21,743 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-25 17:15:21,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:21,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117849546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:21,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:21,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-25 17:15:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105014882] [2022-11-25 17:15:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:21,746 INFO L87 Difference]: Start difference. First operand 3362 states and 4049 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-25 17:15:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:22,003 INFO L93 Difference]: Finished difference Result 5976 states and 7312 transitions. [2022-11-25 17:15:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:22,004 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-25 17:15:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:22,015 INFO L225 Difference]: With dead ends: 5976 [2022-11-25 17:15:22,016 INFO L226 Difference]: Without dead ends: 3283 [2022-11-25 17:15:22,021 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-25 17:15:22,022 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-25 17:15:22,023 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-25 17:15:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2022-11-25 17:15:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3282. [2022-11-25 17:15:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2791 states have (on average 1.171981368685059) internal successors, (3271), 2802 states have internal predecessors, (3271), 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-25 17:15:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 3927 transitions. [2022-11-25 17:15:22,282 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 3927 transitions. Word has length 169 [2022-11-25 17:15:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:22,282 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 3927 transitions. [2022-11-25 17:15:22,283 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-25 17:15:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 3927 transitions. [2022-11-25 17:15:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-25 17:15:22,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:22,288 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-25 17:15:22,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:22,494 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-25 17:15:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1943202269, now seen corresponding path program 1 times [2022-11-25 17:15:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174763672] [2022-11-25 17:15:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,650 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-25 17:15:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:22,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174763672] [2022-11-25 17:15:22,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174763672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:22,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558045304] [2022-11-25 17:15:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:22,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:22,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:15:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:22,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:23,072 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-25 17:15:23,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:23,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558045304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:23,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:23,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 17:15:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932466386] [2022-11-25 17:15:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:23,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:23,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:23,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:23,075 INFO L87 Difference]: Start difference. First operand 3282 states and 3927 transitions. Second operand has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 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-25 17:15:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:23,367 INFO L93 Difference]: Finished difference Result 3283 states and 3927 transitions. [2022-11-25 17:15:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:15:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 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 170 [2022-11-25 17:15:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:23,377 INFO L225 Difference]: With dead ends: 3283 [2022-11-25 17:15:23,378 INFO L226 Difference]: Without dead ends: 3281 [2022-11-25 17:15:23,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 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-25 17:15:23,380 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:23,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 309 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-11-25 17:15:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3280. [2022-11-25 17:15:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2791 states have (on average 1.1648154783231817) internal successors, (3251), 2800 states have internal predecessors, (3251), 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-25 17:15:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 3907 transitions. [2022-11-25 17:15:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 3907 transitions. Word has length 170 [2022-11-25 17:15:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:23,640 INFO L495 AbstractCegarLoop]: Abstraction has 3280 states and 3907 transitions. [2022-11-25 17:15:23,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 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-25 17:15:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3907 transitions. [2022-11-25 17:15:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-25 17:15:23,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:23,645 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-25 17:15:23,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:23,851 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-25 17:15:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash 109728449, now seen corresponding path program 1 times [2022-11-25 17:15:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:23,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301660174] [2022-11-25 17:15:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,033 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-25 17:15:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301660174] [2022-11-25 17:15:24,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301660174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633709387] [2022-11-25 17:15:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:24,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:24,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:15:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:24,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:24,432 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-25 17:15:24,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:15:24,642 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-25 17:15:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633709387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:15:24,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:15:24,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-25 17:15:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625042374] [2022-11-25 17:15:24,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:15:24,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:15:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:15:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:24,645 INFO L87 Difference]: Start difference. First operand 3280 states and 3907 transitions. Second operand has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-25 17:15:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:26,197 INFO L93 Difference]: Finished difference Result 10629 states and 12813 transitions. [2022-11-25 17:15:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:15:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 171 [2022-11-25 17:15:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:26,245 INFO L225 Difference]: With dead ends: 10629 [2022-11-25 17:15:26,245 INFO L226 Difference]: Without dead ends: 10621 [2022-11-25 17:15:26,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 369 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-25 17:15:26,254 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 582 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:26,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 647 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2022-11-25 17:15:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 8614. [2022-11-25 17:15:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 7397 states have (on average 1.173043125591456) internal successors, (8677), 7420 states have internal predecessors, (8677), 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-25 17:15:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 10425 transitions. [2022-11-25 17:15:27,172 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 10425 transitions. Word has length 171 [2022-11-25 17:15:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:27,173 INFO L495 AbstractCegarLoop]: Abstraction has 8614 states and 10425 transitions. [2022-11-25 17:15:27,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-25 17:15:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 10425 transitions. [2022-11-25 17:15:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-25 17:15:27,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:27,178 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, 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] [2022-11-25 17:15:27,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:27,384 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 387884551, now seen corresponding path program 1 times [2022-11-25 17:15:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:27,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730128976] [2022-11-25 17:15:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-25 17:15:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:27,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730128976] [2022-11-25 17:15:27,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730128976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:27,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:27,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:15:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933112701] [2022-11-25 17:15:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:27,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:27,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:27,502 INFO L87 Difference]: Start difference. First operand 8614 states and 10425 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-25 17:15:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:28,398 INFO L93 Difference]: Finished difference Result 8826 states and 10658 transitions. [2022-11-25 17:15:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:15:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 180 [2022-11-25 17:15:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:28,425 INFO L225 Difference]: With dead ends: 8826 [2022-11-25 17:15:28,426 INFO L226 Difference]: Without dead ends: 8825 [2022-11-25 17:15:28,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:28,429 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 162 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:28,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 191 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2022-11-25 17:15:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8613. [2022-11-25 17:15:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 7397 states have (on average 1.1692578072191429) internal successors, (8649), 7419 states have internal predecessors, (8649), 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-25 17:15:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 10397 transitions. [2022-11-25 17:15:29,042 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 10397 transitions. Word has length 180 [2022-11-25 17:15:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 8613 states and 10397 transitions. [2022-11-25 17:15:29,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-25 17:15:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 10397 transitions. [2022-11-25 17:15:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-25 17:15:29,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:29,057 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:29,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:15:29,057 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -640957901, now seen corresponding path program 1 times [2022-11-25 17:15:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:29,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712556494] [2022-11-25 17:15:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:15:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 17:15:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:15:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:15:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 17:15:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 17:15:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:15:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 17:15:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 17:15:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 17:15:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-25 17:15:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:15:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 17:15:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:15:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-25 17:15:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:29,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712556494] [2022-11-25 17:15:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712556494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053877577] [2022-11-25 17:15:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:29,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:29,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:29,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:15:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:29,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:29,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-25 17:15:29,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053877577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:29,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 17:15:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861647047] [2022-11-25 17:15:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:29,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:29,458 INFO L87 Difference]: Start difference. First operand 8613 states and 10397 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-25 17:15:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:30,605 INFO L93 Difference]: Finished difference Result 22121 states and 26779 transitions. [2022-11-25 17:15:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 235 [2022-11-25 17:15:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:30,654 INFO L225 Difference]: With dead ends: 22121 [2022-11-25 17:15:30,654 INFO L226 Difference]: Without dead ends: 13878 [2022-11-25 17:15:30,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 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-25 17:15:30,676 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-25 17:15:30,676 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-25 17:15:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2022-11-25 17:15:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 13761. [2022-11-25 17:15:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13761 states, 11791 states have (on average 1.1635993554405903) internal successors, (13720), 11813 states have internal predecessors, (13720), 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-25 17:15:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 16544 transitions. [2022-11-25 17:15:31,657 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 16544 transitions. Word has length 235 [2022-11-25 17:15:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:31,658 INFO L495 AbstractCegarLoop]: Abstraction has 13761 states and 16544 transitions. [2022-11-25 17:15:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-25 17:15:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 16544 transitions. [2022-11-25 17:15:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-25 17:15:31,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:31,673 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:31,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:31,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 17:15:31,879 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash -973601039, now seen corresponding path program 1 times [2022-11-25 17:15:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239926383] [2022-11-25 17:15:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:15:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 17:15:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:15:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:15:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 17:15:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 17:15:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:15:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 17:15:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 17:15:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 17:15:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-25 17:15:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:15:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 17:15:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:15:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-25 17:15:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239926383] [2022-11-25 17:15:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239926383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151902605] [2022-11-25 17:15:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:32,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:32,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:15:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:32,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:32,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-25 17:15:32,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:32,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151902605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:32,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:32,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 17:15:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103243964] [2022-11-25 17:15:32,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:32,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:32,219 INFO L87 Difference]: Start difference. First operand 13761 states and 16544 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-25 17:15:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:32,671 INFO L93 Difference]: Finished difference Result 19280 states and 23230 transitions. [2022-11-25 17:15:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:32,671 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 235 [2022-11-25 17:15:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:32,692 INFO L225 Difference]: With dead ends: 19280 [2022-11-25 17:15:32,692 INFO L226 Difference]: Without dead ends: 5835 [2022-11-25 17:15:32,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 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-25 17:15:32,715 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-25 17:15:32,716 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-25 17:15:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2022-11-25 17:15:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5584. [2022-11-25 17:15:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 4745 states have (on average 1.144994731296101) internal successors, (5433), 4763 states have internal predecessors, (5433), 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-25 17:15:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 6628 transitions. [2022-11-25 17:15:33,262 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 6628 transitions. Word has length 235 [2022-11-25 17:15:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:33,263 INFO L495 AbstractCegarLoop]: Abstraction has 5584 states and 6628 transitions. [2022-11-25 17:15:33,264 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-25 17:15:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 6628 transitions. [2022-11-25 17:15:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-11-25 17:15:33,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:33,274 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:33,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:33,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 17:15:33,482 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1947915389, now seen corresponding path program 1 times [2022-11-25 17:15:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:33,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898134447] [2022-11-25 17:15:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:15:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 17:15:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:15:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:15:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 17:15:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 17:15:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:15:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 17:15:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 17:15:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 17:15:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 17:15:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 17:15:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-25 17:15:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-25 17:15:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:15:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 40 proven. 54 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2022-11-25 17:15:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:33,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898134447] [2022-11-25 17:15:33,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898134447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237046664] [2022-11-25 17:15:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:33,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:33,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:15:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:33,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:15:33,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-25 17:15:34,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:15:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-25 17:15:34,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237046664] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:15:34,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:15:34,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-25 17:15:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840815396] [2022-11-25 17:15:34,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:15:34,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:15:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:15:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:34,401 INFO L87 Difference]: Start difference. First operand 5584 states and 6628 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-25 17:15:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:35,918 INFO L93 Difference]: Finished difference Result 16476 states and 20380 transitions. [2022-11-25 17:15:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:15:35,919 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 258 [2022-11-25 17:15:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:35,955 INFO L225 Difference]: With dead ends: 16476 [2022-11-25 17:15:35,955 INFO L226 Difference]: Without dead ends: 11128 [2022-11-25 17:15:35,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 565 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-25 17:15:35,971 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 478 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1252 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:15:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11128 states. [2022-11-25 17:15:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11128 to 7121. [2022-11-25 17:15:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 6025 states have (on average 1.1266390041493777) internal successors, (6788), 6060 states have internal predecessors, (6788), 603 states have call successors, (603), 408 states have call predecessors, (603), 490 states have return successors, (818), 652 states have call predecessors, (818), 603 states have call successors, (818) [2022-11-25 17:15:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 8209 transitions. [2022-11-25 17:15:36,762 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 8209 transitions. Word has length 258 [2022-11-25 17:15:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:36,763 INFO L495 AbstractCegarLoop]: Abstraction has 7121 states and 8209 transitions. [2022-11-25 17:15:36,763 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-25 17:15:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 8209 transitions. [2022-11-25 17:15:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-25 17:15:36,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:36,771 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:36,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:36,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 17:15:36,985 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641919, now seen corresponding path program 1 times [2022-11-25 17:15:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:36,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309034843] [2022-11-25 17:15:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:15:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 17:15:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:15:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:15:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:15:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 17:15:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 17:15:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 17:15:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-25 17:15:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 17:15:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-25 17:15:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-25 17:15:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-25 17:15:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-25 17:15:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 17:15:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:15:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-11-25 17:15:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:37,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309034843] [2022-11-25 17:15:37,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309034843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:37,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:37,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858444107] [2022-11-25 17:15:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:37,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:37,107 INFO L87 Difference]: Start difference. First operand 7121 states and 8209 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-25 17:15:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:37,680 INFO L93 Difference]: Finished difference Result 7424 states and 8547 transitions. [2022-11-25 17:15:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:15:37,681 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 260 [2022-11-25 17:15:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:37,695 INFO L225 Difference]: With dead ends: 7424 [2022-11-25 17:15:37,695 INFO L226 Difference]: Without dead ends: 7140 [2022-11-25 17:15:37,698 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-25 17:15:37,699 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-25 17:15:37,699 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-25 17:15:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2022-11-25 17:15:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 7096. [2022-11-25 17:15:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 6006 states have (on average 1.126873126873127) internal successors, (6768), 6041 states have internal predecessors, (6768), 600 states have call successors, (600), 405 states have call predecessors, (600), 487 states have return successors, (815), 649 states have call predecessors, (815), 600 states have call successors, (815) [2022-11-25 17:15:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 8183 transitions. [2022-11-25 17:15:38,311 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 8183 transitions. Word has length 260 [2022-11-25 17:15:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:38,312 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 8183 transitions. [2022-11-25 17:15:38,312 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-25 17:15:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 8183 transitions. [2022-11-25 17:15:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-11-25 17:15:38,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:38,320 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 17:15:38,321 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1989544471, now seen corresponding path program 1 times [2022-11-25 17:15:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:38,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242474433] [2022-11-25 17:15:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:15:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:15:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 17:15:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:15:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 17:15:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 17:15:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 17:15:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 17:15:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 17:15:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 17:15:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 17:15:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-25 17:15:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 17:15:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:15:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-25 17:15:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:15:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:15:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-11-25 17:15:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:38,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242474433] [2022-11-25 17:15:38,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242474433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:38,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:38,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971210141] [2022-11-25 17:15:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:38,543 INFO L87 Difference]: Start difference. First operand 7096 states and 8183 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-25 17:15:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:39,083 INFO L93 Difference]: Finished difference Result 7141 states and 8238 transitions. [2022-11-25 17:15:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:39,084 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 265 [2022-11-25 17:15:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:39,101 INFO L225 Difference]: With dead ends: 7141 [2022-11-25 17:15:39,101 INFO L226 Difference]: Without dead ends: 6878 [2022-11-25 17:15:39,106 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-25 17:15:39,106 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-25 17:15:39,107 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-25 17:15:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2022-11-25 17:15:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6834. [2022-11-25 17:15:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 5782 states have (on average 1.1281563472846765) internal successors, (6523), 5817 states have internal predecessors, (6523), 579 states have call successors, (579), 390 states have call predecessors, (579), 470 states have return successors, (792), 626 states have call predecessors, (792), 579 states have call successors, (792) [2022-11-25 17:15:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 7894 transitions. [2022-11-25 17:15:39,772 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 7894 transitions. Word has length 265 [2022-11-25 17:15:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:39,772 INFO L495 AbstractCegarLoop]: Abstraction has 6834 states and 7894 transitions. [2022-11-25 17:15:39,773 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-25 17:15:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 7894 transitions. [2022-11-25 17:15:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-25 17:15:39,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:39,781 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:39,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:15:39,782 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1246222312, now seen corresponding path program 1 times [2022-11-25 17:15:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:39,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698244533] [2022-11-25 17:15:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 17:15:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 17:15:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-25 17:15:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 17:15:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:15:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 17:15:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 17:15:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:15:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-25 17:15:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-11-25 17:15:39,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:39,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698244533] [2022-11-25 17:15:39,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698244533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:39,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227899731] [2022-11-25 17:15:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:39,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:39,956 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:39,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:15:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:15:40,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 17:15:40,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:40,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227899731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:40,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:40,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-25 17:15:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305589295] [2022-11-25 17:15:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:40,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:40,246 INFO L87 Difference]: Start difference. First operand 6834 states and 7894 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-25 17:15:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:40,557 INFO L93 Difference]: Finished difference Result 10944 states and 12661 transitions. [2022-11-25 17:15:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 274 [2022-11-25 17:15:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:40,566 INFO L225 Difference]: With dead ends: 10944 [2022-11-25 17:15:40,566 INFO L226 Difference]: Without dead ends: 4317 [2022-11-25 17:15:40,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 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-25 17:15:40,574 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-25 17:15:40,575 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-25 17:15:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2022-11-25 17:15:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4150. [2022-11-25 17:15:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4150 states, 3595 states have (on average 1.1226703755215577) internal successors, (4036), 3597 states have internal predecessors, (4036), 301 states have call successors, (301), 204 states have call predecessors, (301), 251 states have return successors, (381), 348 states have call predecessors, (381), 301 states have call successors, (381) [2022-11-25 17:15:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 4718 transitions. [2022-11-25 17:15:40,905 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 4718 transitions. Word has length 274 [2022-11-25 17:15:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 4150 states and 4718 transitions. [2022-11-25 17:15:40,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-25 17:15:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 4718 transitions. [2022-11-25 17:15:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-25 17:15:40,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:40,911 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:40,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 17:15:41,117 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1802388562, now seen corresponding path program 1 times [2022-11-25 17:15:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647035099] [2022-11-25 17:15:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 17:15:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 17:15:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-25 17:15:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 17:15:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:15:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-25 17:15:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-25 17:15:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:15:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:15:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2022-11-25 17:15:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647035099] [2022-11-25 17:15:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647035099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638942820] [2022-11-25 17:15:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:41,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:41,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:41,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:15:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:41,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:15:41,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-25 17:15:41,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:41,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638942820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:41,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:41,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-25 17:15:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944955115] [2022-11-25 17:15:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:15:41,478 INFO L87 Difference]: Start difference. First operand 4150 states and 4718 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-25 17:15:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:41,864 INFO L93 Difference]: Finished difference Result 7902 states and 9043 transitions. [2022-11-25 17:15:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:41,864 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 275 [2022-11-25 17:15:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:41,874 INFO L225 Difference]: With dead ends: 7902 [2022-11-25 17:15:41,875 INFO L226 Difference]: Without dead ends: 3853 [2022-11-25 17:15:41,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 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-25 17:15:41,881 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-25 17:15:41,881 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-25 17:15:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2022-11-25 17:15:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2022-11-25 17:15:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3342 states have (on average 1.1187911430281268) internal successors, (3739), 3344 states have internal predecessors, (3739), 290 states have call successors, (290), 204 states have call predecessors, (290), 218 states have return successors, (326), 304 states have call predecessors, (326), 290 states have call successors, (326) [2022-11-25 17:15:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4355 transitions. [2022-11-25 17:15:42,312 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4355 transitions. Word has length 275 [2022-11-25 17:15:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:42,312 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 4355 transitions. [2022-11-25 17:15:42,312 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-25 17:15:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4355 transitions. [2022-11-25 17:15:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-25 17:15:42,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:42,318 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, 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, 1, 1] [2022-11-25 17:15:42,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:42,524 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash -186625837, now seen corresponding path program 1 times [2022-11-25 17:15:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:42,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976092805] [2022-11-25 17:15:42,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:42,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 17:15:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 17:15:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:15:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 17:15:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 17:15:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:15:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 17:15:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 17:15:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-25 17:15:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 17:15:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-25 17:15:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 17:15:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 17:15:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:15:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:15:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:15:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:15:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 17:15:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-25 17:15:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:42,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976092805] [2022-11-25 17:15:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976092805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229256187] [2022-11-25 17:15:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:42,639 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:42,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:15:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:42,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:42,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-11-25 17:15:42,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:42,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229256187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-25 17:15:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734112033] [2022-11-25 17:15:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:42,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:42,875 INFO L87 Difference]: Start difference. First operand 3853 states and 4355 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-25 17:15:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:43,195 INFO L93 Difference]: Finished difference Result 4221 states and 4774 transitions. [2022-11-25 17:15:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:43,195 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 279 [2022-11-25 17:15:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:43,201 INFO L225 Difference]: With dead ends: 4221 [2022-11-25 17:15:43,201 INFO L226 Difference]: Without dead ends: 3854 [2022-11-25 17:15:43,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 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-25 17:15:43,204 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-25 17:15:43,204 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-25 17:15:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2022-11-25 17:15:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3853. [2022-11-25 17:15:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3342 states have (on average 1.116098144823459) internal successors, (3730), 3344 states have internal predecessors, (3730), 290 states have call successors, (290), 204 states have call predecessors, (290), 218 states have return successors, (326), 304 states have call predecessors, (326), 290 states have call successors, (326) [2022-11-25 17:15:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4346 transitions. [2022-11-25 17:15:43,482 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4346 transitions. Word has length 279 [2022-11-25 17:15:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:43,483 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 4346 transitions. [2022-11-25 17:15:43,483 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-25 17:15:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4346 transitions. [2022-11-25 17:15:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-11-25 17:15:43,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:43,488 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:43,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:43,694 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1869725543, now seen corresponding path program 1 times [2022-11-25 17:15:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:43,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202902717] [2022-11-25 17:15:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 17:15:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 17:15:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:15:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:15:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:15:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-25 17:15:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-25 17:15:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:15:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:15:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-11-25 17:15:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202902717] [2022-11-25 17:15:43,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202902717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:43,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:43,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830071917] [2022-11-25 17:15:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:43,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:43,831 INFO L87 Difference]: Start difference. First operand 3853 states and 4346 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-25 17:15:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:44,309 INFO L93 Difference]: Finished difference Result 6211 states and 7002 transitions. [2022-11-25 17:15:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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 282 [2022-11-25 17:15:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:44,319 INFO L225 Difference]: With dead ends: 6211 [2022-11-25 17:15:44,319 INFO L226 Difference]: Without dead ends: 3727 [2022-11-25 17:15:44,324 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-25 17:15:44,325 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-25 17:15:44,325 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-25 17:15:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2022-11-25 17:15:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3721. [2022-11-25 17:15:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3218 states have (on average 1.1084524549409571) internal successors, (3567), 3220 states have internal predecessors, (3567), 286 states have call successors, (286), 200 states have call predecessors, (286), 214 states have return successors, (322), 300 states have call predecessors, (322), 286 states have call successors, (322) [2022-11-25 17:15:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4175 transitions. [2022-11-25 17:15:44,663 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4175 transitions. Word has length 282 [2022-11-25 17:15:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:44,664 INFO L495 AbstractCegarLoop]: Abstraction has 3721 states and 4175 transitions. [2022-11-25 17:15:44,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-25 17:15:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4175 transitions. [2022-11-25 17:15:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-25 17:15:44,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:44,667 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, 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, 1, 1, 1] [2022-11-25 17:15:44,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 17:15:44,667 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1724621831, now seen corresponding path program 1 times [2022-11-25 17:15:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380259478] [2022-11-25 17:15:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:15:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 17:15:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 17:15:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:15:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 17:15:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:15:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:15:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:15:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 17:15:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:15:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 17:15:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 17:15:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:15:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:15:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:15:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-25 17:15:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-25 17:15:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:15:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:15:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-11-25 17:15:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:44,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380259478] [2022-11-25 17:15:44,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380259478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:44,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:44,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816943542] [2022-11-25 17:15:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:44,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:44,806 INFO L87 Difference]: Start difference. First operand 3721 states and 4175 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-25 17:15:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:45,266 INFO L93 Difference]: Finished difference Result 3721 states and 4175 transitions. [2022-11-25 17:15:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 283 [2022-11-25 17:15:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:45,272 INFO L225 Difference]: With dead ends: 3721 [2022-11-25 17:15:45,272 INFO L226 Difference]: Without dead ends: 3333 [2022-11-25 17:15:45,273 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-25 17:15:45,274 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 164 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 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-25 17:15:45,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 488 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2022-11-25 17:15:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2337. [2022-11-25 17:15:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2011 states have (on average 1.1004475385380408) internal successors, (2213), 2012 states have internal predecessors, (2213), 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-25 17:15:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 2609 transitions. [2022-11-25 17:15:45,497 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 2609 transitions. Word has length 283 [2022-11-25 17:15:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:45,498 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 2609 transitions. [2022-11-25 17:15:45,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-25 17:15:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2609 transitions. [2022-11-25 17:15:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2022-11-25 17:15:45,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:45,503 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, 1] [2022-11-25 17:15:45,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 17:15:45,503 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2102387823, now seen corresponding path program 1 times [2022-11-25 17:15:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421038048] [2022-11-25 17:15:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:15:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 17:15:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:15:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:15:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 17:15:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 17:15:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:15:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:15:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-25 17:15:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:15:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 17:15:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-25 17:15:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:15:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-25 17:15:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:15:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-25 17:15:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-25 17:15:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-25 17:15:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:15:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-25 17:15:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-25 17:15:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-11-25 17:15:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-11-25 17:15:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-11-25 17:15:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-25 17:15:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-25 17:15:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-11-25 17:15:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-25 17:15:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-11-25 17:15:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2022-11-25 17:15:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-11-25 17:15:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,721 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-25 17:15:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:45,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421038048] [2022-11-25 17:15:45,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421038048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:45,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225419142] [2022-11-25 17:15:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:45,724 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:45,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:15:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:45,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:15:45,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:46,058 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-25 17:15:46,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:46,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225419142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:46,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:46,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-11-25 17:15:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530564936] [2022-11-25 17:15:46,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:46,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:46,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:46,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:46,061 INFO L87 Difference]: Start difference. First operand 2337 states and 2609 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-25 17:15:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:46,173 INFO L93 Difference]: Finished difference Result 3558 states and 3992 transitions. [2022-11-25 17:15:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 504 [2022-11-25 17:15:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:46,176 INFO L225 Difference]: With dead ends: 3558 [2022-11-25 17:15:46,176 INFO L226 Difference]: Without dead ends: 1468 [2022-11-25 17:15:46,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 586 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-25 17:15:46,179 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 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-25 17:15:46,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-11-25 17:15:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2022-11-25 17:15:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1278 states have (on average 1.0907668231611893) internal successors, (1394), 1279 states have internal predecessors, (1394), 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-25 17:15:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1614 transitions. [2022-11-25 17:15:46,283 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1614 transitions. Word has length 504 [2022-11-25 17:15:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:46,284 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 1614 transitions. [2022-11-25 17:15:46,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-25 17:15:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1614 transitions. [2022-11-25 17:15:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2022-11-25 17:15:46,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:46,287 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, 1] [2022-11-25 17:15:46,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:46,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:46,488 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 568111464, now seen corresponding path program 1 times [2022-11-25 17:15:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893562967] [2022-11-25 17:15:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-25 17:15:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-25 17:15:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-25 17:15:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 17:15:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 17:15:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:15:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-25 17:15:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-25 17:15:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:15:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 17:15:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-25 17:15:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-25 17:15:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-25 17:15:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-25 17:15:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:15:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-25 17:15:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-25 17:15:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-11-25 17:15:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-25 17:15:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-11-25 17:15:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-11-25 17:15:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-25 17:15:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-11-25 17:15:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2022-11-25 17:15:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-25 17:15:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-11-25 17:15:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2022-11-25 17:15:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2022-11-25 17:15:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:46,780 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-25 17:15:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893562967] [2022-11-25 17:15:46,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893562967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527113861] [2022-11-25 17:15:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:46,782 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:46,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:15:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:15:47,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:47,064 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-25 17:15:47,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:47,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527113861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:47,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:47,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-25 17:15:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873148919] [2022-11-25 17:15:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:15:47,067 INFO L87 Difference]: Start difference. First operand 1468 states and 1614 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-25 17:15:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:47,190 INFO L93 Difference]: Finished difference Result 2678 states and 2958 transitions. [2022-11-25 17:15:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 507 [2022-11-25 17:15:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:47,192 INFO L225 Difference]: With dead ends: 2678 [2022-11-25 17:15:47,192 INFO L226 Difference]: Without dead ends: 1292 [2022-11-25 17:15:47,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 591 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-25 17:15:47,194 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 30 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 514 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-25 17:15:47,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 514 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-11-25 17:15:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2022-11-25 17:15:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1118 states have (on average 1.0894454382826475) internal successors, (1218), 1119 states have internal predecessors, (1218), 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-25 17:15:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1414 transitions. [2022-11-25 17:15:47,290 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1414 transitions. Word has length 507 [2022-11-25 17:15:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:47,291 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1414 transitions. [2022-11-25 17:15:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-25 17:15:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1414 transitions. [2022-11-25 17:15:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2022-11-25 17:15:47,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:47,296 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, 1] [2022-11-25 17:15:47,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:47,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 17:15:47,497 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -558889430, now seen corresponding path program 1 times [2022-11-25 17:15:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:47,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049767055] [2022-11-25 17:15:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-25 17:15:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 17:15:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-25 17:15:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-25 17:15:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 17:15:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:15:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:15:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:15:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:15:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:15:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:15:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-25 17:15:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-25 17:15:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-11-25 17:15:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:15:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-25 17:15:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-11-25 17:15:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-11-25 17:15:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-11-25 17:15:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-11-25 17:15:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-11-25 17:15:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-11-25 17:15:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2022-11-25 17:15:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-11-25 17:15:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2022-11-25 17:15:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-11-25 17:15:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2022-11-25 17:15:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:47,669 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-25 17:15:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049767055] [2022-11-25 17:15:47,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049767055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:47,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:47,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605039071] [2022-11-25 17:15:47,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:47,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:47,672 INFO L87 Difference]: Start difference. First operand 1292 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-25 17:15:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:48,005 INFO L93 Difference]: Finished difference Result 2710 states and 2974 transitions. [2022-11-25 17:15:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 519 [2022-11-25 17:15:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:48,009 INFO L225 Difference]: With dead ends: 2710 [2022-11-25 17:15:48,009 INFO L226 Difference]: Without dead ends: 1071 [2022-11-25 17:15:48,011 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-25 17:15:48,018 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:48,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 407 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-11-25 17:15:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1063. [2022-11-25 17:15:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 916 states have (on average 1.0775109170305677) internal successors, (987), 917 states have internal predecessors, (987), 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-25 17:15:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1153 transitions. [2022-11-25 17:15:48,113 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1153 transitions. Word has length 519 [2022-11-25 17:15:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:48,113 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1153 transitions. [2022-11-25 17:15:48,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-25 17:15:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1153 transitions. [2022-11-25 17:15:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-11-25 17:15:48,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:48,118 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, 1] [2022-11-25 17:15:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 17:15:48,118 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:15:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1898490450, now seen corresponding path program 1 times [2022-11-25 17:15:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719743011] [2022-11-25 17:15:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:15:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:15:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:15:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:15:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:15:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:15:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:15:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:15:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:15:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:15:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:15:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:15:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 17:15:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-25 17:15:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-25 17:15:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 17:15:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-25 17:15:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-25 17:15:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 17:15:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-25 17:15:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-25 17:15:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-25 17:15:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-25 17:15:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-25 17:15:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-25 17:15:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-25 17:15:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-11-25 17:15:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:15:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-11-25 17:15:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-25 17:15:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-11-25 17:15:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2022-11-25 17:15:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-11-25 17:15:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-25 17:15:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-11-25 17:15:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-11-25 17:15:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-11-25 17:15:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2022-11-25 17:15:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2022-11-25 17:15:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2022-11-25 17:15:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,412 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-25 17:15:48,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:48,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719743011] [2022-11-25 17:15:48,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719743011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:48,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348800117] [2022-11-25 17:15:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:48,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:48,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:48,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:48,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:15:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:48,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:15:48,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:49,833 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-25 17:15:49,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:49,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348800117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:49,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:49,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2022-11-25 17:15:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133867457] [2022-11-25 17:15:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:49,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:49,837 INFO L87 Difference]: Start difference. First operand 1063 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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-25 17:15:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:49,974 INFO L93 Difference]: Finished difference Result 1067 states and 1157 transitions. [2022-11-25 17:15:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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 531 [2022-11-25 17:15:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:49,975 INFO L225 Difference]: With dead ends: 1067 [2022-11-25 17:15:49,976 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:15:49,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 609 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-25 17:15:49,978 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 34 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:49,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 460 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:15:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:15:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:15:49,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2022-11-25 17:15:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:49,980 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:15:49,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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-25 17:15:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:15:49,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:15:49,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 17:15:49,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 17:15:49,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 17:15:49,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 17:15:49,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 17:15:49,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 17:15:49,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 17:15:49,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 17:15:50,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:50,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 17:15:50,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:16:41,041 INFO L895 garLoopResultBuilder]: At program point L221(lines 195 223) the Hoare annotation is: (let ((.cse34 (<= ~max_loop~0 ~i~0)) (.cse43 (<= 1 ~P_1_pc~0)) (.cse46 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse37 (<= |activate_threads_is_C_1_triggered_#res#1| 0)) (.cse47 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse48 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse49 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse50 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse38 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse40 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse51 (<= |activate_threads_~tmp~1#1| 0)) (.cse45 (= ~P_1_pc~0 0)) (.cse41 (<= 0 |activate_threads_is_C_1_triggered_#res#1|)) (.cse42 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse44 (= ~P_1_st~0 0)) (.cse39 (= ~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|) .cse44 .cse39 (<= 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|))) (.cse22 (not (<= ~C_1_pc~0 1))) (.cse30 (and .cse46 .cse37 .cse47 .cse48 .cse49 .cse50 .cse38 .cse39 .cse40 .cse51 .cse45 .cse41 .cse42)) (.cse24 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse25 (and .cse46 .cse37 .cse47 .cse48 .cse49 .cse50 .cse38 .cse39 .cse40 .cse51 .cse41 .cse42)) (.cse26 (not .cse45)) (.cse16 (not (= ~num~0 0))) (.cse27 (not (= ~i~0 0))) (.cse1 (not (<= ~num~0 1))) (.cse31 (not (<= ~i~0 1))) (.cse32 (not (<= ~P_1_ev~0 0))) (.cse33 (not (<= ~C_1_ev~0 0))) (.cse5 (not (<= ~max_loop~0 2))) (.cse23 (and .cse37 .cse38 .cse44 .cse39 .cse43 .cse41 .cse42)) (.cse2 (not (= ~P_1_ev~0 1))) (.cse18 (and .cse37 .cse38 .cse39 .cse40 .cse43 .cse41 .cse42)) (.cse20 (not (= ~C_1_pc~0 1))) (.cse7 (not (= ~C_1_ev~0 1))) (.cse21 (not .cse43)) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (= ~C_1_pc~0 0))) (.cse15 (and .cse37 .cse38 (< 1 ~P_1_pc~0) .cse39 .cse40 .cse41 .cse42)) (.cse35 (not (<= 1 ~num~0))) (.cse17 (not (<= 2 ~C_1_ev~0))) (.cse36 (and .cse37 .cse38 .cse39 (<= 2 ~C_1_pc~0) .cse40 .cse41 .cse42)) (.cse0 (not (<= 1 ~i~0))) (.cse3 (not (= ~C_1_i~0 1))) (.cse28 (not (<= ~num~0 2147483647))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse19 (not (<= 2 ~P_1_ev~0))) (.cse29 (not .cse34)) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse8 (not (<= 0 ~num~0))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse12 (= |old(~C_1_st~0)| 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 .cse6 .cse24 .cse25 .cse11 .cse26 .cse16 .cse27) (or .cse0 .cse2 .cse3 .cse28 .cse4 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse6 .cse26 .cse12 .cse16 .cse30) (or .cse3 .cse18 (and (or .cse0 .cse1 .cse19 .cse6 .cse11 .cse12 .cse21) (or .cse0 .cse1 .cse6 .cse31 .cse11 .cse32 .cse12 .cse33 .cse21)) .cse20 .cse34 .cse35) (or .cse13 .cse22 .cse6 .cse15 .cse11 .cse12 .cse35) (or .cse22 .cse6 .cse11 .cse26 .cse12 .cse16 .cse30) (or .cse3 .cse24 .cse25 .cse11 (not (= ~max_loop~0 2)) .cse26 .cse32 .cse16 .cse33 (not .cse12) .cse27) (or .cse36 (and (or .cse17 .cse0 .cse1 .cse3 .cse4 .cse19 .cse6 .cse8 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse31 .cse11 .cse32 .cse12 .cse33)) .cse5 .cse10) (or .cse17 .cse0 .cse3 .cse18 .cse28 .cse19 .cse20 .cse6 .cse34 .cse11 .cse12 .cse35 .cse21) (or .cse23 .cse0 .cse2 .cse3 .cse18 .cse28 .cse20 .cse6 .cse7 .cse34 .cse11 .cse12 .cse35 .cse21) (or .cse13 .cse14 .cse6 .cse15 .cse12 .cse35) (or .cse17 .cse36 .cse0 .cse3 .cse28 .cse4 .cse19 .cse29 .cse6 .cse8 .cse10 .cse11 .cse12)))) [2022-11-25 17:16:41,041 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-11-25 17:16:41,041 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-11-25 17:16:41,042 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-11-25 17:16:41,042 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2022-11-25 17:16:41,042 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-11-25 17:16:41,042 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-11-25 17:16:41,042 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-11-25 17:16:41,043 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse35 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse36 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse37 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse38 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse39 (= ~P_1_pc~0 0))) (let ((.cse16 (and .cse35 .cse36 .cse37 .cse38 .cse39)) (.cse10 (not (<= ~i~0 1))) (.cse2 (not (<= ~num~0 1))) (.cse13 (not (<= ~max_loop~0 2))) (.cse29 (and .cse37 .cse38 (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse21 (not (= ~P_1_ev~0 1))) (.cse22 (and .cse37 .cse38)) (.cse23 (not (= ~C_1_pc~0 1))) (.cse24 (not (= ~C_1_ev~0 1))) (.cse25 (not (<= 1 ~P_1_pc~0))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse28 (not (<= ~num~0 2147483647))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse34 (not .cse26)) (.cse7 (not (<= 0 ~num~0))) (.cse14 (not (= ~P_1_pc~0 1))) (.cse17 (not (<= ~C_1_pc~0 1))) (.cse3 (not (= ~C_1_i~0 1))) (.cse32 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse8 (not (<= ~e~0 0))) (.cse18 (not .cse39)) (.cse11 (not (<= ~P_1_ev~0 0))) (.cse15 (and .cse35 .cse36 .cse37 .cse38)) (.cse19 (not (= ~num~0 0))) (.cse12 (not (<= ~C_1_ev~0 0))) (.cse33 (not (= ~i~0 0))) (.cse30 (<= ~P_1_pc~0 1)) (.cse31 (and .cse35 .cse36 (< 1 ~P_1_pc~0) .cse37 .cse38)) (.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 .cse30 .cse31 .cse20 .cse6 .cse9 .cse19) (or .cse6 .cse32 .cse8 .cse18 .cse15 .cse19 .cse33) (or .cse1 .cse21 .cse3 .cse28 .cse4 .cse34 .cse6 .cse24 .cse29 .cse7 .cse14 .cse8 .cse9) (or .cse1 .cse21 .cse3 .cse22 .cse28 .cse23 .cse6 .cse24 .cse26 .cse8 .cse9 .cse27 .cse25) (or .cse30 .cse31 .cse17 .cse6 .cse8 .cse9 .cse19) (or .cse0 .cse1 .cse3 .cse28 .cse4 .cse5 .cse34 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15) (or .cse30 .cse31 .cse17 .cse6 .cse8 .cse9 .cse27) (or .cse3 .cse32 .cse8 (not (= ~max_loop~0 2)) .cse18 .cse11 .cse15 .cse19 .cse12 (not .cse9) .cse33) (or .cse30 .cse31 .cse20 .cse6 .cse9 .cse27)))) [2022-11-25 17:16:41,044 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-11-25 17:16:41,044 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-11-25 17:16:41,045 INFO L895 garLoopResultBuilder]: At program point L129(lines 113 131) the Hoare annotation is: (let ((.cse41 (= ~P_1_pc~0 0)) (.cse7 (<= ~max_loop~0 ~i~0)) (.cse35 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse36 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse37 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse38 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse39 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse40 (= |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 .cse39 .cse40 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse18 (not (= ~P_1_ev~0 1))) (.cse28 (and .cse39 .cse40)) (.cse22 (not (= ~C_1_ev~0 1))) (.cse29 (<= ~P_1_pc~0 1)) (.cse32 (not (<= ~C_1_pc~0 1))) (.cse31 (and .cse35 .cse36 .cse37 .cse38 (< 1 ~P_1_pc~0) .cse39 .cse40)) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse3 (not (<= ~num~0 2147483647))) (.cse20 (not (= 2 ~C_1_pc~0))) (.cse34 (not .cse7)) (.cse23 (not (<= 0 ~num~0))) (.cse24 (not (= ~P_1_pc~0 1))) (.cse30 (not (= ~C_1_pc~0 0))) (.cse33 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse14 (not .cse41)) (.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 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)) (.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 .cse2 .cse19 .cse3 .cse20 .cse34 .cse6 .cse22 .cse23 .cse24 .cse8 .cse10) (or .cse1 .cse18 .cse2 .cse28 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse29 .cse32 .cse6 .cse31 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse34 .cse6 .cse23 .cse24 .cse8 .cse9 .cse10) (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-25 17:16:41,046 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse42 (= ~P_1_pc~0 0)) (.cse40 (<= 1 ~P_1_pc~0)) (.cse43 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse44 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse45 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse46 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse47 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse48 (<= |activate_threads_~tmp~1#1| 0)) (.cse37 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse39 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse41 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse49 (= ~P_1_st~0 0)) (.cse38 (= ~C_1_st~0 |old(~C_1_st~0)|))) (let ((.cse14 (not (<= ~max_loop~0 2))) (.cse33 (and (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|) .cse49 .cse38 (<= 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))) (.cse22 (<= ~P_1_pc~0 1)) (.cse23 (and .cse37 (< 1 ~P_1_pc~0) .cse38 .cse39 .cse41)) (.cse34 (not (<= ~C_1_pc~0 1))) (.cse25 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse26 (and .cse43 .cse44 .cse45 .cse46 .cse47 .cse37 .cse38 .cse39 .cse48 .cse41)) (.cse29 (not (= ~i~0 0))) (.cse16 (and .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse30 (not (= ~P_1_ev~0 1))) (.cse18 (not (= ~C_1_pc~0 1))) (.cse32 (not (= ~C_1_ev~0 1))) (.cse36 (and .cse37 .cse49 .cse38 .cse40 .cse41)) (.cse20 (not (<= 1 ~num~0))) (.cse21 (not .cse40)) (.cse24 (not (= ~C_1_pc~0 0))) (.cse35 (and .cse43 .cse44 .cse45 .cse46 .cse47 .cse37 .cse38 .cse39 .cse48 .cse42 .cse41)) (.cse27 (not .cse42)) (.cse28 (not (= ~num~0 0))) (.cse1 (not (<= 2 ~C_1_ev~0))) (.cse2 (not (<= 1 ~i~0))) (.cse4 (not (= ~C_1_i~0 1))) (.cse0 (and .cse37 .cse38 (<= 2 ~C_1_pc~0) .cse39 .cse40 .cse41)) (.cse17 (not (<= ~num~0 2147483647))) (.cse5 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 2 ~P_1_ev~0))) (.cse31 (not .cse19)) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse8 (not (<= 0 ~num~0))) (.cse15 (not (= ~P_1_pc~0 1))) (.cse9 (not (<= ~e~0 0))) (.cse10 (= |old(~C_1_st~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 .cse30 .cse4 .cse17 .cse5 .cse31 .cse7 .cse32 .cse8 .cse15 .cse9 .cse33 .cse10) (or .cse2 .cse3 .cse30 .cse4 .cse5 .cse14 .cse7 .cse32 .cse8 .cse15 .cse9 .cse33 .cse10) (or .cse34 .cse35 .cse7 .cse9 .cse27 .cse10 .cse28) (or .cse22 .cse23 .cse24 .cse7 .cse10 .cse28) (or .cse16 .cse2 .cse30 .cse4 .cse18 .cse7 .cse32 .cse36 .cse9 .cse10 .cse28 .cse21) (or .cse22 .cse23 .cse34 .cse7 .cse9 .cse10 .cse20) (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 .cse34 .cse7 .cse9 .cse10 .cse28) (or .cse7 .cse25 .cse26 .cse9 .cse27 .cse28 .cse29) (or .cse16 .cse2 .cse30 .cse4 .cse17 .cse18 .cse7 .cse32 .cse19 .cse36 .cse9 .cse10 .cse20 .cse21) (or .cse24 .cse35 .cse7 .cse27 .cse10 .cse28) (or .cse1 .cse2 .cse4 .cse0 .cse17 .cse5 .cse6 .cse31 .cse7 .cse8 .cse15 .cse9 .cse10)))) [2022-11-25 17:16:41,046 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-11-25 17:16:41,046 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-11-25 17:16:41,047 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 374 399) the Hoare annotation is: (let ((.cse8 (<= ~max_loop~0 ~i~0)) (.cse33 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse34 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse35 (= ~P_1_pc~0 0))) (let ((.cse23 (not (<= ~max_loop~0 2))) (.cse20 (and .cse33 .cse34 .cse35)) (.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))) (.cse17 (not (= ~P_1_ev~0 1))) (.cse6 (not (= ~C_1_pc~0 1))) (.cse18 (not (= ~C_1_ev~0 1))) (.cse12 (not (<= 1 ~P_1_pc~0))) (.cse31 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse19 (not .cse35)) (.cse15 (not (= ~num~0 0))) (.cse32 (not (= ~i~0 0))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse2 (not (= ~C_1_i~0 1))) (.cse3 (and .cse33 .cse34)) (.cse4 (not (<= ~num~0 2147483647))) (.cse22 (not (= 2 ~C_1_pc~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse30 (not .cse8)) (.cse24 (not (<= 0 ~num~0))) (.cse25 (not (= ~P_1_pc~0 1))) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (<= ~C_1_pc~0 1))) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse9 (not (<= ~e~0 0))) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse11 (not (<= 1 ~num~0))) (.cse16 (and (< 1 ~P_1_pc~0) .cse33 .cse34))) (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 .cse1 .cse17 .cse2 .cse3 .cse4 .cse22 .cse30 .cse7 .cse18 .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 .cse31 .cse9 (not (= ~max_loop~0 2)) .cse19 .cse27 .cse15 .cse28 (not .cse10) .cse32) (or .cse13 .cse29 .cse7 .cse10 .cse15 .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse7 .cse31 .cse9 .cse19 .cse15 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse30 .cse7 .cse24 .cse25 .cse9 .cse10) (or .cse13 .cse14 .cse7 .cse9 .cse10 .cse11 .cse16)))) [2022-11-25 17:16:41,047 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-11-25 17:16:41,048 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-11-25 17:16:41,048 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-11-25 17:16:41,048 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-11-25 17:16:41,048 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 269) the Hoare annotation is: true [2022-11-25 17:16:41,049 INFO L895 garLoopResultBuilder]: At program point L267(lines 251 269) the Hoare annotation is: (let ((.cse23 (= ~C_1_st~0 0)) (.cse26 (<= ~max_loop~0 ~i~0)) (.cse12 (= ~P_1_st~0 0))) (let ((.cse3 (not (= ~max_loop~0 2))) (.cse10 (not (= ~i~0 0))) (.cse11 (not (<= ~num~0 1))) (.cse19 (not (<= ~max_loop~0 2))) (.cse14 (not (<= 1 ~num~0))) (.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))) (.cse9 (not .cse12)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse15 (not (<= 2 ~C_1_ev~0))) (.cse16 (not (<= 1 ~i~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse21 (not (<= ~num~0 2147483647))) (.cse17 (not (= 2 ~C_1_pc~0))) (.cse18 (not (<= 2 ~P_1_ev~0))) (.cse22 (not .cse26)) (.cse20 (not (<= 0 ~num~0))) (.cse13 (not (= ~P_1_pc~0 1))) (.cse2 (not (<= ~e~0 0))) (.cse6 (not .cse23))) (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 .cse11 .cse1 .cse17 .cse18 .cse19 .cse20 .cse13 .cse2 .cse6 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse21 .cse17 .cse18 .cse22 .cse20 .cse13 .cse2 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse18 .cse24 .cse2 .cse7 .cse25 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse21 .cse17 .cse18 .cse12 .cse19 .cse13 .cse2 .cse6 .cse14) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse21 .cse18 .cse24 .cse26 .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 .cse21 .cse17 .cse18 .cse22 .cse20 .cse13 .cse2 .cse6)))) [2022-11-25 17:16:41,049 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2022-11-25 17:16:41,049 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 269) no Hoare annotation was computed. [2022-11-25 17:16:41,049 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-11-25 17:16:41,049 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-11-25 17:16:41,050 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-11-25 17:16:41,050 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-11-25 17:16:41,050 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-11-25 17:16:41,050 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-11-25 17:16:41,050 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-25 17:16:41,050 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-11-25 17:16:41,051 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 .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-25 17:16:41,051 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:16:41,051 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-11-25 17:16:41,051 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-11-25 17:16:41,052 INFO L895 garLoopResultBuilder]: At program point L86(lines 81 111) the Hoare annotation is: (let ((.cse15 (= ~C_1_st~0 0)) (.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse12 (<= ~num~0 1)) (.cse14 (= 2 ~C_1_pc~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse17 (<= 0 ~num~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse11 (not .cse19)) (.cse18 (<= ~num~0 2147483647)) (.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 .cse15)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~C_1_ev~0 0)) (.cse22 (= ~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 .cse16 .cse4 .cse5 (<= ~max_loop~0 2) .cse12 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse18 .cse19 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse6 .cse8 .cse13 .cse9 .cse10) (and .cse3 (or (and .cse0 .cse4 .cse5 .cse20 (<= ~i~0 1) .cse21 .cse22 .cse7 .cse8 .cse10) (and .cse0 .cse2 .cse5 (or (and .cse4 (< 1 ~P_1_pc~0) .cse7 .cse8 .cse10) (and .cse4 .cse22 .cse7 .cse8 .cse10)))) .cse9) (and .cse15 (= ~i~0 0) .cse4 .cse5 .cse20 (= ~max_loop~0 2) .cse21 .cse22 (= ~C_1_pc~0 0) .cse7 .cse9 .cse10)))) [2022-11-25 17:16:41,052 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-25 17:16:41,052 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-11-25 17:16:41,052 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-25 17:16:41,053 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (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 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-11-25 17:16:41,053 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2022-11-25 17:16:41,053 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2022-11-25 17:16:41,053 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2022-11-25 17:16:41,053 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-11-25 17:16:41,054 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-11-25 17:16:41,054 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2022-11-25 17:16:41,054 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse20 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse20)) (.cse19 (<= ~num~0 2147483647)) (.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))) (.cse21 (<= 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 .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 .cse20 .cse3 .cse21 .cse14 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse19 .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 (<= ~max_loop~0 2) .cse13 .cse3 .cse21 .cse14 .cse16 .cse4)))) [2022-11-25 17:16:41,054 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2022-11-25 17:16:41,055 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2022-11-25 17:16:41,055 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-25 17:16:41,055 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2022-11-25 17:16:41,055 INFO L895 garLoopResultBuilder]: At program point L353(lines 342 355) the Hoare annotation is: (let ((.cse20 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse20)) (.cse19 (<= ~num~0 2147483647)) (.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))) (.cse21 (<= 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 .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 .cse20 .cse3 .cse21 .cse14 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse19 .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 (<= ~max_loop~0 2) .cse13 .cse3 .cse21 .cse14 .cse16 .cse4)))) [2022-11-25 17:16:41,056 INFO L895 garLoopResultBuilder]: At program point L320(lines 271 325) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,056 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse29 (= ~P_1_st~0 0)) (.cse17 (= ~C_1_st~0 0))) (let ((.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (= ~max_loop~0 2)) (.cse27 (<= 0 ~num~0)) (.cse23 (<= ~C_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse24 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse30 (<= ~max_loop~0 2)) (.cse25 (<= ~num~0 2147483647)) (.cse16 (< 1 ~P_1_pc~0)) (.cse19 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse6 (= ~C_1_pc~0 1)) (.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse15 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not .cse17)) (.cse4 (not .cse29)) (.cse28 (not .cse26)) (.cse22 (<= 1 ~num~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 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse2 .cse3 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse8 .cse9 .cse20 .cse11 .cse1 .cse21 .cse22 .cse12 .cse4) (and .cse23 .cse7 .cse16 .cse2 .cse3 .cse4) (and .cse17 .cse19 .cse7 .cse9 .cse20 .cse11 .cse0 .cse1 .cse2 .cse12) (and .cse23 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse18 .cse7 .cse25 .cse26 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 .cse15 .cse21 .cse3 .cse22 .cse12) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse29 .cse30 .cse21 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse25 .cse15 .cse3 .cse22 .cse12) (and .cse18 .cse30 (or (and .cse5 .cse13 .cse14 .cse24 .cse7 .cse21 .cse3 .cse27 .cse12 .cse4) (and .cse5 .cse24 .cse7 .cse9 .cse10 .cse11 .cse21 .cse3 .cse27 .cse12 .cse4))) (and .cse23 .cse7 .cse16 .cse3 .cse22 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse30 .cse25 .cse22 .cse12 .cse4) (and .cse16 .cse1 .cse3 .cse22 .cse4) (and .cse19 .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse6 (or (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse15 .cse21 .cse3 .cse4) (and .cse5 .cse14 .cse7 .cse15 .cse21 .cse3 .cse4)) .cse28 .cse22 .cse12)))) [2022-11-25 17:16:41,057 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-25 17:16:41,057 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,057 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-11-25 17:16:41,057 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-11-25 17:16:41,058 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-11-25 17:16:41,058 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:16:41,058 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-11-25 17:16:41,058 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-25 17:16:41,058 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2022-11-25 17:16:41,059 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-11-25 17:16:41,059 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 (<= ~num~0 2147483647) (<= ~max_loop~0 ~i~0) .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-25 17:16:41,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-25 17:16:41,059 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-25 17:16:41,060 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-11-25 17:16:41,060 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-25 17:16:41,060 INFO L895 garLoopResultBuilder]: At program point L109(lines 78 112) the Hoare annotation is: (let ((.cse14 (= ~C_1_st~0 0)) (.cse24 (<= ~max_loop~0 ~i~0))) (let ((.cse21 (<= ~C_1_pc~0 1)) (.cse3 (= ~C_1_pc~0 1)) (.cse25 (not .cse24)) (.cse17 (<= ~P_1_ev~0 0)) (.cse18 (<= ~C_1_ev~0 0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse19 (<= ~num~0 1)) (.cse0 (<= 1 ~i~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse22 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse23 (<= ~num~0 2147483647)) (.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 .cse21 .cse4 .cse11 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse22 .cse15 .cse4 .cse5 .cse23 .cse24 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse23 .cse6 .cse8 .cse20 .cse9 .cse10) (and .cse21 .cse4 .cse13 .cse8 .cse20 .cse10) (and .cse3 .cse25 (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 .cse0 .cse1 .cse2 .cse22 .cse14 .cse15 .cse4 .cse5 (<= ~max_loop~0 2) .cse23 .cse20 .cse9 .cse10) (and .cse13 .cse12 .cse8 .cse20 .cse10) (and .cse16 .cse4 .cse11 .cse12 .cse7 .cse10)))) [2022-11-25 17:16:41,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-25 17:16:41,061 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-25 17:16:41,061 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-25 17:16:41,061 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-25 17:16:41,062 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-25 17:16:41,062 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,063 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-25 17:16:41,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-25 17:16:41,063 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-11-25 17:16:41,063 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-11-25 17:16:41,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:16:41,064 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-25 17:16:41,064 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-11-25 17:16:41,064 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,064 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-11-25 17:16:41,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-25 17:16:41,065 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-11-25 17:16:41,065 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-25 17:16:41,065 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-11-25 17:16:41,066 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (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 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-11-25 17:16:41,066 INFO L895 garLoopResultBuilder]: At program point L426(lines 415 428) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (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 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-11-25 17:16:41,066 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-11-25 17:16:41,066 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2022-11-25 17:16:41,067 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-25 17:16:41,067 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-25 17:16:41,067 INFO L895 garLoopResultBuilder]: At program point L427(lines 411 429) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (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 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:16:41,068 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-25 17:16:41,069 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 442 482) the Hoare annotation is: (let ((.cse22 (<= ~max_loop~0 ~i~0)) (.cse20 (= ~P_1_st~0 0)) (.cse14 (= ~C_1_st~0 0))) (let ((.cse21 (<= ~num~0 2147483647)) (.cse19 (= ~P_1_pc~0 1)) (.cse27 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse18 (= 2 ~C_1_pc~0)) (.cse23 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse15 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse16 (<= ~P_1_ev~0 0)) (.cse28 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse25 (<= ~num~0 1)) (.cse3 (not .cse14)) (.cse4 (not .cse20)) (.cse24 (not .cse22)) (.cse26 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (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 .cse14 .cse19 .cse9 .cse20 .cse21 .cse22 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse21 .cse22 .cse3 .cse23 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse25 .cse3 .cse26 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse14 .cse19 .cse9 .cse20 .cse27 .cse25 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse21 .cse10 .cse3 .cse26 .cse11) (and .cse19 .cse27 (or (and .cse5 .cse6 .cse7 .cse18 .cse9 .cse25 .cse3 .cse23 .cse11 .cse4) (and .cse5 .cse18 .cse9 .cse16 .cse28 .cse17 .cse25 .cse3 .cse23 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse26 .cse4) (and .cse12 .cse1 .cse3 .cse26 .cse4) (and .cse15 .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse16 .cse28 .cse17 .cse10 .cse25 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse25 .cse3 .cse4)) .cse24 .cse26 .cse11)))) [2022-11-25 17:16:41,069 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse29 (= ~P_1_st~0 0)) (.cse17 (= ~C_1_st~0 0))) (let ((.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (= ~max_loop~0 2)) (.cse27 (<= 0 ~num~0)) (.cse23 (<= ~C_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse24 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse30 (<= ~max_loop~0 2)) (.cse25 (<= ~num~0 2147483647)) (.cse16 (< 1 ~P_1_pc~0)) (.cse19 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse6 (= ~C_1_pc~0 1)) (.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse15 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not .cse17)) (.cse4 (not .cse29)) (.cse28 (not .cse26)) (.cse22 (<= 1 ~num~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 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse2 .cse3 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse8 .cse9 .cse20 .cse11 .cse1 .cse21 .cse22 .cse12 .cse4) (and .cse23 .cse7 .cse16 .cse2 .cse3 .cse4) (and .cse17 .cse19 .cse7 .cse9 .cse20 .cse11 .cse0 .cse1 .cse2 .cse12) (and .cse23 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse18 .cse7 .cse25 .cse26 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 .cse15 .cse21 .cse3 .cse22 .cse12) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse29 .cse30 .cse21 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse25 .cse15 .cse3 .cse22 .cse12) (and .cse18 .cse30 (or (and .cse5 .cse13 .cse14 .cse24 .cse7 .cse21 .cse3 .cse27 .cse12 .cse4) (and .cse5 .cse24 .cse7 .cse9 .cse10 .cse11 .cse21 .cse3 .cse27 .cse12 .cse4))) (and .cse23 .cse7 .cse16 .cse3 .cse22 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse30 .cse25 .cse22 .cse12 .cse4) (and .cse16 .cse1 .cse3 .cse22 .cse4) (and .cse19 .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse6 (or (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse15 .cse21 .cse3 .cse4) (and .cse5 .cse14 .cse7 .cse15 .cse21 .cse3 .cse4)) .cse28 .cse22 .cse12)))) [2022-11-25 17:16:41,070 INFO L895 garLoopResultBuilder]: At program point L148(lines 140 193) the Hoare annotation is: (let ((.cse17 (= ~P_1_st~0 0))) (let ((.cse13 (<= ~max_loop~0 2)) (.cse18 (<= ~num~0 1)) (.cse15 (<= 1 ~num~0)) (.cse6 (not .cse17)) (.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)) (.cse14 (<= ~num~0 2147483647)) (.cse19 (<= 0 ~num~0)) (.cse0 (= ~i~0 0)) (.cse1 (<= ~e~0 0)) (.cse12 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (= ~max_loop~0 2)) (.cse22 (<= ~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))) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse17 .cse13 .cse18 .cse5 .cse19 .cse16) (and .cse11 .cse0 .cse1 .cse12 .cse20 .cse21 .cse22 .cse3 .cse18 .cse5 .cse15 .cse16 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse14 (<= ~max_loop~0 ~i~0) .cse5 .cse19 .cse16) (and .cse0 .cse1 .cse12 .cse20 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse16)))) [2022-11-25 17:16:41,070 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2022-11-25 17:16:41,070 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-11-25 17:16:41,070 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-25 17:16:41,071 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-25 17:16:41,071 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-25 17:16:41,071 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-25 17:16:41,072 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-25 17:16:41,072 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-11-25 17:16:41,072 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 .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-25 17:16:41,072 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2022-11-25 17:16:41,072 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-11-25 17:16:41,073 INFO L895 garLoopResultBuilder]: At program point L365-1(lines 356 373) the Hoare annotation is: (let ((.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0)) (.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse14 (= 2 ~C_1_pc~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse22 (<= ~num~0 1)) (.cse20 (<= 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)) (.cse21 (not .cse19)) (.cse18 (<= ~num~0 2147483647)) (.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 .cse15)) (.cse23 (<= 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 .cse17))) (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 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 (<= ~max_loop~0 2) .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-11-25 17:16:41,073 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-25 17:16:41,073 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-25 17:16:41,073 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-25 17:16:41,078 INFO L445 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-25 17:16:41,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:16:41,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:16:41 BoogieIcfgContainer [2022-11-25 17:16:41,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:16:41,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:16:41,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:16:41,220 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:16:41,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:52" (3/4) ... [2022-11-25 17:16:41,224 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:16:41,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-25 17:16:41,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-25 17:16:41,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-25 17:16:41,231 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-25 17:16:41,231 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-25 17:16:41,231 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-25 17:16:41,245 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-25 17:16:41,246 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 17:16:41,247 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:16:41,247 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:16:41,280 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)) && (((((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)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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 <= 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))) && (((((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-25 17:16:41,281 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)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && (((((!(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-25 17:16:41,283 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) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && (((((((((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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(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)) || !(num <= 2147483647)) || !(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) [2022-11-25 17:16:41,283 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))) && ((((((\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))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && (((((!(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))) && (((((!(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))) && ((((((((((!(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))) && (((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 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))) && ((((((((((((!(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))) && ((((((((((((!(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) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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) [2022-11-25 17:16:41,335 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:16:41,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:16:41,336 INFO L158 Benchmark]: Toolchain (without parser) took 109707.33ms. Allocated memory was 165.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 132.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. [2022-11-25 17:16:41,337 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 130.0MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:16:41,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.15ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 129.8MB in the end (delta: 3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 17:16:41,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:16:41,338 INFO L158 Benchmark]: Boogie Preprocessor took 51.64ms. Allocated memory is still 165.7MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:16:41,338 INFO L158 Benchmark]: RCFGBuilder took 777.40ms. Allocated memory is still 165.7MB. Free memory was 125.6MB in the beginning and 106.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:16:41,339 INFO L158 Benchmark]: TraceAbstraction took 108275.67ms. Allocated memory was 165.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 105.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-25 17:16:41,339 INFO L158 Benchmark]: Witness Printer took 116.45ms. Allocated memory is still 2.7GB. Free memory was 2.4GB 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-25 17:16:41,340 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.25ms. Allocated memory is still 130.0MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.15ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 129.8MB in the end (delta: 3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.64ms. Allocated memory is still 165.7MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 777.40ms. Allocated memory is still 165.7MB. Free memory was 125.6MB in the beginning and 106.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 108275.67ms. Allocated memory was 165.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 105.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 116.45ms. Allocated memory is still 2.7GB. Free memory was 2.4GB 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: 108.0s, OverallIterations: 37, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6577 mSDsluCounter, 17179 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10057 mSDsCounter, 834 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3599 IncrementalHoareTripleChecker+Invalid, 4433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 834 mSolverCounterUnsat, 7122 mSDtfsCounter, 3599 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6566 GetRequests, 6343 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13761occurred in iteration=24, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 9689 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 21589 PreInvPairs, 23020 NumberOfFragments, 14105 HoareAnnotationTreeSize, 21589 FomulaSimplifications, 178510 FormulaSimplificationTreeSizeReduction, 9.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 130780 FormulaSimplificationTreeSizeReductionInter, 40.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 11762 NumberOfCodeBlocks, 11762 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 12133 ConstructedInterpolants, 0 QuantifiedInterpolants, 19663 SizeOfPredicates, 9 NumberOfNonLiveVariables, 12186 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 58 InterpolantComputations, 35 PerfectInterpolantSequences, 22287/22820 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) && 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) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && num <= 2147483647) && max_loop <= i) && 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) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && (((((((((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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(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)) || !(num <= 2147483647)) || !(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) - InvariantResult [Line: 36]: 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)) && 0 <= 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)) && 0 <= num) && C_1_i == 1) - 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)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && (((((!(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) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(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) && 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: 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))) && ((((((\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))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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)) && (((((!(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))) && (((((!(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))) && ((((((((((!(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))) && (((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 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))) && ((((((((((((!(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))) && ((((((((((((!(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) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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) - 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)) && (((((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)) || !(num <= 2147483647)) || !(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)) && ((((((((((((!(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))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(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 <= 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))) && (((((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) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 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)) || (((((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) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(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) && 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: 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))) || (((((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) && num <= 2147483647) && max_loop <= i) && 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 && 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 <= 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 <= 2147483647) && 1 <= num) && 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)) - 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 <= 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)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 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)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || P_1_st == 0) || !(max_loop <= 2)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) || !(1 <= num))) && ((((((((((((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)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_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))) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && P_1_ev == 1) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_ev == 1) && 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 <= 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) && num <= 2147483647) && max_loop <= i) && !(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) && 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) && 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) && num <= 2147483647) && max_loop <= i) && !(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) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(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) && 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: 279]: 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 <= 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) && num <= 2147483647) && max_loop <= i) && 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 <= 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 <= 2) && num <= 2147483647) && 1 <= num) && 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))) || ((((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) && num <= 2147483647) && max_loop <= i) && !(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))) || (((((((((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))) || ((((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: 32]: 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)) && 0 <= 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)) && 0 <= num) && C_1_i == 1) - 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-25 17:16:41,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8762c30-f61a-4ea6-8e4f-6c4d4fc4e028/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE