./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/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 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:29:18,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:29:18,372 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:29:18,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:29:18,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:29:18,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:29:18,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:29:18,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:29:18,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:29:18,414 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:29:18,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:29:18,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:29:18,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:29:18,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:29:18,417 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:29:18,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:29:18,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:29:18,418 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:29:18,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:29:18,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:29:18,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:29:18,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:29:18,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:29:18,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:29:18,422 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:29:18,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:29:18,423 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:29:18,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:29:18,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:29:18,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:29:18,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:29:18,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:29:18,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:29:18,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:29:18,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:29:18,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:29:18,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:29:18,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:29:18,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:29:18,428 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:29:18,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:29:18,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:29:18,428 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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/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 -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2023-11-29 06:29:18,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:29:18,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:29:18,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:29:18,702 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:29:18,702 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:29:18,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2023-11-29 06:29:21,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:29:21,605 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:29:21,606 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2023-11-29 06:29:21,615 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/data/35a51e177/08b427ebd35d46db8849aaa8d8367456/FLAG06d427ffd [2023-11-29 06:29:21,636 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/data/35a51e177/08b427ebd35d46db8849aaa8d8367456 [2023-11-29 06:29:21,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:29:21,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:29:21,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:29:21,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:29:21,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:29:21,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc664d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21, skipping insertion in model container [2023-11-29 06:29:21,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:29:21,795 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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2023-11-29 06:29:21,838 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:29:21,851 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:29:21,861 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_f8a30511-a4fa-49fc-b352-35c93f3e40a0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2023-11-29 06:29:21,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:29:21,903 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:29:21,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21 WrapperNode [2023-11-29 06:29:21,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:29:21,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:29:21,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:29:21,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:29:21,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,955 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2023-11-29 06:29:21,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:29:21,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:29:21,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:29:21,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:29:21,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,995 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2023-11-29 06:29:21,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:21,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:29:22,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:29:22,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:29:22,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:29:22,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (1/1) ... [2023-11-29 06:29:22,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:29:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:29:22,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:29:22,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:29:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:29:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:29:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:29:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:29:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:29:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 06:29:22,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 06:29:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 06:29:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 06:29:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 06:29:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 06:29:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 06:29:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:29:22,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 06:29:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 06:29:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 06:29:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 06:29:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 06:29:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 06:29:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:29:22,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:29:22,269 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:29:22,271 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:29:22,587 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:29:22,623 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:29:22,623 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:29:22,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:29:22 BoogieIcfgContainer [2023-11-29 06:29:22,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:29:22,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:29:22,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:29:22,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:29:22,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:29:21" (1/3) ... [2023-11-29 06:29:22,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dbdb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:29:22, skipping insertion in model container [2023-11-29 06:29:22,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:29:21" (2/3) ... [2023-11-29 06:29:22,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dbdb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:29:22, skipping insertion in model container [2023-11-29 06:29:22,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:29:22" (3/3) ... [2023-11-29 06:29:22,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2023-11-29 06:29:22,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:29:22,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:29:22,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:29:22,698 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;@428704ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:29:22,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:29:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:29:22,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:22,712 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:22,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:22,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -710106841, now seen corresponding path program 1 times [2023-11-29 06:29:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:22,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194577777] [2023-11-29 06:29:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194577777] [2023-11-29 06:29:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194577777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:23,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:29:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103446824] [2023-11-29 06:29:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:29:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:29:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:29:23,054 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:29:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:23,093 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-11-29 06:29:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:29:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-11-29 06:29:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:23,103 INFO L225 Difference]: With dead ends: 129 [2023-11-29 06:29:23,104 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 06:29:23,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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 06:29:23,111 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:23,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 06:29:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-29 06:29:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-11-29 06:29:23,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-11-29 06:29:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:23,154 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-11-29 06:29:23,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 06:29:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-11-29 06:29:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:29:23,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:23,159 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:23,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:29:23,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:23,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash -770566889, now seen corresponding path program 1 times [2023-11-29 06:29:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934143971] [2023-11-29 06:29:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934143971] [2023-11-29 06:29:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934143971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:29:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106680271] [2023-11-29 06:29:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:23,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:29:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:23,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:29:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:29:23,458 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:23,514 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2023-11-29 06:29:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:29:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-29 06:29:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:23,517 INFO L225 Difference]: With dead ends: 135 [2023-11-29 06:29:23,517 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 06:29:23,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 06:29:23,518 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:23,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 06:29:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-11-29 06:29:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-11-29 06:29:23,528 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2023-11-29 06:29:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:23,529 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-11-29 06:29:23,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-11-29 06:29:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:29:23,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:23,531 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:23,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:29:23,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:23,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:23,532 INFO L85 PathProgramCache]: Analyzing trace with hash -713308587, now seen corresponding path program 1 times [2023-11-29 06:29:23,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:23,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141628902] [2023-11-29 06:29:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141628902] [2023-11-29 06:29:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141628902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:29:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481893236] [2023-11-29 06:29:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:29:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:29:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:29:23,689 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:23,729 INFO L93 Difference]: Finished difference Result 135 states and 192 transitions. [2023-11-29 06:29:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:29:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-29 06:29:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:23,732 INFO L225 Difference]: With dead ends: 135 [2023-11-29 06:29:23,732 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 06:29:23,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 06:29:23,734 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:23,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 06:29:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-11-29 06:29:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-11-29 06:29:23,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2023-11-29 06:29:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:23,745 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-11-29 06:29:23,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-11-29 06:29:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:29:23,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:23,747 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:29:23,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:23,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash -713249005, now seen corresponding path program 1 times [2023-11-29 06:29:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155077260] [2023-11-29 06:29:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155077260] [2023-11-29 06:29:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155077260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:29:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968429267] [2023-11-29 06:29:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:23,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:29:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:29:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:29:23,970 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:24,021 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-11-29 06:29:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:29:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-29 06:29:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:24,024 INFO L225 Difference]: With dead ends: 160 [2023-11-29 06:29:24,024 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 06:29:24,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 06:29:24,026 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:24,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 255 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 06:29:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2023-11-29 06:29:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-11-29 06:29:24,037 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2023-11-29 06:29:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:24,037 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-11-29 06:29:24,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-11-29 06:29:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 06:29:24,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:24,040 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:29:24,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:24,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -637477704, now seen corresponding path program 1 times [2023-11-29 06:29:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039492103] [2023-11-29 06:29:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039492103] [2023-11-29 06:29:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039492103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265268757] [2023-11-29 06:29:24,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:24,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:24,274 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:24,389 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2023-11-29 06:29:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:29:24,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-11-29 06:29:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:24,391 INFO L225 Difference]: With dead ends: 228 [2023-11-29 06:29:24,391 INFO L226 Difference]: Without dead ends: 161 [2023-11-29 06:29:24,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:29:24,393 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 201 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:24,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 650 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-29 06:29:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2023-11-29 06:29:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-11-29 06:29:24,404 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2023-11-29 06:29:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:24,405 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-11-29 06:29:24,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-11-29 06:29:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 06:29:24,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:24,407 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:24,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:29:24,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:24,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2026116434, now seen corresponding path program 1 times [2023-11-29 06:29:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884007542] [2023-11-29 06:29:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:24,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:24,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884007542] [2023-11-29 06:29:24,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884007542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:24,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:24,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358448719] [2023-11-29 06:29:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:24,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:24,673 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:24,753 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2023-11-29 06:29:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:29:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-11-29 06:29:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:24,755 INFO L225 Difference]: With dead ends: 211 [2023-11-29 06:29:24,756 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 06:29:24,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:24,757 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:24,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 495 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 06:29:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 78. [2023-11-29 06:29:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2023-11-29 06:29:24,766 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2023-11-29 06:29:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:24,766 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2023-11-29 06:29:24,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2023-11-29 06:29:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 06:29:24,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:24,768 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:24,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:29:24,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:24,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -22400883, now seen corresponding path program 1 times [2023-11-29 06:29:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917652390] [2023-11-29 06:29:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917652390] [2023-11-29 06:29:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917652390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:24,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127604748] [2023-11-29 06:29:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:24,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:24,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:24,909 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:24,964 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2023-11-29 06:29:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:29:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-11-29 06:29:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:24,966 INFO L225 Difference]: With dead ends: 171 [2023-11-29 06:29:24,966 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 06:29:24,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:29:24,968 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:24,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 06:29:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2023-11-29 06:29:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2023-11-29 06:29:24,975 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2023-11-29 06:29:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:24,976 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2023-11-29 06:29:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2023-11-29 06:29:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 06:29:24,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:24,977 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:24,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:29:24,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:24,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1221843874, now seen corresponding path program 1 times [2023-11-29 06:29:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583073881] [2023-11-29 06:29:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583073881] [2023-11-29 06:29:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583073881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:25,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:25,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:25,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250469036] [2023-11-29 06:29:25,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:25,162 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:25,231 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2023-11-29 06:29:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:29:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-11-29 06:29:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:25,233 INFO L225 Difference]: With dead ends: 192 [2023-11-29 06:29:25,233 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 06:29:25,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:25,235 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:25,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 06:29:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2023-11-29 06:29:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2023-11-29 06:29:25,242 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2023-11-29 06:29:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:25,242 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2023-11-29 06:29:25,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2023-11-29 06:29:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 06:29:25,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:25,244 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:25,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:29:25,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:25,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1308385672, now seen corresponding path program 1 times [2023-11-29 06:29:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970338464] [2023-11-29 06:29:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:25,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970338464] [2023-11-29 06:29:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970338464] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927651820] [2023-11-29 06:29:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:25,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:25,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:29:25,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:29:25,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:29:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:25,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 06:29:25,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:26,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:29:26,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 06:29:26,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 06:29:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 06:29:26,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:29:26,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 06:29:26,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-29 06:29:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927651820] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:29:26,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:29:26,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2023-11-29 06:29:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425694717] [2023-11-29 06:29:26,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:29:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 06:29:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 06:29:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:29:26,899 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 27 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 8 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-29 06:29:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:27,924 INFO L93 Difference]: Finished difference Result 296 states and 392 transitions. [2023-11-29 06:29:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 06:29:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 8 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 74 [2023-11-29 06:29:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:27,927 INFO L225 Difference]: With dead ends: 296 [2023-11-29 06:29:27,927 INFO L226 Difference]: Without dead ends: 216 [2023-11-29 06:29:27,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=546, Invalid=2004, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 06:29:27,930 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 799 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:27,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 685 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:29:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-29 06:29:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2023-11-29 06:29:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 185 states have internal predecessors, (238), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 06:29:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions. [2023-11-29 06:29:27,946 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 74 [2023-11-29 06:29:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:27,946 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 270 transitions. [2023-11-29 06:29:27,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 8 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-29 06:29:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions. [2023-11-29 06:29:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:27,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:27,948 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:27,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 06:29:28,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:28,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:28,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1697474561, now seen corresponding path program 1 times [2023-11-29 06:29:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:28,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451356331] [2023-11-29 06:29:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451356331] [2023-11-29 06:29:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451356331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:29,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:29:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491515779] [2023-11-29 06:29:29,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:29,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:29:29,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:29:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:29:29,350 INFO L87 Difference]: Start difference. First operand 204 states and 270 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:29:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:30,884 INFO L93 Difference]: Finished difference Result 448 states and 590 transitions. [2023-11-29 06:29:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:29:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2023-11-29 06:29:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:30,887 INFO L225 Difference]: With dead ends: 448 [2023-11-29 06:29:30,887 INFO L226 Difference]: Without dead ends: 245 [2023-11-29 06:29:30,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2023-11-29 06:29:30,889 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 417 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:30,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 988 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:29:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-29 06:29:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2023-11-29 06:29:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 189 states have internal predecessors, (242), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 06:29:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2023-11-29 06:29:30,908 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 75 [2023-11-29 06:29:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:30,909 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2023-11-29 06:29:30,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:29:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2023-11-29 06:29:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:30,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:30,910 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:30,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:29:30,910 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1586375485, now seen corresponding path program 1 times [2023-11-29 06:29:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958696653] [2023-11-29 06:29:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:31,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:31,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958696653] [2023-11-29 06:29:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958696653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:31,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710459942] [2023-11-29 06:29:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:31,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:31,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:31,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:31,066 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:31,200 INFO L93 Difference]: Finished difference Result 474 states and 624 transitions. [2023-11-29 06:29:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:29:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:31,203 INFO L225 Difference]: With dead ends: 474 [2023-11-29 06:29:31,203 INFO L226 Difference]: Without dead ends: 267 [2023-11-29 06:29:31,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:29:31,204 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 118 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:31,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 509 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-29 06:29:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 204. [2023-11-29 06:29:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.289617486338798) internal successors, (236), 185 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 06:29:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 268 transitions. [2023-11-29 06:29:31,237 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 268 transitions. Word has length 75 [2023-11-29 06:29:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:31,237 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 268 transitions. [2023-11-29 06:29:31,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 268 transitions. [2023-11-29 06:29:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:31,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:31,239 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:31,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:29:31,240 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:31,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1478619843, now seen corresponding path program 1 times [2023-11-29 06:29:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554401743] [2023-11-29 06:29:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554401743] [2023-11-29 06:29:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554401743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517758751] [2023-11-29 06:29:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:31,424 INFO L87 Difference]: Start difference. First operand 204 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:31,575 INFO L93 Difference]: Finished difference Result 485 states and 633 transitions. [2023-11-29 06:29:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:29:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:31,577 INFO L225 Difference]: With dead ends: 485 [2023-11-29 06:29:31,578 INFO L226 Difference]: Without dead ends: 273 [2023-11-29 06:29:31,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:29:31,579 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 121 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:31,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 554 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-29 06:29:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 208. [2023-11-29 06:29:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.2688172043010753) internal successors, (236), 188 states have internal predecessors, (236), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 06:29:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2023-11-29 06:29:31,597 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 75 [2023-11-29 06:29:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:31,598 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2023-11-29 06:29:31,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2023-11-29 06:29:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:31,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:31,599 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:31,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:29:31,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:31,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1805230203, now seen corresponding path program 1 times [2023-11-29 06:29:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374746855] [2023-11-29 06:29:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374746855] [2023-11-29 06:29:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374746855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-29 06:29:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125696417] [2023-11-29 06:29:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:29:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:29:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:29:32,716 INFO L87 Difference]: Start difference. First operand 208 states and 268 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:29:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:34,379 INFO L93 Difference]: Finished difference Result 848 states and 1078 transitions. [2023-11-29 06:29:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 06:29:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2023-11-29 06:29:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:34,385 INFO L225 Difference]: With dead ends: 848 [2023-11-29 06:29:34,385 INFO L226 Difference]: Without dead ends: 641 [2023-11-29 06:29:34,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 06:29:34,388 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1092 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:34,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1135 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:29:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-11-29 06:29:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 381. [2023-11-29 06:29:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 340 states have (on average 1.261764705882353) internal successors, (429), 343 states have internal predecessors, (429), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 06:29:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2023-11-29 06:29:34,433 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 75 [2023-11-29 06:29:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:34,433 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2023-11-29 06:29:34,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:29:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2023-11-29 06:29:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:34,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:34,435 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:29:34,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:34,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -374470502, now seen corresponding path program 1 times [2023-11-29 06:29:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351891079] [2023-11-29 06:29:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351891079] [2023-11-29 06:29:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351891079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485051236] [2023-11-29 06:29:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:34,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:34,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:34,580 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:34,678 INFO L93 Difference]: Finished difference Result 911 states and 1182 transitions. [2023-11-29 06:29:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:29:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:34,682 INFO L225 Difference]: With dead ends: 911 [2023-11-29 06:29:34,682 INFO L226 Difference]: Without dead ends: 531 [2023-11-29 06:29:34,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:29:34,684 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 80 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:34,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 410 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-11-29 06:29:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2023-11-29 06:29:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.2579710144927536) internal successors, (434), 348 states have internal predecessors, (434), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 06:29:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 494 transitions. [2023-11-29 06:29:34,717 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 494 transitions. Word has length 75 [2023-11-29 06:29:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:34,718 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 494 transitions. [2023-11-29 06:29:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 494 transitions. [2023-11-29 06:29:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:34,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:34,719 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:29:34,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:34,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1071944993, now seen corresponding path program 1 times [2023-11-29 06:29:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707022372] [2023-11-29 06:29:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:34,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:34,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707022372] [2023-11-29 06:29:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707022372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:34,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:34,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572551006] [2023-11-29 06:29:34,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:34,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:34,892 INFO L87 Difference]: Start difference. First operand 386 states and 494 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:35,045 INFO L93 Difference]: Finished difference Result 972 states and 1240 transitions. [2023-11-29 06:29:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:29:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:35,049 INFO L225 Difference]: With dead ends: 972 [2023-11-29 06:29:35,049 INFO L226 Difference]: Without dead ends: 587 [2023-11-29 06:29:35,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:29:35,051 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 132 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:35,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 429 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-11-29 06:29:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2023-11-29 06:29:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 338 states have (on average 1.2337278106508875) internal successors, (417), 340 states have internal predecessors, (417), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 06:29:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 473 transitions. [2023-11-29 06:29:35,087 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 473 transitions. Word has length 75 [2023-11-29 06:29:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:35,087 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 473 transitions. [2023-11-29 06:29:35,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 473 transitions. [2023-11-29 06:29:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:35,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:35,089 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:35,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:29:35,089 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:35,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -843101452, now seen corresponding path program 1 times [2023-11-29 06:29:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987692188] [2023-11-29 06:29:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987692188] [2023-11-29 06:29:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987692188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72540796] [2023-11-29 06:29:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:29:35,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:29:35,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:29:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:35,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 06:29:35,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:35,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:29:35,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2023-11-29 06:29:35,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-11-29 06:29:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:36,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:29:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72540796] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:36,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:29:36,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 11] total 19 [2023-11-29 06:29:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913618470] [2023-11-29 06:29:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:29:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:29:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:29:36,256 INFO L87 Difference]: Start difference. First operand 377 states and 473 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:36,668 INFO L93 Difference]: Finished difference Result 917 states and 1150 transitions. [2023-11-29 06:29:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:29:36,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:36,673 INFO L225 Difference]: With dead ends: 917 [2023-11-29 06:29:36,674 INFO L226 Difference]: Without dead ends: 541 [2023-11-29 06:29:36,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:29:36,675 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 187 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:36,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 783 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:29:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-11-29 06:29:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 180. [2023-11-29 06:29:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.23125) internal successors, (197), 161 states have internal predecessors, (197), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 06:29:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2023-11-29 06:29:36,698 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 75 [2023-11-29 06:29:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:36,698 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2023-11-29 06:29:36,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2023-11-29 06:29:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:29:36,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:36,700 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:36,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:29:36,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 06:29:36,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:36,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1541092446, now seen corresponding path program 1 times [2023-11-29 06:29:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:36,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010543157] [2023-11-29 06:29:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:37,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010543157] [2023-11-29 06:29:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010543157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95987681] [2023-11-29 06:29:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:37,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:37,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:37,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:37,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:37,022 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:37,144 INFO L93 Difference]: Finished difference Result 372 states and 463 transitions. [2023-11-29 06:29:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:29:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-29 06:29:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:37,147 INFO L225 Difference]: With dead ends: 372 [2023-11-29 06:29:37,147 INFO L226 Difference]: Without dead ends: 193 [2023-11-29 06:29:37,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:29:37,148 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:37,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 351 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-29 06:29:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2023-11-29 06:29:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.225) internal successors, (196), 161 states have internal predecessors, (196), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 06:29:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-11-29 06:29:37,165 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 75 [2023-11-29 06:29:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:37,166 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-11-29 06:29:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-11-29 06:29:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:29:37,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:37,167 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:37,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:29:37,167 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:37,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1631279565, now seen corresponding path program 1 times [2023-11-29 06:29:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:37,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708486155] [2023-11-29 06:29:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708486155] [2023-11-29 06:29:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708486155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855352067] [2023-11-29 06:29:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:37,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:37,341 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:37,414 INFO L93 Difference]: Finished difference Result 431 states and 536 transitions. [2023-11-29 06:29:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:29:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-29 06:29:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:37,416 INFO L225 Difference]: With dead ends: 431 [2023-11-29 06:29:37,416 INFO L226 Difference]: Without dead ends: 252 [2023-11-29 06:29:37,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:37,417 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:37,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 307 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-29 06:29:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2023-11-29 06:29:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.2125) internal successors, (194), 161 states have internal predecessors, (194), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 06:29:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2023-11-29 06:29:37,436 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 77 [2023-11-29 06:29:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:37,436 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2023-11-29 06:29:37,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2023-11-29 06:29:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:29:37,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:37,437 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:37,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:29:37,437 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:37,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 293832352, now seen corresponding path program 1 times [2023-11-29 06:29:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:37,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925602209] [2023-11-29 06:29:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925602209] [2023-11-29 06:29:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925602209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:29:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790896581] [2023-11-29 06:29:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:29:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:29:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:37,600 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:37,726 INFO L93 Difference]: Finished difference Result 388 states and 477 transitions. [2023-11-29 06:29:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:29:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-29 06:29:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:37,728 INFO L225 Difference]: With dead ends: 388 [2023-11-29 06:29:37,728 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 06:29:37,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:29:37,729 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 73 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:37,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 359 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 06:29:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 180. [2023-11-29 06:29:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.20625) internal successors, (193), 161 states have internal predecessors, (193), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 06:29:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2023-11-29 06:29:37,747 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 77 [2023-11-29 06:29:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:37,748 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2023-11-29 06:29:37,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2023-11-29 06:29:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:29:37,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:37,749 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:37,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:29:37,750 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:37,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1791340259, now seen corresponding path program 1 times [2023-11-29 06:29:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468722303] [2023-11-29 06:29:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468722303] [2023-11-29 06:29:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468722303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785435637] [2023-11-29 06:29:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:29:38,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:29:38,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:29:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:38,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 06:29:38,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:38,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:29:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 71 [2023-11-29 06:29:39,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2023-11-29 06:29:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:39,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:29:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785435637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:29:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-11-29 06:29:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267305557] [2023-11-29 06:29:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:39,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:29:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:29:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:29:39,044 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:39,387 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2023-11-29 06:29:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:29:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-29 06:29:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:39,389 INFO L225 Difference]: With dead ends: 241 [2023-11-29 06:29:39,390 INFO L226 Difference]: Without dead ends: 239 [2023-11-29 06:29:39,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:29:39,391 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 130 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:39,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 515 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:29:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-29 06:29:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2023-11-29 06:29:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.1793478260869565) internal successors, (217), 186 states have internal predecessors, (217), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 06:29:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2023-11-29 06:29:39,434 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 77 [2023-11-29 06:29:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:39,435 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2023-11-29 06:29:39,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2023-11-29 06:29:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:29:39,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:39,437 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:39,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 06:29:39,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:39,638 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:39,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1791280677, now seen corresponding path program 1 times [2023-11-29 06:29:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:39,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723644089] [2023-11-29 06:29:39,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723644089] [2023-11-29 06:29:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723644089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232269358] [2023-11-29 06:29:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:39,780 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:39,863 INFO L93 Difference]: Finished difference Result 403 states and 488 transitions. [2023-11-29 06:29:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:29:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-29 06:29:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:39,866 INFO L225 Difference]: With dead ends: 403 [2023-11-29 06:29:39,866 INFO L226 Difference]: Without dead ends: 220 [2023-11-29 06:29:39,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:29:39,867 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:39,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 329 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-29 06:29:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2023-11-29 06:29:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.197080291970803) internal successors, (164), 137 states have internal predecessors, (164), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2023-11-29 06:29:39,885 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 77 [2023-11-29 06:29:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:39,886 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2023-11-29 06:29:39,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2023-11-29 06:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:29:39,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:39,887 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:39,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:29:39,887 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:39,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1734022375, now seen corresponding path program 1 times [2023-11-29 06:29:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756457072] [2023-11-29 06:29:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:29:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756457072] [2023-11-29 06:29:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756457072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84791296] [2023-11-29 06:29:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:29:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:29:40,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:29:40,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:29:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:40,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 06:29:40,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:40,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 06:29:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:40,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:29:40,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84791296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:40,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:29:40,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2023-11-29 06:29:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032680178] [2023-11-29 06:29:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:40,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:29:40,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:29:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:29:40,734 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:41,080 INFO L93 Difference]: Finished difference Result 405 states and 483 transitions. [2023-11-29 06:29:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:29:41,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-29 06:29:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:41,085 INFO L225 Difference]: With dead ends: 405 [2023-11-29 06:29:41,085 INFO L226 Difference]: Without dead ends: 256 [2023-11-29 06:29:41,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:29:41,087 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 174 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:41,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 529 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-29 06:29:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 203. [2023-11-29 06:29:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 190 states have (on average 1.194736842105263) internal successors, (227), 190 states have internal predecessors, (227), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:29:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2023-11-29 06:29:41,104 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 77 [2023-11-29 06:29:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:41,105 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2023-11-29 06:29:41,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2023-11-29 06:29:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-29 06:29:41,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:41,106 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:41,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:29:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 06:29:41,306 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:41,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1207142703, now seen corresponding path program 1 times [2023-11-29 06:29:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:41,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828070281] [2023-11-29 06:29:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:41,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:41,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828070281] [2023-11-29 06:29:41,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828070281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:41,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:29:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619729991] [2023-11-29 06:29:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:41,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:29:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:29:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:29:41,721 INFO L87 Difference]: Start difference. First operand 203 states and 243 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 06:29:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:42,232 INFO L93 Difference]: Finished difference Result 625 states and 743 transitions. [2023-11-29 06:29:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 06:29:42,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2023-11-29 06:29:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:42,235 INFO L225 Difference]: With dead ends: 625 [2023-11-29 06:29:42,235 INFO L226 Difference]: Without dead ends: 423 [2023-11-29 06:29:42,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2023-11-29 06:29:42,236 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 395 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:42,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 707 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:29:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-11-29 06:29:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 307. [2023-11-29 06:29:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 288 states have (on average 1.1701388888888888) internal successors, (337), 289 states have internal predecessors, (337), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:29:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 361 transitions. [2023-11-29 06:29:42,265 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 361 transitions. Word has length 78 [2023-11-29 06:29:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:42,266 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 361 transitions. [2023-11-29 06:29:42,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 06:29:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 361 transitions. [2023-11-29 06:29:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-29 06:29:42,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:42,267 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:42,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 06:29:42,267 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:42,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1425997421, now seen corresponding path program 1 times [2023-11-29 06:29:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781034296] [2023-11-29 06:29:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781034296] [2023-11-29 06:29:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781034296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294479189] [2023-11-29 06:29:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:42,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:42,361 INFO L87 Difference]: Start difference. First operand 307 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:42,480 INFO L93 Difference]: Finished difference Result 802 states and 937 transitions. [2023-11-29 06:29:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:29:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-11-29 06:29:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:42,483 INFO L225 Difference]: With dead ends: 802 [2023-11-29 06:29:42,483 INFO L226 Difference]: Without dead ends: 496 [2023-11-29 06:29:42,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:42,484 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 61 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:42,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 494 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-29 06:29:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 344. [2023-11-29 06:29:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 325 states have (on average 1.16) internal successors, (377), 326 states have internal predecessors, (377), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:29:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 401 transitions. [2023-11-29 06:29:42,520 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 401 transitions. Word has length 78 [2023-11-29 06:29:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:42,520 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 401 transitions. [2023-11-29 06:29:42,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 401 transitions. [2023-11-29 06:29:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-29 06:29:42,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:42,521 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:42,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 06:29:42,522 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:42,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1189487033, now seen corresponding path program 1 times [2023-11-29 06:29:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684304054] [2023-11-29 06:29:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684304054] [2023-11-29 06:29:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684304054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:29:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649512282] [2023-11-29 06:29:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:42,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:29:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:29:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:29:42,620 INFO L87 Difference]: Start difference. First operand 344 states and 401 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:42,695 INFO L93 Difference]: Finished difference Result 604 states and 703 transitions. [2023-11-29 06:29:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:29:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-11-29 06:29:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:42,697 INFO L225 Difference]: With dead ends: 604 [2023-11-29 06:29:42,697 INFO L226 Difference]: Without dead ends: 261 [2023-11-29 06:29:42,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 06:29:42,698 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:42,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 202 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-29 06:29:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2023-11-29 06:29:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 242 states have (on average 1.1487603305785123) internal successors, (278), 243 states have internal predecessors, (278), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:29:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 302 transitions. [2023-11-29 06:29:42,729 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 302 transitions. Word has length 78 [2023-11-29 06:29:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:42,730 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 302 transitions. [2023-11-29 06:29:42,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 302 transitions. [2023-11-29 06:29:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 06:29:42,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:42,732 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:42,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 06:29:42,732 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:42,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 290864691, now seen corresponding path program 1 times [2023-11-29 06:29:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266642024] [2023-11-29 06:29:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:42,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266642024] [2023-11-29 06:29:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266642024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398889233] [2023-11-29 06:29:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:42,854 INFO L87 Difference]: Start difference. First operand 261 states and 302 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:42,979 INFO L93 Difference]: Finished difference Result 563 states and 647 transitions. [2023-11-29 06:29:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:29:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-11-29 06:29:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:42,981 INFO L225 Difference]: With dead ends: 563 [2023-11-29 06:29:42,982 INFO L226 Difference]: Without dead ends: 303 [2023-11-29 06:29:42,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:29:42,983 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 66 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:42,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 313 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-29 06:29:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 263. [2023-11-29 06:29:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 244 states have (on average 1.1475409836065573) internal successors, (280), 245 states have internal predecessors, (280), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:29:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2023-11-29 06:29:43,012 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 79 [2023-11-29 06:29:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:43,013 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2023-11-29 06:29:43,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2023-11-29 06:29:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 06:29:43,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:43,014 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:43,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 06:29:43,014 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:43,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1186718059, now seen corresponding path program 1 times [2023-11-29 06:29:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828708084] [2023-11-29 06:29:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828708084] [2023-11-29 06:29:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828708084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790104374] [2023-11-29 06:29:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:43,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:43,145 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:43,230 INFO L93 Difference]: Finished difference Result 669 states and 768 transitions. [2023-11-29 06:29:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:29:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-11-29 06:29:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:43,232 INFO L225 Difference]: With dead ends: 669 [2023-11-29 06:29:43,232 INFO L226 Difference]: Without dead ends: 407 [2023-11-29 06:29:43,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:29:43,233 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 427 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:29:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-29 06:29:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 245. [2023-11-29 06:29:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 226 states have (on average 1.1327433628318584) internal successors, (256), 227 states have internal predecessors, (256), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:29:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2023-11-29 06:29:43,254 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 81 [2023-11-29 06:29:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:43,255 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2023-11-29 06:29:43,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2023-11-29 06:29:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 06:29:43,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:43,256 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:43,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 06:29:43,256 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:29:43,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1145692908, now seen corresponding path program 1 times [2023-11-29 06:29:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:29:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676491465] [2023-11-29 06:29:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:29:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:29:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:29:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:29:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:29:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:29:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:29:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:29:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:29:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 06:29:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:29:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676491465] [2023-11-29 06:29:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676491465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:29:43,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:29:43,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:29:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626159709] [2023-11-29 06:29:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:29:43,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:29:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:29:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:29:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:29:43,349 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:43,449 INFO L93 Difference]: Finished difference Result 483 states and 546 transitions. [2023-11-29 06:29:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:29:43,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-11-29 06:29:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:43,450 INFO L225 Difference]: With dead ends: 483 [2023-11-29 06:29:43,450 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:29:43,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:29:43,451 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:43,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 258 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:29:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:29:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:29:43,452 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 06:29:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:29:43,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-11-29 06:29:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:43,453 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:29:43,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:29:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:29:43,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:29:43,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:29:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 06:29:43,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:30:20,618 WARN L293 SmtUtils]: Spent 35.67s on a formula simplification. DAG size of input: 213 DAG size of output: 243 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 06:30:26,105 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 06:30:26,105 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 06:30:26,105 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 06:30:26,105 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 06:30:26,106 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (let ((.cse4 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse10 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset)) (.cse11 (select .cse4 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse11)) (.cse2 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse3 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse5 (<= 0 (+ .cse10 128))) (.cse6 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset) (select .cse4 ~var_1_8_Pointer~0.offset)) .cse5 .cse6 (let ((.cse8 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse7 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse7) (= .cse7 (+ 65536 .cse8))) (and (= .cse7 .cse8) (<= .cse7 32767)))) .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse10 1) .cse11) .cse5 .cse6 .cse9))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,106 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-29 06:30:26,106 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 06:30:26,106 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 06:30:26,106 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 06:30:26,107 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (and (let ((.cse4 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse10 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset)) (.cse11 (select .cse4 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse11)) (.cse2 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse3 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse5 (<= 0 (+ .cse10 128))) (.cse6 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset) (select .cse4 ~var_1_8_Pointer~0.offset)) .cse5 .cse6 (let ((.cse8 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse7 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse7) (= .cse7 (+ 65536 .cse8))) (and (= .cse7 .cse8) (<= .cse7 32767)))) .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse10 1) .cse11) .cse5 .cse6 .cse9))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,107 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-29 06:30:26,107 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-11-29 06:30:26,107 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:30:26,108 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 77) no Hoare annotation was computed. [2023-11-29 06:30:26,108 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (let ((.cse4 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse10 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset)) (.cse11 (select .cse4 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse11)) (.cse2 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse3 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse5 (<= 0 (+ .cse10 128))) (.cse6 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset) (select .cse4 ~var_1_8_Pointer~0.offset)) .cse5 .cse6 (let ((.cse8 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse7 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse7) (= .cse7 (+ 65536 .cse8))) (and (= .cse7 .cse8) (<= .cse7 32767)))) .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse10 1) .cse11) .cse5 .cse6 .cse9))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |ULTIMATE.start_updateVariables_#t~mem33#1| (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,108 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-29 06:30:26,108 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 78) no Hoare annotation was computed. [2023-11-29 06:30:26,109 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2023-11-29 06:30:26,109 INFO L895 garLoopResultBuilder]: At program point L105-2(lines 105 111) the Hoare annotation is: (and (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (let ((.cse10 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse8 (select .cse10 0))) (let ((.cse1 (= ~var_1_8_Pointer~0.offset 0)) (.cse2 (<= 1073741822 .cse8)) (.cse3 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse4 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse9 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse5 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset)) (.cse6 (= |~#var_1_8~0.offset| 0)) (.cse7 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|))) (or (let ((.cse0 (+ .cse5 1))) (and (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse5 128)) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 .cse8) .cse6 .cse7 (<= 0 .cse5))) (<= .cse0 .cse9))) (and .cse1 .cse2 .cse3 .cse4 (= .cse9 (select .cse10 ~var_1_8_Pointer~0.offset)) (<= .cse9 .cse5) .cse6 (let ((.cse12 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse11 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse11) (= .cse11 (+ 65536 .cse12))) (and (= .cse11 .cse12) (<= .cse11 32767)))) .cse7))))) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,109 INFO L899 garLoopResultBuilder]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2023-11-29 06:30:26,110 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (let ((.cse10 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse6 (select .cse10 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse6)) (.cse4 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse5 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse3 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse8 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|)) (.cse7 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (or (let ((.cse2 (+ .cse7 1))) (and .cse0 .cse1 (<= .cse2 .cse3) .cse4 .cse5 (<= .cse2 .cse6) (<= 0 (+ .cse7 128)) .cse8 .cse9)) (and .cse0 .cse1 .cse4 .cse5 (= .cse3 (select .cse10 ~var_1_8_Pointer~0.offset)) .cse8 (let ((.cse12 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse11 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse11) (= .cse11 (+ 65536 .cse12))) (and (= .cse11 .cse12) (<= .cse11 32767)))) .cse9 (<= 0 .cse7)))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,110 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-11-29 06:30:26,110 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2023-11-29 06:30:26,110 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2023-11-29 06:30:26,110 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 69) no Hoare annotation was computed. [2023-11-29 06:30:26,111 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (= ~var_1_8_Pointer~0.offset 0) (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base) (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|) (<= 0 (+ (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) 128)) (= |~#var_1_8~0.offset| 0) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|) (<= |ULTIMATE.start_updateVariables_#t~mem35#1| (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) 0)) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,111 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-29 06:30:26,111 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 06:30:26,111 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (let ((.cse10 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse6 (select .cse10 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse6)) (.cse4 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse5 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse3 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse8 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|)) (.cse7 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (or (let ((.cse2 (+ .cse7 1))) (and .cse0 .cse1 (<= .cse2 .cse3) .cse4 .cse5 (<= .cse2 .cse6) (<= 0 (+ .cse7 128)) .cse8 .cse9)) (and .cse0 .cse1 .cse4 .cse5 (= .cse3 (select .cse10 ~var_1_8_Pointer~0.offset)) .cse8 (let ((.cse12 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse11 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse11) (= .cse11 (+ 65536 .cse12))) (and (= .cse11 .cse12) (<= .cse11 32767)))) .cse9 (<= 0 .cse7)))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,112 INFO L899 garLoopResultBuilder]: For program point L99-6(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,113 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (= ~var_1_8_Pointer~0.offset 0) (<= 1073741822 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) 0)) (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base) (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|) (<= 0 (+ (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) 128)) (= |~#var_1_8~0.offset| 0) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,113 INFO L899 garLoopResultBuilder]: For program point L99-8(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,113 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-29 06:30:26,113 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,113 INFO L899 garLoopResultBuilder]: For program point L99-10(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,113 INFO L899 garLoopResultBuilder]: For program point L99-11(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L99-12(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L99-14(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L99-16(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 62) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 50 62) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L99-18(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,114 INFO L899 garLoopResultBuilder]: For program point L99-20(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-21(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-22(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-23(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-25(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-27(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-28(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,115 INFO L899 garLoopResultBuilder]: For program point L99-30(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,116 INFO L899 garLoopResultBuilder]: For program point L99-32(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,116 INFO L899 garLoopResultBuilder]: For program point L99-33(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,116 INFO L899 garLoopResultBuilder]: For program point L99-35(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,116 INFO L899 garLoopResultBuilder]: For program point L99-36(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,116 INFO L899 garLoopResultBuilder]: For program point L99-38(line 99) no Hoare annotation was computed. [2023-11-29 06:30:26,117 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (and (let ((.cse5 (select |#memory_int#8| ~var_1_8_Pointer~0.base))) (let ((.cse11 (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset)) (.cse12 (select .cse5 0))) (let ((.cse0 (= ~var_1_8_Pointer~0.offset 0)) (.cse1 (<= 1073741822 .cse12)) (.cse2 (= |~#var_1_4~0.base| ~var_1_4_Pointer~0.base)) (.cse3 (= |ULTIMATE.start_updateVariables_#t~mem29#1| .cse11)) (.cse4 (= ~var_1_8_Pointer~0.base |~#var_1_8~0.base|)) (.cse6 (= |~#var_1_8~0.offset| 0)) (.cse9 (= ~var_1_4_Pointer~0.offset |~#var_1_4~0.offset|)) (.cse10 (<= 0 (+ |ULTIMATE.start_updateVariables_#t~mem29#1| 128)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset) (select .cse5 ~var_1_8_Pointer~0.offset)) .cse6 (let ((.cse8 (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (.cse7 (mod (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset) 65536))) (or (and (<= 32768 .cse7) (= .cse7 (+ 65536 .cse8))) (and (= .cse7 .cse8) (<= .cse7 32767)))) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse11 1) .cse12) .cse6 .cse9 .cse10))))) (= |~#var_1_6~0.offset| ~var_1_6_Pointer~0.offset) (= |~#var_1_6~0.base| ~var_1_6_Pointer~0.base)) [2023-11-29 06:30:26,117 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-11-29 06:30:26,117 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-11-29 06:30:26,117 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 06:30:26,117 INFO L899 garLoopResultBuilder]: For program point L68-2(line 68) no Hoare annotation was computed. [2023-11-29 06:30:26,121 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:30:26,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:30:26,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated [2023-11-29 06:30:26,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated [2023-11-29 06:30:26,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated [2023-11-29 06:30:26,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-11-29 06:30:26,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:30:26 BoogieIcfgContainer [2023-11-29 06:30:26,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:30:26,145 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:30:26,145 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:30:26,145 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:30:26,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:29:22" (3/4) ... [2023-11-29 06:30:26,147 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:30:26,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 06:30:26,159 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 06:30:26,159 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 06:30:26,160 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:30:26,161 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:30:26,293 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:30:26,294 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:30:26,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:30:26,295 INFO L158 Benchmark]: Toolchain (without parser) took 64655.15ms. Allocated memory was 184.5MB in the beginning and 973.1MB in the end (delta: 788.5MB). Free memory was 156.1MB in the beginning and 603.8MB in the end (delta: -447.7MB). Peak memory consumption was 340.7MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,295 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:30:26,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.21ms. Allocated memory is still 184.5MB. Free memory was 156.1MB in the beginning and 142.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.58ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 140.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,296 INFO L158 Benchmark]: Boogie Preprocessor took 68.97ms. Allocated memory is still 184.5MB. Free memory was 140.2MB in the beginning and 136.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,296 INFO L158 Benchmark]: RCFGBuilder took 598.30ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 127.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,297 INFO L158 Benchmark]: TraceAbstraction took 63517.06ms. Allocated memory was 184.5MB in the beginning and 973.1MB in the end (delta: 788.5MB). Free memory was 127.3MB in the beginning and 612.1MB in the end (delta: -484.8MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,297 INFO L158 Benchmark]: Witness Printer took 149.77ms. Allocated memory is still 973.1MB. Free memory was 612.1MB in the beginning and 603.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 06:30:26,298 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.18ms. Allocated memory is still 127.9MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.21ms. Allocated memory is still 184.5MB. Free memory was 156.1MB in the beginning and 142.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.58ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 140.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.97ms. Allocated memory is still 184.5MB. Free memory was 140.2MB in the beginning and 136.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 598.30ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 127.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 63517.06ms. Allocated memory was 184.5MB in the beginning and 973.1MB in the end (delta: 788.5MB). Free memory was 127.3MB in the beginning and 612.1MB in the end (delta: -484.8MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. * Witness Printer took 149.77ms. Allocated memory is still 973.1MB. Free memory was 612.1MB in the beginning and 603.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated * 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 28, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4686 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4686 mSDsluCounter, 12931 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10015 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4001 IncrementalHoareTripleChecker+Invalid, 4290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 2916 mSDtfsCounter, 4001 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1263 GetRequests, 929 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=14, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2099 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 377 PreInvPairs, 393 NumberOfFragments, 1183 HoareAnnotationTreeSize, 377 FomulaSimplifications, 445842 FormulaSimplificationTreeSizeReduction, 39.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 445311 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2396 NumberOfCodeBlocks, 2396 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2511 ConstructedInterpolants, 0 QuantifiedInterpolants, 9962 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 3721/3808 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: 105]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 06:30:26,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a30511-a4fa-49fc-b352-35c93f3e40a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE