./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/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_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:05:23,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:05:23,508 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:05:23,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:05:23,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:05:23,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:05:23,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:05:23,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:05:23,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:05:23,538 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:05:23,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:05:23,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:05:23,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:05:23,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:05:23,541 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:05:23,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:05:23,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:05:23,542 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:05:23,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:05:23,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:05:23,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:05:23,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:05:23,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:05:23,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:05:23,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:05:23,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:05:23,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:05:23,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:05:23,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:05:23,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:05:23,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:05:23,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:05:23,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:05:23,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:05:23,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:05:23,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:05:23,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:05:23,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:05:23,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:05:23,552 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:05:23,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:05:23,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:05:23,552 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_be048102-2682-499e-8dd8-89c14bee828e/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_be048102-2682-499e-8dd8-89c14bee828e/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 ! call(reach_error())) ) 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 -> 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f [2023-11-29 04:05:23,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:05:23,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:05:23,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:05:23,804 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:05:23,805 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:05:23,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2023-11-29 04:05:26,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:05:26,764 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:05:26,764 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2023-11-29 04:05:26,772 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/data/99bd88cab/46f9b5a0369c4a359ef667988dac610c/FLAG0e23fba90 [2023-11-29 04:05:26,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/data/99bd88cab/46f9b5a0369c4a359ef667988dac610c [2023-11-29 04:05:26,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:05:26,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:05:26,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:26,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:05:26,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:05:26,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:26" (1/1) ... [2023-11-29 04:05:26,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51040f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:26, skipping insertion in model container [2023-11-29 04:05:26,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:26" (1/1) ... [2023-11-29 04:05:26,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:05:26,981 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i[915,928] [2023-11-29 04:05:27,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:27,029 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:05:27,043 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i[915,928] [2023-11-29 04:05:27,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:27,077 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:05:27,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27 WrapperNode [2023-11-29 04:05:27,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:27,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:27,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:05:27,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:05:27,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,119 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-11-29 04:05:27,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:27,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:05:27,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:05:27,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:05:27,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,143 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 04:05:27,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:05:27,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:05:27,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:05:27,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:05:27,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (1/1) ... [2023-11-29 04:05:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:05:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:27,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:05:27,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:05:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:05:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:05:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:05:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:05:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:05:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:05:27,308 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:05:27,311 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:05:27,513 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:05:27,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:05:27,552 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:05:27,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:27 BoogieIcfgContainer [2023-11-29 04:05:27,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:05:27,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:05:27,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:05:27,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:05:27,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:05:26" (1/3) ... [2023-11-29 04:05:27,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfc64a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:27, skipping insertion in model container [2023-11-29 04:05:27,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:27" (2/3) ... [2023-11-29 04:05:27,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfc64a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:27, skipping insertion in model container [2023-11-29 04:05:27,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:27" (3/3) ... [2023-11-29 04:05:27,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-34.i [2023-11-29 04:05:27,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:05:27,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:05:27,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:05:27,630 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;@569a3aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:05:27,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:05:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:05:27,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:27,646 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:27,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:27,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 571880049, now seen corresponding path program 1 times [2023-11-29 04:05:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:27,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903754577] [2023-11-29 04:05:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903754577] [2023-11-29 04:05:27,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903754577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:27,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:27,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:05:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676954286] [2023-11-29 04:05:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:27,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:05:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:05:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:05:27,995 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:28,048 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2023-11-29 04:05:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:05:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-11-29 04:05:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:28,059 INFO L225 Difference]: With dead ends: 63 [2023-11-29 04:05:28,059 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 04:05:28,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:05:28,066 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:28,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 04:05:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 04:05:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-11-29 04:05:28,106 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-11-29 04:05:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-11-29 04:05:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-11-29 04:05:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:05:28,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:28,110 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:28,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:05:28,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:28,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 614092019, now seen corresponding path program 1 times [2023-11-29 04:05:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896354312] [2023-11-29 04:05:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896354312] [2023-11-29 04:05:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896354312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:05:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475915620] [2023-11-29 04:05:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:05:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:05:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:05:30,453 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:30,890 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-11-29 04:05:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:05:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-11-29 04:05:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:30,895 INFO L225 Difference]: With dead ends: 85 [2023-11-29 04:05:30,895 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 04:05:30,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:05:30,897 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:30,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:05:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 04:05:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-11-29 04:05:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:05:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-11-29 04:05:30,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-11-29 04:05:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:30,921 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-11-29 04:05:30,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-11-29 04:05:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:05:30,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:30,924 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:30,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:05:30,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:30,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 614151601, now seen corresponding path program 1 times [2023-11-29 04:05:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979133092] [2023-11-29 04:05:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979133092] [2023-11-29 04:05:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979133092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:05:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514526734] [2023-11-29 04:05:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:32,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:05:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:32,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:05:32,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:05:32,519 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:32,926 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-11-29 04:05:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:05:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-11-29 04:05:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:32,929 INFO L225 Difference]: With dead ends: 215 [2023-11-29 04:05:32,929 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 04:05:32,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:05:32,932 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 86 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:32,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 183 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:05:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 04:05:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-11-29 04:05:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 04:05:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-11-29 04:05:32,971 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-11-29 04:05:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:32,972 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-11-29 04:05:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-11-29 04:05:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:32,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:32,974 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:32,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:05:32,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:32,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1438364895, now seen corresponding path program 1 times [2023-11-29 04:05:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759221498] [2023-11-29 04:05:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759221498] [2023-11-29 04:05:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759221498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:05:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341433079] [2023-11-29 04:05:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:33,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:05:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:05:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:05:33,112 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:33,201 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-11-29 04:05:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:05:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 04:05:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:33,204 INFO L225 Difference]: With dead ends: 302 [2023-11-29 04:05:33,204 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 04:05:33,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:05:33,207 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:33,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 04:05:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-11-29 04:05:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-29 04:05:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-11-29 04:05:33,249 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-11-29 04:05:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:33,250 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-11-29 04:05:33,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-11-29 04:05:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:33,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:33,251 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:33,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:05:33,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:33,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 336642467, now seen corresponding path program 1 times [2023-11-29 04:05:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235561265] [2023-11-29 04:05:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235561265] [2023-11-29 04:05:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235561265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:05:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903409050] [2023-11-29 04:05:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:33,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:05:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:05:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:05:33,416 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:33,526 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-11-29 04:05:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:05:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 04:05:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:33,530 INFO L225 Difference]: With dead ends: 366 [2023-11-29 04:05:33,530 INFO L226 Difference]: Without dead ends: 237 [2023-11-29 04:05:33,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:05:33,532 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:33,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-29 04:05:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-11-29 04:05:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 04:05:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-11-29 04:05:33,572 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-11-29 04:05:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:33,573 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-11-29 04:05:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-11-29 04:05:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:33,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:33,575 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:33,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:05:33,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:33,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1618044216, now seen corresponding path program 1 times [2023-11-29 04:05:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956528846] [2023-11-29 04:05:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:35,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956528846] [2023-11-29 04:05:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956528846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:05:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741487537] [2023-11-29 04:05:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:35,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:05:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:35,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:05:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:05:35,644 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:36,120 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-11-29 04:05:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:05:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 04:05:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:36,124 INFO L225 Difference]: With dead ends: 292 [2023-11-29 04:05:36,124 INFO L226 Difference]: Without dead ends: 207 [2023-11-29 04:05:36,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:05:36,126 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:36,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-29 04:05:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-11-29 04:05:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 04:05:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-11-29 04:05:36,159 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-11-29 04:05:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:36,160 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-11-29 04:05:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-11-29 04:05:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:36,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:36,162 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:36,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:05:36,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:36,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891258, now seen corresponding path program 1 times [2023-11-29 04:05:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:36,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980369302] [2023-11-29 04:05:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 04:05:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980369302] [2023-11-29 04:05:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980369302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:05:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546681189] [2023-11-29 04:05:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:36,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:05:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:36,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:05:36,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:05:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:36,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:05:36,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 04:05:36,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:05:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 04:05:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546681189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:05:36,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:05:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-29 04:05:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396409600] [2023-11-29 04:05:36,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:05:36,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:05:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:05:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:05:36,669 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 04:05:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:36,856 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-11-29 04:05:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:05:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 60 [2023-11-29 04:05:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:36,858 INFO L225 Difference]: With dead ends: 286 [2023-11-29 04:05:36,858 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 04:05:36,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:05:36,859 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:36,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 04:05:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-11-29 04:05:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:05:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-11-29 04:05:36,880 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-11-29 04:05:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:36,880 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-11-29 04:05:36,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 04:05:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-11-29 04:05:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 04:05:36,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:36,883 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 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] [2023-11-29 04:05:36,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:05:37,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:05:37,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:37,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1515412901, now seen corresponding path program 1 times [2023-11-29 04:05:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474649947] [2023-11-29 04:05:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:05:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:05:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:05:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:05:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:05:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 04:05:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 04:05:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:05:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:05:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 04:05:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474649947] [2023-11-29 04:05:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474649947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:05:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652567119] [2023-11-29 04:05:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:05:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:05:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:05:37,406 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:05:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:37,526 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2023-11-29 04:05:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:05:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 04:05:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:37,529 INFO L225 Difference]: With dead ends: 205 [2023-11-29 04:05:37,529 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 04:05:37,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:05:37,530 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 04:05:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-11-29 04:05:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 04:05:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-11-29 04:05:37,561 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 118 [2023-11-29 04:05:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:37,562 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-11-29 04:05:37,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:05:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-11-29 04:05:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 04:05:37,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:37,564 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 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] [2023-11-29 04:05:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:05:37,564 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:37,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash 259594461, now seen corresponding path program 1 times [2023-11-29 04:05:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017514862] [2023-11-29 04:05:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:05:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:05:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:05:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:05:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:05:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:05:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:05:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:05:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:05:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 04:05:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 04:05:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:05:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:05:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-11-29 04:05:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:39,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017514862] [2023-11-29 04:05:39,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017514862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:05:39,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80012741] [2023-11-29 04:05:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:39,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:05:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:39,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:05:39,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:05:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:39,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 04:05:39,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 13 proven. 356 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 04:06:31,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:07:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-11-29 04:07:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80012741] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:07:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:07:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 11] total 22 [2023-11-29 04:07:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405117628] [2023-11-29 04:07:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:09,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:07:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:07:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:07:09,961 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:07:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:10,767 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-11-29 04:07:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:07:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 118 [2023-11-29 04:07:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:10,769 INFO L225 Difference]: With dead ends: 113 [2023-11-29 04:07:10,769 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 04:07:10,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:07:10,770 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:10,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 218 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:07:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 04:07:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-11-29 04:07:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 04:07:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2023-11-29 04:07:10,803 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 118 [2023-11-29 04:07:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:10,804 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2023-11-29 04:07:10,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:07:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2023-11-29 04:07:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 04:07:10,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:10,805 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 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] [2023-11-29 04:07:10,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:07:11,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:07:11,006 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:11,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash 259654043, now seen corresponding path program 1 times [2023-11-29 04:07:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542085007] [2023-11-29 04:07:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:07:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:07:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:07:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:07:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:07:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:07:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:07:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:07:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:07:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:07:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:07:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:07:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:07:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:07:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 04:07:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 04:07:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:07:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:07:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-11-29 04:07:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542085007] [2023-11-29 04:07:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542085007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:07:12,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:07:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:07:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199246447] [2023-11-29 04:07:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:12,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:07:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:07:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:07:12,544 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:07:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:12,794 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2023-11-29 04:07:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:07:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 118 [2023-11-29 04:07:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:12,795 INFO L225 Difference]: With dead ends: 93 [2023-11-29 04:07:12,795 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:07:12,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:07:12,796 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:12,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:07:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:07:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:07:12,798 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 04:07:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:07:12,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-11-29 04:07:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:12,798 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:07:12,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:07:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:07:12,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:07:12,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:07:12,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:07:12,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-11-29 04:07:15,545 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,546 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 86 92) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,546 INFO L899 garLoopResultBuilder]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,546 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,547 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,547 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,547 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-11-29 04:07:15,547 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:07:15,548 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:07:15,548 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:07:15,548 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:07:15,550 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:07:15,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:07:15,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:07:15 BoogieIcfgContainer [2023-11-29 04:07:15,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:07:15,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:07:15,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:07:15,564 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:07:15,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:27" (3/4) ... [2023-11-29 04:07:15,566 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:07:15,569 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:07:15,573 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 04:07:15,574 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 04:07:15,574 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:07:15,574 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:07:15,660 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:07:15,661 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:07:15,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:07:15,662 INFO L158 Benchmark]: Toolchain (without parser) took 108871.86ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 74.3MB in the beginning and 437.9MB in the end (delta: -363.5MB). Peak memory consumption was 225.2MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 45.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:07:15,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.81ms. Allocated memory is still 134.2MB. Free memory was 74.2MB in the beginning and 98.5MB in the end (delta: -24.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,663 INFO L158 Benchmark]: Boogie Preprocessor took 41.31ms. Allocated memory is still 134.2MB. Free memory was 96.4MB in the beginning and 93.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,664 INFO L158 Benchmark]: RCFGBuilder took 391.39ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 78.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,664 INFO L158 Benchmark]: TraceAbstraction took 108006.90ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 78.2MB in the beginning and 443.1MB in the end (delta: -364.9MB). Peak memory consumption was 411.0MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,664 INFO L158 Benchmark]: Witness Printer took 97.76ms. Allocated memory is still 721.4MB. Free memory was 443.1MB in the beginning and 437.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:07:15,666 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.17ms. Allocated memory is still 90.2MB. Free memory is still 45.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.81ms. Allocated memory is still 134.2MB. Free memory was 74.2MB in the beginning and 98.5MB in the end (delta: -24.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.31ms. Allocated memory is still 134.2MB. Free memory was 96.4MB in the beginning and 93.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.39ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 78.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 108006.90ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 78.2MB in the beginning and 443.1MB in the end (delta: -364.9MB). Peak memory consumption was 411.0MB. Max. memory is 16.1GB. * Witness Printer took 97.76ms. Allocated memory is still 721.4MB. Free memory was 443.1MB in the beginning and 437.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.9s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 783 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 483 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 416 mSDtfsCounter, 483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 613 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 215 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 238 PreInvPairs, 264 NumberOfFragments, 221 HoareAnnotationTreeSize, 238 FomulaSimplifications, 200704 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 11 FomulaSimplificationsInter, 8522 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1113 ConstructedInterpolants, 0 QuantifiedInterpolants, 5493 SizeOfPredicates, 29 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 4068/4461 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 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((var_1_17 <= var_1_11) && (var_1_11 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0)) && (last_1_var_1_17 <= (256 * (last_1_var_1_17 / 256)))) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:07:15,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be048102-2682-499e-8dd8-89c14bee828e/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