./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme --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 b03e5164bce3a85426688c5c2210a00154d48f59702228593c435153664697b2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:43:02,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:43:02,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:43:02,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:43:02,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:43:02,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:43:02,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:43:02,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:43:02,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:43:02,703 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:43:02,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:43:02,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:43:02,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:43:02,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:43:02,708 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:43:02,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:43:02,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:43:02,710 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:43:02,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:43:02,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:43:02,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:43:02,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:43:02,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:43:02,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:43:02,715 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:43:02,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:43:02,717 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:43:02,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:43:02,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:43:02,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:43:02,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:43:02,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:02,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:43:02,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:43:02,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:43:02,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:43:02,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:43:02,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:43:02,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:43:02,726 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:43:02,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:43:02,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:43:02,728 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_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/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_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme 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 -> b03e5164bce3a85426688c5c2210a00154d48f59702228593c435153664697b2 [2023-11-26 10:43:03,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:43:03,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:43:03,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:43:03,069 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:43:03,071 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:43:03,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i [2023-11-26 10:43:06,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:43:06,489 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:43:06,490 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i [2023-11-26 10:43:06,503 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/data/1788bf4d8/7ec28dd99b4d4ea0bbb6db33240a66ce/FLAGd19596112 [2023-11-26 10:43:06,521 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/data/1788bf4d8/7ec28dd99b4d4ea0bbb6db33240a66ce [2023-11-26 10:43:06,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:43:06,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:43:06,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:06,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:43:06,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:43:06,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912857f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06, skipping insertion in model container [2023-11-26 10:43:06,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:43:06,713 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_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i[916,929] [2023-11-26 10:43:06,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:06,807 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:43:06,817 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_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-90.i[916,929] [2023-11-26 10:43:06,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:06,883 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:43:06,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06 WrapperNode [2023-11-26 10:43:06,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:06,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:06,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:43:06,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:43:06,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,960 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2023-11-26 10:43:06,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:06,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:43:06,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:43:06,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:43:06,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:06,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,036 INFO L175 MemorySlicer]: Split 130 memory accesses to 5 slices as follows [2, 34, 4, 55, 35]. 42 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 1, 6, 3]. The 19 writes are split as follows [0, 6, 1, 6, 6]. [2023-11-26 10:43:07,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:43:07,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:43:07,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:43:07,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:43:07,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (1/1) ... [2023-11-26 10:43:07,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:43:07,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:43:07,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:43:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:43:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:43:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:43:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:43:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:43:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:43:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:43:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:43:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:43:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 10:43:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 10:43:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:43:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:43:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:43:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:43:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:43:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:43:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:43:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:43:07,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:43:07,380 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:43:07,382 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:43:07,997 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:43:08,061 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:43:08,061 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:43:08,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:08 BoogieIcfgContainer [2023-11-26 10:43:08,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:43:08,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:43:08,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:43:08,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:43:08,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:43:06" (1/3) ... [2023-11-26 10:43:08,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5294baec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:08, skipping insertion in model container [2023-11-26 10:43:08,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:06" (2/3) ... [2023-11-26 10:43:08,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5294baec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:08, skipping insertion in model container [2023-11-26 10:43:08,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:08" (3/3) ... [2023-11-26 10:43:08,074 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-90.i [2023-11-26 10:43:08,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:43:08,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:43:08,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:43:08,182 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;@67f6f21c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:43:08,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:43:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-26 10:43:08,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:08,211 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:08,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:08,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1750151490, now seen corresponding path program 1 times [2023-11-26 10:43:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444355225] [2023-11-26 10:43:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444355225] [2023-11-26 10:43:08,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444355225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:08,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:08,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785785200] [2023-11-26 10:43:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:43:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:43:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:43:08,915 INFO L87 Difference]: Start difference. First operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 10:43:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:09,021 INFO L93 Difference]: Finished difference Result 205 states and 326 transitions. [2023-11-26 10:43:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:43:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2023-11-26 10:43:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:09,035 INFO L225 Difference]: With dead ends: 205 [2023-11-26 10:43:09,036 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 10:43:09,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-26 10:43:09,046 INFO L413 NwaCegarLoop]: 145 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, 145 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-26 10:43:09,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 10:43:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-26 10:43:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-11-26 10:43:09,126 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 148 [2023-11-26 10:43:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:09,127 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-11-26 10:43:09,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 10:43:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-11-26 10:43:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-26 10:43:09,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:09,135 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:09,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:43:09,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:09,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash -305656682, now seen corresponding path program 1 times [2023-11-26 10:43:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727135902] [2023-11-26 10:43:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727135902] [2023-11-26 10:43:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727135902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:09,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066641193] [2023-11-26 10:43:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:09,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:09,791 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:09,881 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2023-11-26 10:43:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:43:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-11-26 10:43:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:09,886 INFO L225 Difference]: With dead ends: 231 [2023-11-26 10:43:09,887 INFO L226 Difference]: Without dead ends: 130 [2023-11-26 10:43:09,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-26 10:43:09,890 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 61 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 466 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-26 10:43:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2023-11-26 10:43:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-11-26 10:43:09,913 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2023-11-26 10:43:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:09,916 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-11-26 10:43:09,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-11-26 10:43:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-26 10:43:09,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:09,922 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:43:09,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:09,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1329203845, now seen corresponding path program 1 times [2023-11-26 10:43:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481372934] [2023-11-26 10:43:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481372934] [2023-11-26 10:43:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481372934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230779478] [2023-11-26 10:43:10,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:10,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:10,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:10,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:10,778 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:11,134 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-11-26 10:43:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:11,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-26 10:43:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:11,150 INFO L225 Difference]: With dead ends: 312 [2023-11-26 10:43:11,150 INFO L226 Difference]: Without dead ends: 209 [2023-11-26 10:43:11,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:43:11,159 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 139 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:11,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 891 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:43:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-26 10:43:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 109. [2023-11-26 10:43:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-26 10:43:11,218 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 150 [2023-11-26 10:43:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:11,222 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-26 10:43:11,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-26 10:43:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-26 10:43:11,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:11,233 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:43:11,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:11,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -906502019, now seen corresponding path program 1 times [2023-11-26 10:43:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546311541] [2023-11-26 10:43:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546311541] [2023-11-26 10:43:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546311541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:12,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:12,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:43:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816937659] [2023-11-26 10:43:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:12,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:12,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:12,188 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:12,736 INFO L93 Difference]: Finished difference Result 311 states and 449 transitions. [2023-11-26 10:43:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-26 10:43:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:12,741 INFO L225 Difference]: With dead ends: 311 [2023-11-26 10:43:12,741 INFO L226 Difference]: Without dead ends: 203 [2023-11-26 10:43:12,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:43:12,744 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 396 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:12,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 404 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:43:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-26 10:43:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2023-11-26 10:43:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-11-26 10:43:12,766 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 150 [2023-11-26 10:43:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:12,767 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-11-26 10:43:12,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-11-26 10:43:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-26 10:43:12,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:12,771 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:12,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:43:12,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:12,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash -576930377, now seen corresponding path program 1 times [2023-11-26 10:43:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:12,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179446918] [2023-11-26 10:43:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179446918] [2023-11-26 10:43:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179446918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:43:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242698976] [2023-11-26 10:43:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:43:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:43:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:43:14,770 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 10:43:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:15,428 INFO L93 Difference]: Finished difference Result 245 states and 349 transitions. [2023-11-26 10:43:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:43:15,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2023-11-26 10:43:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:15,431 INFO L225 Difference]: With dead ends: 245 [2023-11-26 10:43:15,431 INFO L226 Difference]: Without dead ends: 135 [2023-11-26 10:43:15,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:43:15,433 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 203 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:15,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 733 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:43:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-26 10:43:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2023-11-26 10:43:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 10:43:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2023-11-26 10:43:15,476 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 151 [2023-11-26 10:43:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:15,478 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2023-11-26 10:43:15,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 10:43:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2023-11-26 10:43:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-26 10:43:15,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:15,482 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:15,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:43:15,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:15,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1156097376, now seen corresponding path program 1 times [2023-11-26 10:43:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302823902] [2023-11-26 10:43:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-26 10:43:16,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302823902] [2023-11-26 10:43:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302823902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:43:16,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197663443] [2023-11-26 10:43:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:16,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:43:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:43:16,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:43:16,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:43:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-26 10:43:16,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:43:16,982 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 9 treesize of output 5 [2023-11-26 10:43:17,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2023-11-26 10:43:17,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:43:17,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 69 [2023-11-26 10:43:17,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:43:17,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2023-11-26 10:43:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-26 10:43:18,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:43:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197663443] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 10:43:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:43:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 14] total 24 [2023-11-26 10:43:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084088678] [2023-11-26 10:43:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:43:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:43:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2023-11-26 10:43:18,507 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:19,733 INFO L93 Difference]: Finished difference Result 396 states and 557 transitions. [2023-11-26 10:43:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 10:43:19,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-11-26 10:43:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:19,737 INFO L225 Difference]: With dead ends: 396 [2023-11-26 10:43:19,737 INFO L226 Difference]: Without dead ends: 279 [2023-11-26 10:43:19,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2023-11-26 10:43:19,739 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 300 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:19,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1372 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:43:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-26 10:43:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2023-11-26 10:43:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 152 states have internal predecessors, (198), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 10:43:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 262 transitions. [2023-11-26 10:43:19,802 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 262 transitions. Word has length 152 [2023-11-26 10:43:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:19,803 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 262 transitions. [2023-11-26 10:43:19,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 262 transitions. [2023-11-26 10:43:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-26 10:43:19,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:19,807 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:19,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:43:20,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:43:20,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:20,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1742903390, now seen corresponding path program 1 times [2023-11-26 10:43:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230494167] [2023-11-26 10:43:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:20,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:21,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230494167] [2023-11-26 10:43:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230494167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:21,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:21,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864755612] [2023-11-26 10:43:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:21,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:21,549 INFO L87 Difference]: Start difference. First operand 187 states and 262 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:21,912 INFO L93 Difference]: Finished difference Result 432 states and 601 transitions. [2023-11-26 10:43:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-11-26 10:43:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:21,918 INFO L225 Difference]: With dead ends: 432 [2023-11-26 10:43:21,918 INFO L226 Difference]: Without dead ends: 246 [2023-11-26 10:43:21,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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-26 10:43:21,920 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 125 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:21,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 613 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:43:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-26 10:43:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2023-11-26 10:43:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 164 states have (on average 1.274390243902439) internal successors, (209), 166 states have internal predecessors, (209), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 10:43:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 293 transitions. [2023-11-26 10:43:21,984 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 293 transitions. Word has length 152 [2023-11-26 10:43:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:21,985 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 293 transitions. [2023-11-26 10:43:21,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 293 transitions. [2023-11-26 10:43:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-26 10:43:21,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:21,988 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:21,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:43:21,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:21,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1550522018, now seen corresponding path program 1 times [2023-11-26 10:43:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222147561] [2023-11-26 10:43:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222147561] [2023-11-26 10:43:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222147561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:43:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388471553] [2023-11-26 10:43:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:23,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:43:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:43:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:43:23,243 INFO L87 Difference]: Start difference. First operand 212 states and 293 transitions. Second operand has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-26 10:43:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:23,771 INFO L93 Difference]: Finished difference Result 488 states and 676 transitions. [2023-11-26 10:43:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:43:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2023-11-26 10:43:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:23,777 INFO L225 Difference]: With dead ends: 488 [2023-11-26 10:43:23,778 INFO L226 Difference]: Without dead ends: 301 [2023-11-26 10:43:23,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:43:23,781 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 155 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:23,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 965 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:43:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-26 10:43:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 245. [2023-11-26 10:43:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 197 states have (on average 1.2944162436548223) internal successors, (255), 199 states have internal predecessors, (255), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 10:43:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 339 transitions. [2023-11-26 10:43:23,874 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 339 transitions. Word has length 152 [2023-11-26 10:43:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:23,875 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 339 transitions. [2023-11-26 10:43:23,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-26 10:43:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2023-11-26 10:43:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-26 10:43:23,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:23,879 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:23,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:43:23,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:23,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash 963716004, now seen corresponding path program 1 times [2023-11-26 10:43:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725084293] [2023-11-26 10:43:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-26 10:43:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725084293] [2023-11-26 10:43:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725084293] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:43:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109239877] [2023-11-26 10:43:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:43:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:43:24,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:43:24,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:43:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:25,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-26 10:43:25,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:43:25,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 81 treesize of output 47 [2023-11-26 10:43:25,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:43:25,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 32 [2023-11-26 10:43:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-26 10:43:25,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:43:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109239877] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 10:43:25,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:43:25,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 10] total 17 [2023-11-26 10:43:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013234022] [2023-11-26 10:43:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:43:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:43:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:43:25,875 INFO L87 Difference]: Start difference. First operand 245 states and 339 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:26,870 INFO L93 Difference]: Finished difference Result 576 states and 798 transitions. [2023-11-26 10:43:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:43:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-11-26 10:43:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:26,875 INFO L225 Difference]: With dead ends: 576 [2023-11-26 10:43:26,875 INFO L226 Difference]: Without dead ends: 332 [2023-11-26 10:43:26,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-11-26 10:43:26,878 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 225 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:26,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1276 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:43:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-26 10:43:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 243. [2023-11-26 10:43:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 195 states have (on average 1.2923076923076924) internal successors, (252), 197 states have internal predecessors, (252), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 10:43:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 336 transitions. [2023-11-26 10:43:26,941 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 336 transitions. Word has length 152 [2023-11-26 10:43:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:26,942 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 336 transitions. [2023-11-26 10:43:26,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 336 transitions. [2023-11-26 10:43:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 10:43:26,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:26,945 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:26,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:43:27,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25383ead-2b4f-40d2-b4b7-ebab35cc0b70/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:43:27,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:27,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1738577047, now seen corresponding path program 1 times [2023-11-26 10:43:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898785346] [2023-11-26 10:43:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898785346] [2023-11-26 10:43:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898785346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:43:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140348147] [2023-11-26 10:43:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:27,628 INFO L87 Difference]: Start difference. First operand 243 states and 336 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:27,978 INFO L93 Difference]: Finished difference Result 753 states and 1054 transitions. [2023-11-26 10:43:27,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:43:27,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-26 10:43:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:27,984 INFO L225 Difference]: With dead ends: 753 [2023-11-26 10:43:27,984 INFO L226 Difference]: Without dead ends: 511 [2023-11-26 10:43:27,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:43:27,986 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:27,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 611 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:43:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-26 10:43:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 288. [2023-11-26 10:43:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 240 states have (on average 1.3) internal successors, (312), 242 states have internal predecessors, (312), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 10:43:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2023-11-26 10:43:28,058 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 153 [2023-11-26 10:43:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:28,059 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2023-11-26 10:43:28,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2023-11-26 10:43:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 10:43:28,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:28,065 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:28,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:43:28,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:28,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1545272999, now seen corresponding path program 1 times [2023-11-26 10:43:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465860092] [2023-11-26 10:43:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465860092] [2023-11-26 10:43:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465860092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:28,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:28,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764089550] [2023-11-26 10:43:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:28,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:28,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:28,925 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:29,296 INFO L93 Difference]: Finished difference Result 867 states and 1200 transitions. [2023-11-26 10:43:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:43:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-26 10:43:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:29,303 INFO L225 Difference]: With dead ends: 867 [2023-11-26 10:43:29,303 INFO L226 Difference]: Without dead ends: 580 [2023-11-26 10:43:29,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-26 10:43:29,305 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 148 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 498 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:43:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-11-26 10:43:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 323. [2023-11-26 10:43:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 275 states have (on average 1.298181818181818) internal successors, (357), 277 states have internal predecessors, (357), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 10:43:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 441 transitions. [2023-11-26 10:43:29,451 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 441 transitions. Word has length 153 [2023-11-26 10:43:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:29,452 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 441 transitions. [2023-11-26 10:43:29,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2023-11-26 10:43:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 10:43:29,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:29,456 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:29,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:43:29,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:29,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1036977173, now seen corresponding path program 1 times [2023-11-26 10:43:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399863322] [2023-11-26 10:43:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399863322] [2023-11-26 10:43:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399863322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:30,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013015202] [2023-11-26 10:43:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:30,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:30,093 INFO L87 Difference]: Start difference. First operand 323 states and 441 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:30,510 INFO L93 Difference]: Finished difference Result 761 states and 1039 transitions. [2023-11-26 10:43:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:30,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-26 10:43:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:30,515 INFO L225 Difference]: With dead ends: 761 [2023-11-26 10:43:30,516 INFO L226 Difference]: Without dead ends: 439 [2023-11-26 10:43:30,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-26 10:43:30,519 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 135 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:30,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 663 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:43:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-26 10:43:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 270. [2023-11-26 10:43:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 233 states have internal predecessors, (298), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 10:43:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 362 transitions. [2023-11-26 10:43:30,598 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 362 transitions. Word has length 153 [2023-11-26 10:43:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:30,599 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 362 transitions. [2023-11-26 10:43:30,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 362 transitions. [2023-11-26 10:43:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-26 10:43:30,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:30,604 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:30,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:43:30,604 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:30,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2048094423, now seen corresponding path program 1 times [2023-11-26 10:43:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885487921] [2023-11-26 10:43:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885487921] [2023-11-26 10:43:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885487921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:43:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565437853] [2023-11-26 10:43:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:30,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:30,956 INFO L87 Difference]: Start difference. First operand 270 states and 362 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:31,308 INFO L93 Difference]: Finished difference Result 660 states and 890 transitions. [2023-11-26 10:43:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:43:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-26 10:43:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:31,313 INFO L225 Difference]: With dead ends: 660 [2023-11-26 10:43:31,313 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:31,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:43:31,315 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 125 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:31,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 818 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:43:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 307. [2023-11-26 10:43:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.2862453531598512) internal successors, (346), 270 states have internal predecessors, (346), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 10:43:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 410 transitions. [2023-11-26 10:43:31,374 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 410 transitions. Word has length 153 [2023-11-26 10:43:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:31,375 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 410 transitions. [2023-11-26 10:43:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 10:43:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 410 transitions. [2023-11-26 10:43:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-26 10:43:31,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:31,379 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:43:31,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:43:31,379 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:31,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -980410223, now seen corresponding path program 1 times [2023-11-26 10:43:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:31,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725965257] [2023-11-26 10:43:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:43:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:43:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:43:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:43:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:43:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:43:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:43:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:43:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:43:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:43:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:43:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:43:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:43:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:43:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:43:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:43:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:43:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 10:43:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 10:43:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725965257] [2023-11-26 10:43:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725965257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-26 10:43:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184156087] [2023-11-26 10:43:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:37,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 10:43:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 10:43:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:43:37,254 INFO L87 Difference]: Start difference. First operand 307 states and 410 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)