./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:53:24,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:53:24,811 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 02:53:24,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:53:24,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:53:24,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:53:24,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:53:24,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:53:24,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:53:24,839 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:53:24,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:53:24,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:53:24,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:53:24,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:53:24,842 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:53:24,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:53:24,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:53:24,844 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:53:24,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:53:24,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:53:24,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:53:24,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:53:24,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:53:24,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:53:24,847 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 02:53:24,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:53:24,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:53:24,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:53:24,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:53:24,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:53:24,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:53:24,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:53:24,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:53:24,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:24,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:53:24,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:53:24,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:53:24,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:53:24,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:53:24,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:53:24,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:53:24,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:53:24,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:53:24,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:53:24,852 INFO L153 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_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/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_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2023-11-29 02:53:25,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:53:25,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:53:25,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:53:25,105 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:53:25,105 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:53:25,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-11-29 02:53:27,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:53:28,028 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:53:28,029 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-11-29 02:53:28,039 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/data/2b36ba4d7/aadd57fe5cb74ad296eaf0073e61494f/FLAGcc497cd4a [2023-11-29 02:53:28,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/data/2b36ba4d7/aadd57fe5cb74ad296eaf0073e61494f [2023-11-29 02:53:28,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:53:28,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:53:28,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:28,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:53:28,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:53:28,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2cdb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28, skipping insertion in model container [2023-11-29 02:53:28,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,098 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:28,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:28,297 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:53:28,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:28,347 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:53:28,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28 WrapperNode [2023-11-29 02:53:28,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:28,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:28,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:53:28,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:53:28,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,389 INFO L138 Inliner]: procedures = 31, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 238 [2023-11-29 02:53:28,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:28,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:53:28,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:53:28,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:53:28,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,416 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:53:28,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:53:28,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:53:28,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:53:28,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:53:28,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (1/1) ... [2023-11-29 02:53:28,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:28,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:28,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:53:28,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:53:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:53:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-29 02:53:28,513 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-29 02:53:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 02:53:28,513 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 02:53:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 02:53:28,513 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 02:53:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 02:53:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 02:53:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 02:53:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 02:53:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 02:53:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 02:53:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:53:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 02:53:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 02:53:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:53:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:53:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 02:53:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 02:53:28,598 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:53:28,601 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:53:28,896 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2023-11-29 02:53:28,896 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-11-29 02:53:28,912 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:53:28,949 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:53:28,949 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 02:53:28,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:28 BoogieIcfgContainer [2023-11-29 02:53:28,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:53:28,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:53:28,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:53:28,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:53:28,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:53:28" (1/3) ... [2023-11-29 02:53:28,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9843e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:28, skipping insertion in model container [2023-11-29 02:53:28,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:28" (2/3) ... [2023-11-29 02:53:28,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9843e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:28, skipping insertion in model container [2023-11-29 02:53:28,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:28" (3/3) ... [2023-11-29 02:53:28,959 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2023-11-29 02:53:28,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:53:28,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 02:53:29,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:53:29,039 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=LoopHeads, 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;@51830371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:53:29,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 02:53:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 84 states have (on average 1.6428571428571428) internal successors, (138), 93 states have internal predecessors, (138), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:53:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:53:29,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:29,055 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] [2023-11-29 02:53:29,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:29,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 323657744, now seen corresponding path program 1 times [2023-11-29 02:53:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858667573] [2023-11-29 02:53:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:53:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:53:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858667573] [2023-11-29 02:53:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858667573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:29,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:29,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:53:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702826481] [2023-11-29 02:53:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:53:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:53:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:53:29,613 INFO L87 Difference]: Start difference. First operand has 115 states, 84 states have (on average 1.6428571428571428) internal successors, (138), 93 states have internal predecessors, (138), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:30,358 INFO L93 Difference]: Finished difference Result 373 states and 565 transitions. [2023-11-29 02:53:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:53:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2023-11-29 02:53:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:30,372 INFO L225 Difference]: With dead ends: 373 [2023-11-29 02:53:30,372 INFO L226 Difference]: Without dead ends: 255 [2023-11-29 02:53:30,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:53:30,380 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 545 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:30,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 373 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:53:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-29 02:53:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 216. [2023-11-29 02:53:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 167 states have (on average 1.5029940119760479) internal successors, (251), 175 states have internal predecessors, (251), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2023-11-29 02:53:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 310 transitions. [2023-11-29 02:53:30,461 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 310 transitions. Word has length 54 [2023-11-29 02:53:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:30,461 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 310 transitions. [2023-11-29 02:53:30,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 310 transitions. [2023-11-29 02:53:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:53:30,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:30,465 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] [2023-11-29 02:53:30,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:53:30,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:30,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 880293456, now seen corresponding path program 1 times [2023-11-29 02:53:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632035440] [2023-11-29 02:53:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:53:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:53:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632035440] [2023-11-29 02:53:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632035440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:53:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127584984] [2023-11-29 02:53:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:30,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:53:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:53:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:53:30,671 INFO L87 Difference]: Start difference. First operand 216 states and 310 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:31,541 INFO L93 Difference]: Finished difference Result 599 states and 864 transitions. [2023-11-29 02:53:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:53:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2023-11-29 02:53:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:31,548 INFO L225 Difference]: With dead ends: 599 [2023-11-29 02:53:31,548 INFO L226 Difference]: Without dead ends: 397 [2023-11-29 02:53:31,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:53:31,552 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 424 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:31,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 719 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:53:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-29 02:53:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2023-11-29 02:53:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 252 states have (on average 1.492063492063492) internal successors, (376), 262 states have internal predecessors, (376), 40 states have call successors, (40), 21 states have call predecessors, (40), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2023-11-29 02:53:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 469 transitions. [2023-11-29 02:53:31,611 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 469 transitions. Word has length 54 [2023-11-29 02:53:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:31,611 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 469 transitions. [2023-11-29 02:53:31,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 469 transitions. [2023-11-29 02:53:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:53:31,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:31,616 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] [2023-11-29 02:53:31,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:53:31,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:31,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash -17099822, now seen corresponding path program 1 times [2023-11-29 02:53:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276056665] [2023-11-29 02:53:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 02:53:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:53:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276056665] [2023-11-29 02:53:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276056665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:53:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099810867] [2023-11-29 02:53:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:31,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:53:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:53:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:53:31,769 INFO L87 Difference]: Start difference. First operand 323 states and 469 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 02:53:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:32,879 INFO L93 Difference]: Finished difference Result 1265 states and 1845 transitions. [2023-11-29 02:53:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:53:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 54 [2023-11-29 02:53:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:32,888 INFO L225 Difference]: With dead ends: 1265 [2023-11-29 02:53:32,888 INFO L226 Difference]: Without dead ends: 944 [2023-11-29 02:53:32,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:53:32,892 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 934 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:32,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 911 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:53:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2023-11-29 02:53:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 816. [2023-11-29 02:53:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 649 states have (on average 1.4406779661016949) internal successors, (935), 667 states have internal predecessors, (935), 90 states have call successors, (90), 62 states have call predecessors, (90), 71 states have return successors, (117), 88 states have call predecessors, (117), 90 states have call successors, (117) [2023-11-29 02:53:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1142 transitions. [2023-11-29 02:53:32,957 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1142 transitions. Word has length 54 [2023-11-29 02:53:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:32,957 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1142 transitions. [2023-11-29 02:53:32,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 02:53:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1142 transitions. [2023-11-29 02:53:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:53:32,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:32,960 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] [2023-11-29 02:53:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:53:32,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:32,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1411528272, now seen corresponding path program 1 times [2023-11-29 02:53:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196227900] [2023-11-29 02:53:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:53:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:53:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:33,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:33,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196227900] [2023-11-29 02:53:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196227900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:53:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238149792] [2023-11-29 02:53:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:33,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:53:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:53:33,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:53:33,107 INFO L87 Difference]: Start difference. First operand 816 states and 1142 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:33,607 INFO L93 Difference]: Finished difference Result 1706 states and 2400 transitions. [2023-11-29 02:53:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:53:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2023-11-29 02:53:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:33,614 INFO L225 Difference]: With dead ends: 1706 [2023-11-29 02:53:33,614 INFO L226 Difference]: Without dead ends: 898 [2023-11-29 02:53:33,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:53:33,618 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 178 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:33,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 522 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2023-11-29 02:53:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 832. [2023-11-29 02:53:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 661 states have (on average 1.426626323751891) internal successors, (943), 679 states have internal predecessors, (943), 90 states have call successors, (90), 62 states have call predecessors, (90), 75 states have return successors, (121), 92 states have call predecessors, (121), 90 states have call successors, (121) [2023-11-29 02:53:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1154 transitions. [2023-11-29 02:53:33,686 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1154 transitions. Word has length 55 [2023-11-29 02:53:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:33,687 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1154 transitions. [2023-11-29 02:53:33,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1154 transitions. [2023-11-29 02:53:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:53:33,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:33,688 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] [2023-11-29 02:53:33,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:53:33,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:33,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash -709928398, now seen corresponding path program 1 times [2023-11-29 02:53:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875395360] [2023-11-29 02:53:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:53:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:53:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875395360] [2023-11-29 02:53:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875395360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:33,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:53:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356501890] [2023-11-29 02:53:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:53:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:53:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:53:33,819 INFO L87 Difference]: Start difference. First operand 832 states and 1154 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 02:53:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:34,995 INFO L93 Difference]: Finished difference Result 3143 states and 4470 transitions. [2023-11-29 02:53:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:53:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 55 [2023-11-29 02:53:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:35,012 INFO L225 Difference]: With dead ends: 3143 [2023-11-29 02:53:35,012 INFO L226 Difference]: Without dead ends: 2319 [2023-11-29 02:53:35,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:53:35,018 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 804 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:35,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1073 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:53:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-11-29 02:53:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2034. [2023-11-29 02:53:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1612 states have (on average 1.3839950372208436) internal successors, (2231), 1647 states have internal predecessors, (2231), 225 states have call successors, (225), 161 states have call predecessors, (225), 191 states have return successors, (300), 227 states have call predecessors, (300), 225 states have call successors, (300) [2023-11-29 02:53:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2756 transitions. [2023-11-29 02:53:35,206 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2756 transitions. Word has length 55 [2023-11-29 02:53:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:35,206 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 2756 transitions. [2023-11-29 02:53:35,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 02:53:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2756 transitions. [2023-11-29 02:53:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:53:35,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:35,208 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] [2023-11-29 02:53:35,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:53:35,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:35,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -877185763, now seen corresponding path program 1 times [2023-11-29 02:53:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896735805] [2023-11-29 02:53:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:35,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:35,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896735805] [2023-11-29 02:53:35,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896735805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:35,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:35,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:53:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243486527] [2023-11-29 02:53:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:35,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:53:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:35,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:53:35,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:53:35,331 INFO L87 Difference]: Start difference. First operand 2034 states and 2756 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:35,934 INFO L93 Difference]: Finished difference Result 4308 states and 5890 transitions. [2023-11-29 02:53:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:53:35,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2023-11-29 02:53:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:35,951 INFO L225 Difference]: With dead ends: 4308 [2023-11-29 02:53:35,951 INFO L226 Difference]: Without dead ends: 2282 [2023-11-29 02:53:35,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:53:35,957 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:35,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 582 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2023-11-29 02:53:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2114. [2023-11-29 02:53:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1672 states have (on average 1.3702153110047848) internal successors, (2291), 1707 states have internal predecessors, (2291), 225 states have call successors, (225), 161 states have call predecessors, (225), 211 states have return successors, (320), 247 states have call predecessors, (320), 225 states have call successors, (320) [2023-11-29 02:53:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2836 transitions. [2023-11-29 02:53:36,155 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2836 transitions. Word has length 56 [2023-11-29 02:53:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:36,155 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2836 transitions. [2023-11-29 02:53:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2836 transitions. [2023-11-29 02:53:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:53:36,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:36,156 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] [2023-11-29 02:53:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:53:36,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:36,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1612343199, now seen corresponding path program 1 times [2023-11-29 02:53:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:36,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454786030] [2023-11-29 02:53:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454786030] [2023-11-29 02:53:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454786030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:53:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839357339] [2023-11-29 02:53:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:53:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:53:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:53:36,301 INFO L87 Difference]: Start difference. First operand 2114 states and 2836 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:37,158 INFO L93 Difference]: Finished difference Result 4245 states and 5693 transitions. [2023-11-29 02:53:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:53:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2023-11-29 02:53:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:37,170 INFO L225 Difference]: With dead ends: 4245 [2023-11-29 02:53:37,170 INFO L226 Difference]: Without dead ends: 2139 [2023-11-29 02:53:37,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-11-29 02:53:37,175 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 381 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:37,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 595 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:53:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-11-29 02:53:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1814. [2023-11-29 02:53:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1444 states have (on average 1.3663434903047091) internal successors, (1973), 1474 states have internal predecessors, (1973), 188 states have call successors, (188), 136 states have call predecessors, (188), 176 states have return successors, (267), 204 states have call predecessors, (267), 188 states have call successors, (267) [2023-11-29 02:53:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2428 transitions. [2023-11-29 02:53:37,325 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2428 transitions. Word has length 56 [2023-11-29 02:53:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:37,325 INFO L495 AbstractCegarLoop]: Abstraction has 1814 states and 2428 transitions. [2023-11-29 02:53:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2428 transitions. [2023-11-29 02:53:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 02:53:37,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:37,326 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] [2023-11-29 02:53:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:53:37,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:37,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -381801507, now seen corresponding path program 1 times [2023-11-29 02:53:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406588828] [2023-11-29 02:53:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:37,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406588828] [2023-11-29 02:53:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406588828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:37,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:37,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:53:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821048442] [2023-11-29 02:53:37,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:37,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:53:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:53:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:53:37,443 INFO L87 Difference]: Start difference. First operand 1814 states and 2428 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:38,029 INFO L93 Difference]: Finished difference Result 5491 states and 7435 transitions. [2023-11-29 02:53:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:53:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2023-11-29 02:53:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:38,053 INFO L225 Difference]: With dead ends: 5491 [2023-11-29 02:53:38,053 INFO L226 Difference]: Without dead ends: 3686 [2023-11-29 02:53:38,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:53:38,059 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 525 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:38,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 274 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2023-11-29 02:53:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3502. [2023-11-29 02:53:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 2751 states have (on average 1.3293347873500545) internal successors, (3657), 2806 states have internal predecessors, (3657), 384 states have call successors, (384), 272 states have call predecessors, (384), 361 states have return successors, (629), 425 states have call predecessors, (629), 384 states have call successors, (629) [2023-11-29 02:53:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4670 transitions. [2023-11-29 02:53:38,350 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4670 transitions. Word has length 56 [2023-11-29 02:53:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:38,351 INFO L495 AbstractCegarLoop]: Abstraction has 3502 states and 4670 transitions. [2023-11-29 02:53:38,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4670 transitions. [2023-11-29 02:53:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 02:53:38,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:38,352 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] [2023-11-29 02:53:38,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:53:38,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:38,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1940001356, now seen corresponding path program 1 times [2023-11-29 02:53:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667363875] [2023-11-29 02:53:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667363875] [2023-11-29 02:53:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667363875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:38,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:53:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11516767] [2023-11-29 02:53:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:38,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:53:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:53:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:53:38,426 INFO L87 Difference]: Start difference. First operand 3502 states and 4670 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:39,013 INFO L93 Difference]: Finished difference Result 7029 states and 9427 transitions. [2023-11-29 02:53:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:53:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-11-29 02:53:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:39,038 INFO L225 Difference]: With dead ends: 7029 [2023-11-29 02:53:39,038 INFO L226 Difference]: Without dead ends: 3539 [2023-11-29 02:53:39,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:53:39,049 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 290 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:39,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 394 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2023-11-29 02:53:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3254. [2023-11-29 02:53:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 2541 states have (on average 1.3057851239669422) internal successors, (3318), 2593 states have internal predecessors, (3318), 378 states have call successors, (378), 266 states have call predecessors, (378), 331 states have return successors, (588), 396 states have call predecessors, (588), 378 states have call successors, (588) [2023-11-29 02:53:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4284 transitions. [2023-11-29 02:53:39,343 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4284 transitions. Word has length 57 [2023-11-29 02:53:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:39,343 INFO L495 AbstractCegarLoop]: Abstraction has 3254 states and 4284 transitions. [2023-11-29 02:53:39,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4284 transitions. [2023-11-29 02:53:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 02:53:39,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:39,344 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] [2023-11-29 02:53:39,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:53:39,345 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:39,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 577308080, now seen corresponding path program 1 times [2023-11-29 02:53:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492760476] [2023-11-29 02:53:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492760476] [2023-11-29 02:53:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492760476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:53:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021172807] [2023-11-29 02:53:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:39,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:53:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:53:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:53:39,419 INFO L87 Difference]: Start difference. First operand 3254 states and 4284 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:39,937 INFO L93 Difference]: Finished difference Result 6695 states and 8819 transitions. [2023-11-29 02:53:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:53:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-11-29 02:53:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:39,960 INFO L225 Difference]: With dead ends: 6695 [2023-11-29 02:53:39,960 INFO L226 Difference]: Without dead ends: 3453 [2023-11-29 02:53:39,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:53:39,969 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 257 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:39,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 395 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2023-11-29 02:53:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3252. [2023-11-29 02:53:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2539 states have (on average 1.3044505710909806) internal successors, (3312), 2591 states have internal predecessors, (3312), 378 states have call successors, (378), 266 states have call predecessors, (378), 331 states have return successors, (588), 396 states have call predecessors, (588), 378 states have call successors, (588) [2023-11-29 02:53:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4278 transitions. [2023-11-29 02:53:40,247 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4278 transitions. Word has length 57 [2023-11-29 02:53:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:40,248 INFO L495 AbstractCegarLoop]: Abstraction has 3252 states and 4278 transitions. [2023-11-29 02:53:40,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 02:53:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4278 transitions. [2023-11-29 02:53:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 02:53:40,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:40,249 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:53:40,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:53:40,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:40,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2120004182, now seen corresponding path program 1 times [2023-11-29 02:53:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558389037] [2023-11-29 02:53:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:53:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:53:40,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:40,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558389037] [2023-11-29 02:53:40,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558389037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:40,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:40,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:53:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932554106] [2023-11-29 02:53:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:40,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:53:40,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:53:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:53:40,349 INFO L87 Difference]: Start difference. First operand 3252 states and 4278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 02:53:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:41,129 INFO L93 Difference]: Finished difference Result 9906 states and 13148 transitions. [2023-11-29 02:53:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:53:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2023-11-29 02:53:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:41,171 INFO L225 Difference]: With dead ends: 9906 [2023-11-29 02:53:41,171 INFO L226 Difference]: Without dead ends: 6668 [2023-11-29 02:53:41,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:53:41,182 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 281 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:41,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 423 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:53:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2023-11-29 02:53:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6326. [2023-11-29 02:53:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 4887 states have (on average 1.2870881931655411) internal successors, (6290), 5006 states have internal predecessors, (6290), 755 states have call successors, (755), 532 states have call predecessors, (755), 680 states have return successors, (1271), 791 states have call predecessors, (1271), 755 states have call successors, (1271) [2023-11-29 02:53:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 8316 transitions. [2023-11-29 02:53:41,766 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 8316 transitions. Word has length 71 [2023-11-29 02:53:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:41,766 INFO L495 AbstractCegarLoop]: Abstraction has 6326 states and 8316 transitions. [2023-11-29 02:53:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 02:53:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 8316 transitions. [2023-11-29 02:53:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 02:53:41,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:41,769 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:53:41,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:53:41,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:41,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2065611284, now seen corresponding path program 1 times [2023-11-29 02:53:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182654670] [2023-11-29 02:53:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:53:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 02:53:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182654670] [2023-11-29 02:53:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182654670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:53:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121679716] [2023-11-29 02:53:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:53:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:53:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:53:41,845 INFO L87 Difference]: Start difference. First operand 6326 states and 8316 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:42,389 INFO L93 Difference]: Finished difference Result 11361 states and 14917 transitions. [2023-11-29 02:53:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:53:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2023-11-29 02:53:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:42,412 INFO L225 Difference]: With dead ends: 11361 [2023-11-29 02:53:42,413 INFO L226 Difference]: Without dead ends: 5049 [2023-11-29 02:53:42,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:53:42,427 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 236 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:42,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 244 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:53:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2023-11-29 02:53:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 4780. [2023-11-29 02:53:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 3709 states have (on average 1.2855217039633324) internal successors, (4768), 3803 states have internal predecessors, (4768), 552 states have call successors, (552), 394 states have call predecessors, (552), 515 states have return successors, (948), 584 states have call predecessors, (948), 552 states have call successors, (948) [2023-11-29 02:53:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 6268 transitions. [2023-11-29 02:53:42,862 INFO L78 Accepts]: Start accepts. Automaton has 4780 states and 6268 transitions. Word has length 71 [2023-11-29 02:53:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:42,863 INFO L495 AbstractCegarLoop]: Abstraction has 4780 states and 6268 transitions. [2023-11-29 02:53:42,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 02:53:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4780 states and 6268 transitions. [2023-11-29 02:53:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 02:53:42,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:42,865 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:53:42,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:53:42,865 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:42,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 769855791, now seen corresponding path program 1 times [2023-11-29 02:53:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284749798] [2023-11-29 02:53:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:42,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:53:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:53:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284749798] [2023-11-29 02:53:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284749798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:53:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449114204] [2023-11-29 02:53:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:42,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:53:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:53:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:53:42,992 INFO L87 Difference]: Start difference. First operand 4780 states and 6268 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 02:53:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:44,105 INFO L93 Difference]: Finished difference Result 8753 states and 11434 transitions. [2023-11-29 02:53:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:53:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2023-11-29 02:53:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:44,122 INFO L225 Difference]: With dead ends: 8753 [2023-11-29 02:53:44,122 INFO L226 Difference]: Without dead ends: 4210 [2023-11-29 02:53:44,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2023-11-29 02:53:44,131 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1134 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:44,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 574 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:53:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2023-11-29 02:53:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 3855. [2023-11-29 02:53:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 2966 states have (on average 1.2663519892110586) internal successors, (3756), 3035 states have internal predecessors, (3756), 458 states have call successors, (458), 312 states have call predecessors, (458), 427 states have return successors, (689), 509 states have call predecessors, (689), 458 states have call successors, (689) [2023-11-29 02:53:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 4903 transitions. [2023-11-29 02:53:44,405 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 4903 transitions. Word has length 72 [2023-11-29 02:53:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:44,406 INFO L495 AbstractCegarLoop]: Abstraction has 3855 states and 4903 transitions. [2023-11-29 02:53:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 02:53:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 4903 transitions. [2023-11-29 02:53:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-29 02:53:44,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:44,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 02:53:44,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:53:44,410 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:44,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -463905739, now seen corresponding path program 1 times [2023-11-29 02:53:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466717319] [2023-11-29 02:53:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:53:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:53:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:53:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:53:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:53:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 02:53:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466717319] [2023-11-29 02:53:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466717319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252214535] [2023-11-29 02:53:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:44,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:44,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:44,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:53:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:44,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:44,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 02:53:44,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252214535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2023-11-29 02:53:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680182902] [2023-11-29 02:53:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:44,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:44,821 INFO L87 Difference]: Start difference. First operand 3855 states and 4903 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:53:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:45,081 INFO L93 Difference]: Finished difference Result 3855 states and 4903 transitions. [2023-11-29 02:53:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (12), 1 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 97 [2023-11-29 02:53:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:45,099 INFO L225 Difference]: With dead ends: 3855 [2023-11-29 02:53:45,099 INFO L226 Difference]: Without dead ends: 3854 [2023-11-29 02:53:45,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:45,102 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:45,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2023-11-29 02:53:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3854. [2023-11-29 02:53:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3854 states, 2966 states have (on average 1.2521915037086986) internal successors, (3714), 3034 states have internal predecessors, (3714), 458 states have call successors, (458), 312 states have call predecessors, (458), 427 states have return successors, (689), 509 states have call predecessors, (689), 458 states have call successors, (689) [2023-11-29 02:53:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 4861 transitions. [2023-11-29 02:53:45,371 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 4861 transitions. Word has length 97 [2023-11-29 02:53:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:45,372 INFO L495 AbstractCegarLoop]: Abstraction has 3854 states and 4861 transitions. [2023-11-29 02:53:45,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:53:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 4861 transitions. [2023-11-29 02:53:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 02:53:45,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:45,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 02:53:45,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:53:45,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 02:53:45,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:45,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1496175690, now seen corresponding path program 1 times [2023-11-29 02:53:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818159725] [2023-11-29 02:53:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:53:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:53:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:53:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:53:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:53:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 02:53:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:45,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818159725] [2023-11-29 02:53:45,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818159725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:45,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165387588] [2023-11-29 02:53:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:45,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:45,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:45,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:53:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:45,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:45,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 02:53:45,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165387588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2023-11-29 02:53:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731789774] [2023-11-29 02:53:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:45,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:45,923 INFO L87 Difference]: Start difference. First operand 3854 states and 4861 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:53:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:46,275 INFO L93 Difference]: Finished difference Result 11448 states and 14413 transitions. [2023-11-29 02:53:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (12), 1 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 98 [2023-11-29 02:53:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:46,294 INFO L225 Difference]: With dead ends: 11448 [2023-11-29 02:53:46,294 INFO L226 Difference]: Without dead ends: 7163 [2023-11-29 02:53:46,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:46,304 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 72 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:46,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 268 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7163 states. [2023-11-29 02:53:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7163 to 7161. [2023-11-29 02:53:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7161 states, 5507 states have (on average 1.2395133466497186) internal successors, (6826), 5635 states have internal predecessors, (6826), 846 states have call successors, (846), 582 states have call predecessors, (846), 806 states have return successors, (1294), 944 states have call predecessors, (1294), 846 states have call successors, (1294) [2023-11-29 02:53:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7161 states to 7161 states and 8966 transitions. [2023-11-29 02:53:46,687 INFO L78 Accepts]: Start accepts. Automaton has 7161 states and 8966 transitions. Word has length 98 [2023-11-29 02:53:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:46,687 INFO L495 AbstractCegarLoop]: Abstraction has 7161 states and 8966 transitions. [2023-11-29 02:53:46,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:53:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7161 states and 8966 transitions. [2023-11-29 02:53:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 02:53:46,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:46,693 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 02:53:46,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:53:46,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 02:53:46,894 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:46,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 704518975, now seen corresponding path program 1 times [2023-11-29 02:53:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116399226] [2023-11-29 02:53:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:53:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:53:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:53:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:53:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:53:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:53:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 02:53:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 02:53:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 02:53:47,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116399226] [2023-11-29 02:53:47,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116399226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741546846] [2023-11-29 02:53:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:47,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:47,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:47,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:53:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:47,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:47,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 02:53:47,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741546846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2023-11-29 02:53:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094288486] [2023-11-29 02:53:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:47,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:47,327 INFO L87 Difference]: Start difference. First operand 7161 states and 8966 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:53:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:47,755 INFO L93 Difference]: Finished difference Result 7161 states and 8966 transitions. [2023-11-29 02:53:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2023-11-29 02:53:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:47,774 INFO L225 Difference]: With dead ends: 7161 [2023-11-29 02:53:47,774 INFO L226 Difference]: Without dead ends: 7160 [2023-11-29 02:53:47,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:47,778 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:47,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2023-11-29 02:53:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 7160. [2023-11-29 02:53:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7160 states, 5507 states have (on average 1.2355184310877065) internal successors, (6804), 5634 states have internal predecessors, (6804), 846 states have call successors, (846), 582 states have call predecessors, (846), 806 states have return successors, (1294), 944 states have call predecessors, (1294), 846 states have call successors, (1294) [2023-11-29 02:53:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 8944 transitions. [2023-11-29 02:53:48,376 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 8944 transitions. Word has length 136 [2023-11-29 02:53:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:48,376 INFO L495 AbstractCegarLoop]: Abstraction has 7160 states and 8944 transitions. [2023-11-29 02:53:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:53:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 8944 transitions. [2023-11-29 02:53:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 02:53:48,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:48,386 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 02:53:48,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 02:53:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 02:53:48,587 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:48,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 365251979, now seen corresponding path program 1 times [2023-11-29 02:53:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155054465] [2023-11-29 02:53:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:53:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:53:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:53:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:53:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:53:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:53:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 02:53:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 02:53:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 02:53:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155054465] [2023-11-29 02:53:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155054465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909784665] [2023-11-29 02:53:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:48,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:48,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:53:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:48,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 02:53:49,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909784665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2023-11-29 02:53:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332471927] [2023-11-29 02:53:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:49,086 INFO L87 Difference]: Start difference. First operand 7160 states and 8944 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:53:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:49,604 INFO L93 Difference]: Finished difference Result 11219 states and 14092 transitions. [2023-11-29 02:53:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 137 [2023-11-29 02:53:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:49,638 INFO L225 Difference]: With dead ends: 11219 [2023-11-29 02:53:49,638 INFO L226 Difference]: Without dead ends: 11218 [2023-11-29 02:53:49,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:49,642 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:49,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11218 states. [2023-11-29 02:53:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11218 to 11194. [2023-11-29 02:53:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11194 states, 8611 states have (on average 1.2423644176053885) internal successors, (10698), 8812 states have internal predecessors, (10698), 1302 states have call successors, (1302), 890 states have call predecessors, (1302), 1280 states have return successors, (2054), 1492 states have call predecessors, (2054), 1302 states have call successors, (2054) [2023-11-29 02:53:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11194 states to 11194 states and 14054 transitions. [2023-11-29 02:53:50,308 INFO L78 Accepts]: Start accepts. Automaton has 11194 states and 14054 transitions. Word has length 137 [2023-11-29 02:53:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:50,308 INFO L495 AbstractCegarLoop]: Abstraction has 11194 states and 14054 transitions. [2023-11-29 02:53:50,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:53:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11194 states and 14054 transitions. [2023-11-29 02:53:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-29 02:53:50,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:50,334 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 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, 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] [2023-11-29 02:53:50,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:53:50,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 02:53:50,535 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:50,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1499817642, now seen corresponding path program 1 times [2023-11-29 02:53:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:50,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791029591] [2023-11-29 02:53:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:53:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:53:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:53:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:53:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:53:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:53:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 02:53:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 02:53:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 02:53:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:53:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 02:53:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 02:53:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-29 02:53:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:53:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 02:53:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-29 02:53:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-29 02:53:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791029591] [2023-11-29 02:53:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791029591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418067238] [2023-11-29 02:53:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:50,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:50,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:53:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:50,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:50,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-29 02:53:51,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418067238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:51,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:51,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2023-11-29 02:53:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170022349] [2023-11-29 02:53:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:51,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:51,018 INFO L87 Difference]: Start difference. First operand 11194 states and 14054 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:53:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:51,973 INFO L93 Difference]: Finished difference Result 32008 states and 40211 transitions. [2023-11-29 02:53:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 224 [2023-11-29 02:53:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:52,018 INFO L225 Difference]: With dead ends: 32008 [2023-11-29 02:53:52,018 INFO L226 Difference]: Without dead ends: 21281 [2023-11-29 02:53:52,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:52,081 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 59 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:52,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21281 states. [2023-11-29 02:53:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21281 to 21158. [2023-11-29 02:53:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21158 states, 16259 states have (on average 1.2361153822498308) internal successors, (20098), 16640 states have internal predecessors, (20098), 2446 states have call successors, (2446), 1780 states have call predecessors, (2446), 2452 states have return successors, (3714), 2738 states have call predecessors, (3714), 2446 states have call successors, (3714) [2023-11-29 02:53:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21158 states to 21158 states and 26258 transitions. [2023-11-29 02:53:53,531 INFO L78 Accepts]: Start accepts. Automaton has 21158 states and 26258 transitions. Word has length 224 [2023-11-29 02:53:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:53,531 INFO L495 AbstractCegarLoop]: Abstraction has 21158 states and 26258 transitions. [2023-11-29 02:53:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:53:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21158 states and 26258 transitions. [2023-11-29 02:53:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-11-29 02:53:53,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:53,557 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:53:53,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 02:53:53,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 02:53:53,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:53,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1342331990, now seen corresponding path program 1 times [2023-11-29 02:53:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432867709] [2023-11-29 02:53:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:53:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 02:53:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 02:53:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:53:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:53:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:53:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 02:53:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:53:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 02:53:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 02:53:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:53:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:53:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 02:53:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:53:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 02:53:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 02:53:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-29 02:53:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-29 02:53:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 46 proven. 28 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-29 02:53:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432867709] [2023-11-29 02:53:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432867709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:54,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974120711] [2023-11-29 02:53:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:54,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:54,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:54,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:53:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:54,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-29 02:53:54,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974120711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2023-11-29 02:53:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896485895] [2023-11-29 02:53:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:54,314 INFO L87 Difference]: Start difference. First operand 21158 states and 26258 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 02:53:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:56,366 INFO L93 Difference]: Finished difference Result 62050 states and 77404 transitions. [2023-11-29 02:53:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 255 [2023-11-29 02:53:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:56,466 INFO L225 Difference]: With dead ends: 62050 [2023-11-29 02:53:56,466 INFO L226 Difference]: Without dead ends: 40901 [2023-11-29 02:53:56,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:56,497 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:56,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 239 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:53:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40901 states. [2023-11-29 02:53:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40901 to 40900. [2023-11-29 02:53:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40900 states, 31464 states have (on average 1.2213640986524281) internal successors, (38429), 32153 states have internal predecessors, (38429), 4827 states have call successors, (4827), 3560 states have call predecessors, (4827), 4608 states have return successors, (6944), 5187 states have call predecessors, (6944), 4827 states have call successors, (6944) [2023-11-29 02:53:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40900 states to 40900 states and 50200 transitions. [2023-11-29 02:53:59,026 INFO L78 Accepts]: Start accepts. Automaton has 40900 states and 50200 transitions. Word has length 255 [2023-11-29 02:53:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:59,027 INFO L495 AbstractCegarLoop]: Abstraction has 40900 states and 50200 transitions. [2023-11-29 02:53:59,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 02:53:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 40900 states and 50200 transitions. [2023-11-29 02:53:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 02:53:59,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:59,060 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-29 02:53:59,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:53:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:59,261 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:53:59,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1730188379, now seen corresponding path program 1 times [2023-11-29 02:53:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:53:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373313513] [2023-11-29 02:53:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:53:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:53:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:53:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:53:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:53:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:53:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:53:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:53:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:53:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:53:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 02:53:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 02:53:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 02:53:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:53:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 02:53:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:53:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:53:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 02:53:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:53:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:53:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:53:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-29 02:53:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 02:53:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 02:53:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 02:53:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-11-29 02:53:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:53:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373313513] [2023-11-29 02:53:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373313513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212990668] [2023-11-29 02:53:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:59,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:53:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:59,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:53:59,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 02:53:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:59,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-29 02:53:59,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212990668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:53:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-29 02:53:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511653388] [2023-11-29 02:53:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:53:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:53:59,833 INFO L87 Difference]: Start difference. First operand 40900 states and 50200 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:01,898 INFO L93 Difference]: Finished difference Result 70103 states and 86813 transitions. [2023-11-29 02:54:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 256 [2023-11-29 02:54:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:01,973 INFO L225 Difference]: With dead ends: 70103 [2023-11-29 02:54:01,973 INFO L226 Difference]: Without dead ends: 35688 [2023-11-29 02:54:02,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:02,013 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 106 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:02,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 311 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:54:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35688 states. [2023-11-29 02:54:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35688 to 35496. [2023-11-29 02:54:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35496 states, 27320 states have (on average 1.2086749633967788) internal successors, (33021), 27801 states have internal predecessors, (33021), 4215 states have call successors, (4215), 3096 states have call predecessors, (4215), 3960 states have return successors, (5846), 4599 states have call predecessors, (5846), 4215 states have call successors, (5846) [2023-11-29 02:54:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35496 states to 35496 states and 43082 transitions. [2023-11-29 02:54:04,908 INFO L78 Accepts]: Start accepts. Automaton has 35496 states and 43082 transitions. Word has length 256 [2023-11-29 02:54:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:04,909 INFO L495 AbstractCegarLoop]: Abstraction has 35496 states and 43082 transitions. [2023-11-29 02:54:04,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35496 states and 43082 transitions. [2023-11-29 02:54:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 02:54:04,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:04,938 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:04,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 02:54:05,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:05,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:54:05,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1740073323, now seen corresponding path program 1 times [2023-11-29 02:54:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:54:05,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932559017] [2023-11-29 02:54:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:54:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:54:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:54:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:54:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:54:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:54:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:54:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:54:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 02:54:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 02:54:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 02:54:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:54:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 02:54:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:54:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:54:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 02:54:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:54:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-29 02:54:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 02:54:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 02:54:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 02:54:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-11-29 02:54:05,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:54:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932559017] [2023-11-29 02:54:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932559017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754091622] [2023-11-29 02:54:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:54:05,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:54:05,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 02:54:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:05,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-29 02:54:05,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754091622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:54:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-29 02:54:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292525013] [2023-11-29 02:54:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:05,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:54:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:05,550 INFO L87 Difference]: Start difference. First operand 35496 states and 43082 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:06,771 INFO L93 Difference]: Finished difference Result 57648 states and 69693 transitions. [2023-11-29 02:54:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:06,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 256 [2023-11-29 02:54:06,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:06,819 INFO L225 Difference]: With dead ends: 57648 [2023-11-29 02:54:06,819 INFO L226 Difference]: Without dead ends: 22161 [2023-11-29 02:54:06,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:06,859 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 11 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:06,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 267 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:54:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22161 states. [2023-11-29 02:54:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22161 to 22161. [2023-11-29 02:54:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22161 states, 17036 states have (on average 1.180676215073961) internal successors, (20114), 17342 states have internal predecessors, (20114), 2538 states have call successors, (2538), 2025 states have call predecessors, (2538), 2586 states have return successors, (3439), 2794 states have call predecessors, (3439), 2538 states have call successors, (3439) [2023-11-29 02:54:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22161 states to 22161 states and 26091 transitions. [2023-11-29 02:54:08,162 INFO L78 Accepts]: Start accepts. Automaton has 22161 states and 26091 transitions. Word has length 256 [2023-11-29 02:54:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:08,163 INFO L495 AbstractCegarLoop]: Abstraction has 22161 states and 26091 transitions. [2023-11-29 02:54:08,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22161 states and 26091 transitions. [2023-11-29 02:54:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2023-11-29 02:54:08,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:08,179 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 02:54:08,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 02:54:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 02:54:08,380 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:54:08,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2098409014, now seen corresponding path program 1 times [2023-11-29 02:54:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:54:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459317708] [2023-11-29 02:54:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:54:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:54:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:54:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:54:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:54:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:54:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:54:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:54:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 02:54:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 02:54:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 02:54:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:54:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 02:54:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:54:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:54:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 02:54:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:54:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 02:54:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 02:54:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 02:54:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 02:54:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 02:54:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-11-29 02:54:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:54:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459317708] [2023-11-29 02:54:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459317708] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528332554] [2023-11-29 02:54:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:54:08,559 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:54:08,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 02:54:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:08,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-11-29 02:54:08,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528332554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:08,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:54:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-29 02:54:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741235215] [2023-11-29 02:54:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:08,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:54:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:08,852 INFO L87 Difference]: Start difference. First operand 22161 states and 26091 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:54:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:09,930 INFO L93 Difference]: Finished difference Result 35295 states and 41833 transitions. [2023-11-29 02:54:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:09,931 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), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 286 [2023-11-29 02:54:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:09,963 INFO L225 Difference]: With dead ends: 35295 [2023-11-29 02:54:09,963 INFO L226 Difference]: Without dead ends: 14325 [2023-11-29 02:54:09,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:09,985 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 314 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:54:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14325 states. [2023-11-29 02:54:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14325 to 14259. [2023-11-29 02:54:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14259 states, 10924 states have (on average 1.1753936287074331) internal successors, (12840), 11080 states have internal predecessors, (12840), 1656 states have call successors, (1656), 1311 states have call predecessors, (1656), 1678 states have return successors, (2203), 1868 states have call predecessors, (2203), 1656 states have call successors, (2203) [2023-11-29 02:54:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14259 states to 14259 states and 16699 transitions. [2023-11-29 02:54:10,775 INFO L78 Accepts]: Start accepts. Automaton has 14259 states and 16699 transitions. Word has length 286 [2023-11-29 02:54:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:10,775 INFO L495 AbstractCegarLoop]: Abstraction has 14259 states and 16699 transitions. [2023-11-29 02:54:10,775 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), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:54:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14259 states and 16699 transitions. [2023-11-29 02:54:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2023-11-29 02:54:10,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:10,794 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:10,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 02:54:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 02:54:10,994 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:54:10,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -501253158, now seen corresponding path program 1 times [2023-11-29 02:54:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:54:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543665523] [2023-11-29 02:54:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:54:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:54:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:54:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:54:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:54:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 02:54:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 02:54:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:54:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 02:54:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 02:54:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:54:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:54:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 02:54:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 02:54:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:54:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 02:54:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 02:54:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 02:54:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-29 02:54:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 02:54:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 02:54:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 02:54:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 02:54:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-29 02:54:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 02:54:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-29 02:54:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2023-11-29 02:54:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-11-29 02:54:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-11-29 02:54:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-11-29 02:54:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2023-11-29 02:54:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:54:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543665523] [2023-11-29 02:54:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543665523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026956798] [2023-11-29 02:54:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:54:11,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:54:11,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 02:54:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:11,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:11,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-11-29 02:54:11,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026956798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:54:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-29 02:54:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104397530] [2023-11-29 02:54:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:11,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:54:11,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:11,376 INFO L87 Difference]: Start difference. First operand 14259 states and 16699 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2023-11-29 02:54:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:11,828 INFO L93 Difference]: Finished difference Result 21514 states and 25209 transitions. [2023-11-29 02:54:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:11,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 372 [2023-11-29 02:54:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:11,843 INFO L225 Difference]: With dead ends: 21514 [2023-11-29 02:54:11,843 INFO L226 Difference]: Without dead ends: 7264 [2023-11-29 02:54:11,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:11,857 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 11 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:11,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 278 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:54:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7264 states. [2023-11-29 02:54:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7264 to 7264. [2023-11-29 02:54:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7264 states, 5552 states have (on average 1.152557636887608) internal successors, (6399), 5638 states have internal predecessors, (6399), 890 states have call successors, (890), 708 states have call predecessors, (890), 821 states have return successors, (1075), 918 states have call predecessors, (1075), 890 states have call successors, (1075) [2023-11-29 02:54:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 8364 transitions. [2023-11-29 02:54:12,287 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 8364 transitions. Word has length 372 [2023-11-29 02:54:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:12,287 INFO L495 AbstractCegarLoop]: Abstraction has 7264 states and 8364 transitions. [2023-11-29 02:54:12,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2023-11-29 02:54:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 8364 transitions. [2023-11-29 02:54:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2023-11-29 02:54:12,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:12,297 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:12,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 02:54:12,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 02:54:12,498 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:54:12,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash -454735754, now seen corresponding path program 1 times [2023-11-29 02:54:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:54:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821003617] [2023-11-29 02:54:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:54:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:54:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:54:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:54:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:54:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 02:54:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 02:54:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:54:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 02:54:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 02:54:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:54:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:54:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 02:54:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 02:54:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:54:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 02:54:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 02:54:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 02:54:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-29 02:54:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 02:54:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 02:54:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 02:54:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 02:54:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-29 02:54:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 02:54:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-29 02:54:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-11-29 02:54:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-11-29 02:54:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-11-29 02:54:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2023-11-29 02:54:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2023-11-29 02:54:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:54:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821003617] [2023-11-29 02:54:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821003617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092905074] [2023-11-29 02:54:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:12,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:12,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:54:12,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:54:12,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 02:54:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:12,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2023-11-29 02:54:13,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092905074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:54:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-29 02:54:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250007143] [2023-11-29 02:54:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:54:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:13,018 INFO L87 Difference]: Start difference. First operand 7264 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:13,755 INFO L93 Difference]: Finished difference Result 13970 states and 16118 transitions. [2023-11-29 02:54:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 374 [2023-11-29 02:54:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:13,771 INFO L225 Difference]: With dead ends: 13970 [2023-11-29 02:54:13,771 INFO L226 Difference]: Without dead ends: 7271 [2023-11-29 02:54:13,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:13,781 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 112 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:13,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 292 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:54:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2023-11-29 02:54:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7264. [2023-11-29 02:54:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7264 states, 5552 states have (on average 1.1435518731988472) internal successors, (6349), 5638 states have internal predecessors, (6349), 890 states have call successors, (890), 708 states have call predecessors, (890), 821 states have return successors, (1031), 918 states have call predecessors, (1031), 890 states have call successors, (1031) [2023-11-29 02:54:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 8270 transitions. [2023-11-29 02:54:14,464 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 8270 transitions. Word has length 374 [2023-11-29 02:54:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:14,465 INFO L495 AbstractCegarLoop]: Abstraction has 7264 states and 8270 transitions. [2023-11-29 02:54:14,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-29 02:54:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 8270 transitions. [2023-11-29 02:54:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2023-11-29 02:54:14,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:14,479 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:14,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 02:54:14,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 02:54:14,679 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-29 02:54:14,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 384297908, now seen corresponding path program 1 times [2023-11-29 02:54:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:54:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790175512] [2023-11-29 02:54:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:54:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:54:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:54:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 02:54:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:54:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 02:54:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 02:54:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:54:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 02:54:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 02:54:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:54:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:54:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 02:54:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 02:54:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:54:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 02:54:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 02:54:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 02:54:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 02:54:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-29 02:54:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 02:54:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:54:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 02:54:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 02:54:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 02:54:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-29 02:54:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 02:54:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-29 02:54:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:54:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 02:54:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-11-29 02:54:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-11-29 02:54:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-11-29 02:54:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2023-11-29 02:54:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2023-11-29 02:54:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:54:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790175512] [2023-11-29 02:54:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790175512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424331454] [2023-11-29 02:54:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:54:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:54:14,901 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:54:14,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 02:54:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:15,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:54:15,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2023-11-29 02:54:15,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2023-11-29 02:54:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424331454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:15,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:54:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 11 [2023-11-29 02:54:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019597759] [2023-11-29 02:54:15,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:15,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:54:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:54:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:54:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:54:15,501 INFO L87 Difference]: Start difference. First operand 7264 states and 8270 transitions. Second operand has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 8 states have internal predecessors, (221), 4 states have call successors, (45), 8 states have call predecessors, (45), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 02:54:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:15,865 INFO L93 Difference]: Finished difference Result 8056 states and 9160 transitions. [2023-11-29 02:54:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:54:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 8 states have internal predecessors, (221), 4 states have call successors, (45), 8 states have call predecessors, (45), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 374 [2023-11-29 02:54:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:15,866 INFO L225 Difference]: With dead ends: 8056 [2023-11-29 02:54:15,866 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:54:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 825 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:54:15,872 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 228 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:15,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 214 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:54:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:54:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:54:15,873 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) [2023-11-29 02:54:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:54:15,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 374 [2023-11-29 02:54:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:15,874 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:54:15,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 8 states have internal predecessors, (221), 4 states have call successors, (45), 8 states have call predecessors, (45), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 02:54:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:54:15,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:54:15,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-29 02:54:15,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-29 02:54:15,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-29 02:54:15,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-29 02:54:15,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-29 02:54:15,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-29 02:54:15,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 02:54:16,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 02:54:16,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 02:55:42,316 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse29 (= ~c_dr_st~0 0)) (.cse25 (= |old(~p_dw_st~0)| 0)) (.cse28 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse30 (= ~p_dw_st~0 0)) (.cse26 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~q_free~0 0))) (.cse23 (< 0 ~q_req_up~0)) (.cse8 (not .cse26)) (.cse16 (not (= ~slow_clk_edge~0 1))) (.cse17 (< 0 ~t~0)) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse27 (< 0 ~q_free~0)) (.cse21 (and .cse31 .cse30)) (.cse19 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse13 (and .cse28 .cse31)) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse0 (< ~fast_clk_edge~0 2)) (.cse6 (< 0 ~p_num_write~0)) (.cse7 (< ~slow_clk_edge~0 2)) (.cse22 (not .cse25)) (.cse24 (and .cse29 .cse30)) (.cse12 (< ~p_num_write~0 0)) (.cse1 (not (= |old(~c_dr_st~0)| 0))) (.cse2 (< ~t~0 0)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (and .cse28 .cse29)) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse13 .cse14 .cse8 .cse15 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse21 .cse15 .cse22 .cse10 .cse18 .cse11 .cse12) (or .cse2 .cse13 .cse14 .cse8 .cse15 .cse10 .cse18 .cse11 .cse12) (or .cse23 .cse2 .cse13 .cse4 .cse6 .cse7 .cse8 .cse15 .cse10 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse9 .cse16 .cse22 .cse10 .cse17 .cse18 .cse24 .cse11 .cse12) (or .cse0 .cse2 .cse6 .cse14 .cse21 .cse15 .cse22 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse18 .cse11 .cse12) (or .cse23 .cse2 .cse13 .cse4 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse25 .cse3 .cse5 .cse26 .cse27 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse11 .cse12) (or .cse2 .cse6 .cse14 .cse21 .cse15 .cse22 .cse10 .cse18 .cse11 .cse12) (or .cse0 .cse23 .cse2 .cse13 .cse4 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12) (or .cse2 .cse19 .cse4 .cse6 .cse20 .cse21 .cse15 .cse16 .cse22 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse22 .cse10 .cse18 .cse24 .cse11 .cse12) (or .cse2 .cse25 .cse13 .cse26 .cse27 .cse15 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse21 .cse15 .cse22 .cse10 .cse11 .cse12) (or .cse2 .cse19 .cse25 .cse13 .cse4 .cse20 .cse15 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse22 .cse10 .cse24 .cse11 .cse12) (or .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse20 .cse9 .cse10 .cse11)))) [2023-11-29 02:55:42,317 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 1)) (.cse32 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse25 (= |old(~p_dw_st~0)| 0)) (.cse33 (= ~c_dr_st~0 0)) (.cse35 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse34 (= activate_threads_~tmp~1 0)) (.cse36 (= ~p_dw_st~0 0))) (let ((.cse22 (and .cse35 .cse34 .cse36)) (.cse8 (not (= ~slow_clk_edge~0 1))) (.cse10 (< 0 ~t~0)) (.cse29 (and .cse33 .cse34 .cse36)) (.cse19 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse23 (not .cse25)) (.cse17 (and .cse32 .cse33)) (.cse27 (and .cse33 .cse36)) (.cse24 (and .cse32 .cse35 .cse34)) (.cse31 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse28 (not (= ~p_dw_pc~0 0))) (.cse20 (not (= ~q_free~0 0))) (.cse6 (and .cse35 .cse36)) (.cse11 (not (= ~fast_clk_edge~0 1))) (.cse14 (< ~fast_clk_edge~0 2)) (.cse0 (< 0 ~q_req_up~0)) (.cse2 (and .cse32 .cse35)) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (< 0 ~p_num_write~0)) (.cse18 (< ~slow_clk_edge~0 2)) (.cse5 (not .cse21)) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse15 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (< ~t~0 0)) (.cse16 (not (= ~c_dr_pc~0 0))) (.cse26 (< 0 ~q_free~0)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse12 (not (= 1 ~c_dr_i~0))) (.cse30 (and .cse32 .cse33 .cse34)) (.cse13 (< ~p_num_write~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse18 .cse5 .cse19 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse4 .cse20 .cse21 .cse22 .cse7 .cse23 .cse9 .cse12 .cse13) (or .cse24 .cse1 .cse25 .cse21 .cse26 .cse7 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse20 .cse5 .cse7 .cse9 .cse12 .cse13) (or .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse18 .cse5 .cse19 .cse9 .cse11 .cse27 .cse12 .cse13) (or .cse15 .cse1 .cse16 .cse3 .cse4 .cse28 .cse29 .cse19 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse4 .cse20 .cse21 .cse22 .cse7 .cse23 .cse9 .cse11 .cse12 .cse13) (or .cse15 .cse1 .cse25 .cse16 .cse3 .cse28 .cse19 .cse9 .cse12 .cse30) (or .cse1 .cse31 .cse3 .cse4 .cse28 .cse18 .cse22 .cse7 .cse23 .cse9 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse31 .cse3 .cse4 .cse28 .cse18 .cse22 .cse7 .cse23 .cse9 .cse12 .cse13) (or .cse1 .cse31 .cse3 .cse4 .cse28 .cse22 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse15 .cse1 .cse16 .cse3 .cse4 .cse28 .cse29 .cse18 .cse19 .cse23 .cse9 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13) (or .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse19 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13) (or .cse14 .cse15 .cse1 .cse16 .cse3 .cse4 .cse28 .cse29 .cse18 .cse19 .cse23 .cse9 .cse12 .cse13) (or .cse14 .cse15 .cse1 .cse16 .cse17 .cse20 .cse5 .cse9 .cse12 .cse13) (or .cse15 .cse1 .cse16 .cse17 .cse20 .cse5 .cse9 .cse11 .cse27 .cse12 .cse13) (or .cse24 .cse1 .cse31 .cse25 .cse3 .cse28 .cse7 .cse9 .cse12) (or .cse1 .cse2 .cse20 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse9 .cse12 .cse13) (or .cse15 .cse1 .cse25 .cse16 .cse21 .cse26 .cse9 .cse12 .cse30 .cse13)))) [2023-11-29 02:55:42,317 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2023-11-29 02:55:42,317 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-11-29 02:55:42,317 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2023-11-29 02:55:42,318 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse29 (= ~c_dr_st~0 0)) (.cse25 (= |old(~p_dw_st~0)| 0)) (.cse28 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse30 (= ~p_dw_st~0 0)) (.cse26 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~q_free~0 0))) (.cse23 (< 0 ~q_req_up~0)) (.cse8 (not .cse26)) (.cse16 (not (= ~slow_clk_edge~0 1))) (.cse17 (< 0 ~t~0)) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse27 (< 0 ~q_free~0)) (.cse21 (and .cse31 .cse30)) (.cse19 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse13 (and .cse28 .cse31)) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse0 (< ~fast_clk_edge~0 2)) (.cse6 (< 0 ~p_num_write~0)) (.cse7 (< ~slow_clk_edge~0 2)) (.cse22 (not .cse25)) (.cse24 (and .cse29 .cse30)) (.cse12 (< ~p_num_write~0 0)) (.cse1 (not (= |old(~c_dr_st~0)| 0))) (.cse2 (< ~t~0 0)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (and .cse28 .cse29)) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse13 .cse14 .cse8 .cse15 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse21 .cse15 .cse22 .cse10 .cse18 .cse11 .cse12) (or .cse2 .cse13 .cse14 .cse8 .cse15 .cse10 .cse18 .cse11 .cse12) (or .cse23 .cse2 .cse13 .cse4 .cse6 .cse7 .cse8 .cse15 .cse10 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse9 .cse16 .cse22 .cse10 .cse17 .cse18 .cse24 .cse11 .cse12) (or .cse0 .cse2 .cse6 .cse14 .cse21 .cse15 .cse22 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse18 .cse11 .cse12) (or .cse23 .cse2 .cse13 .cse4 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse25 .cse3 .cse5 .cse26 .cse27 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse11 .cse12) (or .cse2 .cse6 .cse14 .cse21 .cse15 .cse22 .cse10 .cse18 .cse11 .cse12) (or .cse0 .cse23 .cse2 .cse13 .cse4 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12) (or .cse2 .cse19 .cse4 .cse6 .cse20 .cse21 .cse15 .cse16 .cse22 .cse10 .cse17 .cse18 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse22 .cse10 .cse18 .cse24 .cse11 .cse12) (or .cse2 .cse25 .cse13 .cse26 .cse27 .cse15 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse21 .cse15 .cse22 .cse10 .cse11 .cse12) (or .cse2 .cse19 .cse25 .cse13 .cse4 .cse20 .cse15 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse22 .cse10 .cse24 .cse11 .cse12) (or .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse20 .cse9 .cse10 .cse11)))) [2023-11-29 02:55:42,318 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2023-11-29 02:55:42,318 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2023-11-29 02:55:42,318 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L303(lines 290 305) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L116(lines 94 118) no Hoare annotation was computed. [2023-11-29 02:55:42,319 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2023-11-29 02:55:42,320 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2023-11-29 02:55:42,320 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2023-11-29 02:55:42,320 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2023-11-29 02:55:42,320 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2023-11-29 02:55:42,320 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse21 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse3 (not (= ~q_free~0 0))) (.cse9 (not .cse16)) (.cse18 (< 0 ~q_free~0)) (.cse6 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse21)) (.cse19 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse17 (= ~p_dw_st~0 0)) (.cse0 (< ~fast_clk_edge~0 2)) (.cse10 (and (= ~q_write_ev~0 2) .cse21)) (.cse1 (< ~t~0 0)) (.cse11 (not (= ~c_dr_pc~0 0))) (.cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not (= ~c_dr_st~0 0))) (.cse2 (< 0 ~p_num_write~0)) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse14 (< ~slow_clk_edge~0 2)) (.cse15 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse8 (< ~p_num_write~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse14 .cse9 .cse15 .cse4 .cse7 .cse8) (or .cse1 .cse16 .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse13 .cse3 .cse9 .cse4 .cse6 .cse7 .cse8) (or .cse0 (< 0 ~q_req_up~0) .cse10 .cse1 .cse12 .cse2 .cse14 .cse9 .cse4 .cse5 .cse7 .cse8) (or .cse0 .cse10 .cse1 .cse19 .cse12 .cse2 .cse20 .cse14 .cse4 .cse5 .cse7 .cse8) (or .cse1 .cse11 .cse13 .cse16 .cse17 .cse18 .cse4 .cse6 .cse7 .cse8) (or .cse10 .cse1 .cse19 .cse12 .cse20 .cse17 .cse4 .cse5 .cse7) (or .cse10 .cse1 .cse11 .cse12 .cse13 .cse20 .cse15 .cse17 .cse4 .cse7) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse20 .cse14 .cse15 .cse4 .cse7 .cse8)))) [2023-11-29 02:55:42,320 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2023-11-29 02:55:42,320 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse4 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse21 (= ~p_dw_pc~0 1)) (.cse2 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse3 (= ~q_write_ev~0 2)) (.cse5 (= ~q_read_ev~0 2))) (let ((.cse8 (< ~slow_clk_edge~0 2)) (.cse7 (< 0 ~p_num_write~0)) (.cse6 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse15 (and .cse2 (= ~q_req_up~0 0) .cse3 .cse5)) (.cse19 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse16 (not (= ~p_dw_pc~0 |old(~q_req_up~0)|))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse0 (< ~fast_clk_edge~0 2)) (.cse24 (not (= ~q_free~0 0))) (.cse9 (not .cse21)) (.cse1 (< ~t~0 0)) (.cse17 (not (= ~c_dr_pc~0 0))) (.cse20 (and .cse2 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse4 .cse5)) (.cse18 (not (= ~c_dr_st~0 0))) (.cse22 (= ~p_dw_st~0 0)) (.cse23 (< 0 ~q_free~0)) (.cse10 (not (= |old(~q_read_ev~0)| 2))) (.cse12 (not (= 1 ~c_dr_i~0))) (.cse13 (< ~p_num_write~0 0))) (and (or (< 0 |old(~q_req_up~0)|) .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse6 .cse7 .cse14 .cse8 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13) (or .cse0 .cse1 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse15 .cse19 .cse10 .cse12 .cse13) (or .cse0 .cse1 .cse6 .cse18 .cse7 .cse14 .cse8 .cse15 .cse19 .cse10 .cse16 .cse12 .cse13) (or .cse1 .cse20 .cse21 .cse22 .cse23 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse20 .cse7 .cse24 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse6 .cse14 .cse15 .cse22 .cse10 .cse11 .cse16 .cse12) (or .cse1 .cse6 .cse18 .cse14 .cse15 .cse19 .cse22 .cse10 .cse16 .cse12) (or .cse0 .cse1 .cse20 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse17 .cse20 .cse18 .cse24 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse17 .cse20 .cse18 .cse21 .cse22 .cse23 .cse10 .cse12 .cse13)))) [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2023-11-29 02:55:42,321 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse21 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse3 (not (= ~q_free~0 0))) (.cse9 (not .cse16)) (.cse18 (< 0 ~q_free~0)) (.cse6 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse21)) (.cse19 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse17 (= ~p_dw_st~0 0)) (.cse0 (< ~fast_clk_edge~0 2)) (.cse10 (and (= ~q_write_ev~0 2) .cse21)) (.cse1 (< ~t~0 0)) (.cse11 (not (= ~c_dr_pc~0 0))) (.cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not (= ~c_dr_st~0 0))) (.cse2 (< 0 ~p_num_write~0)) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse14 (< ~slow_clk_edge~0 2)) (.cse15 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse8 (< ~p_num_write~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse14 .cse9 .cse15 .cse4 .cse7 .cse8) (or .cse1 .cse16 .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse13 .cse3 .cse9 .cse4 .cse6 .cse7 .cse8) (or .cse0 (< 0 ~q_req_up~0) .cse10 .cse1 .cse12 .cse2 .cse14 .cse9 .cse4 .cse5 .cse7 .cse8) (or .cse0 .cse10 .cse1 .cse19 .cse12 .cse2 .cse20 .cse14 .cse4 .cse5 .cse7 .cse8) (or .cse1 .cse11 .cse13 .cse16 .cse17 .cse18 .cse4 .cse6 .cse7 .cse8) (or .cse10 .cse1 .cse19 .cse12 .cse20 .cse17 .cse4 .cse5 .cse7) (or .cse10 .cse1 .cse11 .cse12 .cse13 .cse20 .cse15 .cse17 .cse4 .cse7) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse20 .cse14 .cse15 .cse4 .cse7 .cse8)))) [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2023-11-29 02:55:42,322 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L349-2(lines 345 360) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 145 193) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 476 534) no Hoare annotation was computed. [2023-11-29 02:55:42,323 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,323 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L899 garLoopResultBuilder]: For program point L351-1(line 351) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~t~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (<= 2 ~fast_clk_edge~0)) [2023-11-29 02:55:42,324 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2023-11-29 02:55:42,324 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,325 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2023-11-29 02:55:42,325 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2023-11-29 02:55:42,325 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 361 378) no Hoare annotation was computed. [2023-11-29 02:55:42,325 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~t~0 0)) (.cse5 (= ~q_write_ev~0 2)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 .cse7 (<= 2 ~fast_clk_edge~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-29 02:55:42,325 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~t~0 0)) (.cse5 (= ~q_write_ev~0 2)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 .cse7 (<= 2 ~fast_clk_edge~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-29 02:55:42,325 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2023-11-29 02:55:42,326 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,326 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,326 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2023-11-29 02:55:42,326 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~t~0 0)) (.cse5 (= ~q_write_ev~0 2)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 .cse7 (<= 2 ~fast_clk_edge~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-29 02:55:42,326 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 02:55:42,327 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,327 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-11-29 02:55:42,327 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2023-11-29 02:55:42,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2023-11-29 02:55:42,327 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,327 INFO L899 garLoopResultBuilder]: For program point L472(lines 461 474) no Hoare annotation was computed. [2023-11-29 02:55:42,327 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point $Ultimate##36(lines 171 179) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 195 253) no Hoare annotation was computed. [2023-11-29 02:55:42,328 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2023-11-29 02:55:42,329 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2023-11-29 02:55:42,329 INFO L895 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: (let ((.cse12 (= ~q_write_ev~0 2))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse3 (let ((.cse14 (= ~q_req_up~0 0))) (or (and .cse14 (= ~c_dr_pc~0 1) .cse12) (and .cse14 .cse12 (= ~c_dr_pc~0 0))))) (.cse11 (not (= ~c_dr_st~0 0))) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse10 (= ~p_num_write~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (<= 2 ~fast_clk_edge~0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse6 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_read_ev~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse4 .cse7 .cse8 .cse5 .cse9) (and .cse1 .cse10 .cse11 .cse4 (<= ~q_req_up~0 0) .cse8 .cse12 .cse13 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11 .cse4 .cse13 .cse5 .cse9) (and .cse1 .cse10 .cse4 .cse7 .cse5 .cse9) (and .cse1 .cse2 .cse6 .cse4 (not .cse8) .cse5 (<= ~q_free~0 0))))) [2023-11-29 02:55:42,329 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 02:55:42,329 INFO L899 garLoopResultBuilder]: For program point L278-1(lines 269 286) no Hoare annotation was computed. [2023-11-29 02:55:42,329 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 404 456) no Hoare annotation was computed. [2023-11-29 02:55:42,329 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2023-11-29 02:55:42,329 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,330 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1))) (let ((.cse2 (= ~p_num_write~0 0)) (.cse5 (not .cse15)) (.cse7 (<= 2 ~slow_clk_edge~0)) (.cse13 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse14 (= ~q_req_up~0 1)) (.cse1 (<= 0 ~t~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse6 (= ~q_write_ev~0 2)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~q_req_up~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse11 .cse4 .cse12 .cse13 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse13 (<= ~q_req_up~0 0) .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse14 .cse1 .cse3 .cse11 .cse4 .cse12 .cse13 .cse8 .cse10) (and .cse0 .cse14 .cse1 .cse3 .cse11 .cse4 .cse12 .cse15 .cse6 .cse8 .cse9 .cse10)))) [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point L231-1(line 231) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2023-11-29 02:55:42,330 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (= ~q_free~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse5 (not .cse11)) (.cse7 (<= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse9 (= ~p_num_write~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (<= 2 ~slow_clk_edge~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~fast_clk_edge~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse8 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse10 .cse16 .cse12 .cse6) (and .cse1 .cse9 .cse4 .cse17 .cse16 .cse6 .cse14) (and .cse1 .cse3 .cse4 .cse17 .cse16 .cse11 .cse6 .cse14) (and .cse15 .cse1 .cse9 .cse4 .cse10 .cse16 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse11 .cse6 .cse8 .cse14) (and .cse1 .cse9 .cse4 .cse16 (<= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse10 .cse12 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse9 .cse4 .cse10 .cse12 .cse13 .cse6 .cse8 .cse14)))) [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L183-1(line 183) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-11-29 02:55:42,331 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2023-11-29 02:55:42,332 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse12 (<= ~q_req_up~0 0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse5 (not .cse14)) (.cse7 (<= ~q_free~0 0)) (.cse1 (<= 0 ~t~0)) (.cse19 (<= 2 ~slow_clk_edge~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse9 (= ~p_num_write~0 0)) (.cse10 (= ~slow_clk_edge~0 1)) (.cse4 (= 1 ~c_dr_i~0)) (.cse18 (= ~q_req_up~0 0)) (.cse13 (= ~t~0 0)) (.cse15 (= ~q_write_ev~0 2)) (.cse6 (= ~q_read_ev~0 2)) (.cse16 (= ~fast_clk_edge~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse16) (and .cse17 .cse1 .cse2 .cse4 .cse18 .cse11 .cse15 .cse6) (and .cse17 .cse1 .cse9 .cse4 .cse18 .cse11 .cse15 .cse19 .cse6 .cse16) (and .cse1 .cse9 .cse4 .cse20 .cse11 .cse6 .cse16) (and .cse1 .cse9 .cse4 .cse11 .cse12 .cse14 .cse15 .cse19 .cse6 .cse16) (and .cse17 .cse0 .cse1 .cse9 .cse4 .cse18 .cse15 .cse19 .cse6 .cse16 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse14 .cse6 .cse16 .cse8) (and .cse17 .cse9 .cse10 .cse4 .cse18 .cse11 .cse13 .cse15 .cse6 .cse16) (and .cse1 .cse3 .cse4 .cse20 .cse11 .cse14 .cse6 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse18 .cse15 .cse6 .cse8) (and .cse17 .cse0 .cse9 .cse10 .cse4 .cse18 .cse13 .cse15 .cse6 .cse16 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse4 .cse18 .cse14 .cse15 .cse19 .cse6 .cse16 .cse8) (and .cse0 .cse9 .cse10 .cse4 .cse18 .cse13 .cse14 .cse15 .cse6 .cse16 .cse8)))) [2023-11-29 02:55:42,332 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2023-11-29 02:55:42,332 INFO L899 garLoopResultBuilder]: For program point L87(lines 65 89) no Hoare annotation was computed. [2023-11-29 02:55:42,332 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2023-11-29 02:55:42,332 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2023-11-29 02:55:42,333 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2023-11-29 02:55:42,333 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2023-11-29 02:55:42,333 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-11-29 02:55:42,333 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2023-11-29 02:55:42,333 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-11-29 02:55:42,333 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-11-29 02:55:42,336 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] [2023-11-29 02:55:42,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:55:42,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:55:42 BoogieIcfgContainer [2023-11-29 02:55:42,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:55:42,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:55:42,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:55:42,365 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:55:42,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:28" (3/4) ... [2023-11-29 02:55:42,367 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:55:42,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-29 02:55:42,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 02:55:42,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-29 02:55:42,382 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-29 02:55:42,383 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-29 02:55:42,384 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:55:42,384 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:55:42,504 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:55:42,504 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:55:42,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:55:42,504 INFO L158 Benchmark]: Toolchain (without parser) took 134448.80ms. Allocated memory was 157.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 120.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-29 02:55:42,505 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:55:42,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.73ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 123.8MB in the end (delta: -3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:55:42,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 157.3MB. Free memory was 123.8MB in the beginning and 121.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:55:42,505 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 157.3MB. Free memory was 121.8MB in the beginning and 119.2MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:55:42,505 INFO L158 Benchmark]: RCFGBuilder took 514.51ms. Allocated memory is still 157.3MB. Free memory was 119.2MB in the beginning and 96.7MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:55:42,506 INFO L158 Benchmark]: TraceAbstraction took 133411.39ms. Allocated memory was 157.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 95.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2023-11-29 02:55:42,506 INFO L158 Benchmark]: Witness Printer took 139.40ms. Allocated memory is still 4.8GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 02:55:42,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.73ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 123.8MB in the end (delta: -3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 157.3MB. Free memory was 123.8MB in the beginning and 121.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.47ms. Allocated memory is still 157.3MB. Free memory was 121.8MB in the beginning and 119.2MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 514.51ms. Allocated memory is still 157.3MB. Free memory was 119.2MB in the beginning and 96.7MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 133411.39ms. Allocated memory was 157.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 95.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 139.40ms. Allocated memory is still 4.8GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: 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 9 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 133.3s, OverallIterations: 25, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 86.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7117 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6981 mSDsluCounter, 9996 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6714 mSDsCounter, 1553 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7428 IncrementalHoareTripleChecker+Invalid, 8981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1553 mSolverCounterUnsat, 3282 mSDtfsCounter, 7428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4446 GetRequests, 4130 SyntacticMatches, 3 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40900occurred in iteration=19, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 3136 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28042 PreInvPairs, 30037 NumberOfFragments, 8524 HoareAnnotationTreeSize, 28042 FomulaSimplifications, 4563490 FormulaSimplificationTreeSizeReduction, 53.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 198492 FormulaSimplificationTreeSizeReductionInter, 31.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 6498 NumberOfCodeBlocks, 6498 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6834 ConstructedInterpolants, 0 QuantifiedInterpolants, 11179 SizeOfPredicates, 1 NumberOfNonLiveVariables, 8157 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 10194/10350 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 6 specifications checked. All of them hold - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0) && (0 <= t)) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (q_free <= 0)) && (c_dr_pc == 0)) || (((((((((((c_dr_st == 0) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) || ((((((((p_dw_pc == 0) && (0 <= t)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2))) || (((((((0 <= t) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((0 <= t) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((((p_dw_pc == 0) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((c_dr_st == 0) && (0 <= t)) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) || ((((((((((0 <= t) && (p_num_write == 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (0 <= t)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) || ((((((((0 <= t) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (q_free <= 0))) || (((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0) && (0 <= t)) && !((p_dw_st == 0))) && ((((q_req_up == 0) && (c_dr_pc == 1)) && (q_write_ev == 2)) || (((q_req_up == 0) && (q_write_ev == 2)) && (c_dr_pc == 0)))) && (1 == c_dr_i)) && (q_read_ev == 2)) || (((((((0 <= t) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((((0 <= t) && (p_num_write == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((p_dw_pc == 0) && (0 <= t)) && (p_num_write == 0)) && ((((q_req_up == 0) && (c_dr_pc == 1)) && (q_write_ev == 2)) || (((q_req_up == 0) && (q_write_ev == 2)) && (c_dr_pc == 0)))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((0 <= t) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((0 <= t) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (q_free <= 0))) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0) && (0 <= t)) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (q_free <= 0)) && (c_dr_pc == 0)) || (((((((((((c_dr_st == 0) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) || ((((((((p_dw_pc == 0) && (0 <= t)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2))) || (((((((0 <= t) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((0 <= t) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((((p_dw_pc == 0) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((c_dr_st == 0) && (0 <= t)) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) || ((((((((((0 <= t) && (p_num_write == 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (0 <= t)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) || ((((((((0 <= t) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (q_free <= 0))) || (((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0) && (0 <= t)) && (p_num_write == 0)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && !((p_dw_pc == 1))) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge)) || (((((((((0 <= t) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((((0 <= t) && (p_num_write == 0)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && !((p_dw_pc == 1))) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || (((((((((q_req_up == 1) && (0 <= t)) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (2 <= fast_clk_edge))) || ((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (0 <= t)) && !((p_dw_st == 0))) && (0 <= p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) RESULT: Ultimate proved your program to be correct! [2023-11-29 02:55:42,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b3807d-26dc-48de-891c-70a8c43162b6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE