./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/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 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:59:56,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:59:56,335 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:59:56,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:59:56,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:59:56,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:59:56,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:59:56,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:59:56,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:59:56,389 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:59:56,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:59:56,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:59:56,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:59:56,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:59:56,394 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:59:56,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:59:56,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:59:56,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:59:56,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:59:56,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:59:56,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:59:56,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:59:56,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:59:56,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:59:56,399 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:59:56,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:59:56,400 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:59:56,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:59:56,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:59:56,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:59:56,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:59:56,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:59:56,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:59:56,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:59:56,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:59:56,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:59:56,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:59:56,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:59:56,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:59:56,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:59:56,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:59:56,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:59:56,406 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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/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 -> 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc [2023-11-26 11:59:56,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:59:56,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:59:56,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:59:56,744 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:59:56,747 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:59:56,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2023-11-26 11:59:59,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:00:00,119 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:00:00,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2023-11-26 12:00:00,141 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/data/07bab05fa/efcd51b15eb64f519a5a2807042a3b17/FLAGc53ff42e8 [2023-11-26 12:00:00,158 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/data/07bab05fa/efcd51b15eb64f519a5a2807042a3b17 [2023-11-26 12:00:00,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:00:00,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:00:00,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:00,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:00:00,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:00:00,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efce34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00, skipping insertion in model container [2023-11-26 12:00:00,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,208 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:00:00,452 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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2023-11-26 12:00:00,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:00,545 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:00:00,558 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_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2023-11-26 12:00:00,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:00,624 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:00:00,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00 WrapperNode [2023-11-26 12:00:00,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:00,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:00,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:00:00,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:00:00,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,742 INFO L138 Inliner]: procedures = 26, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2023-11-26 12:00:00,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:00,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:00:00,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:00:00,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:00:00,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,787 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2023-11-26 12:00:00,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:00:00,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:00:00,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:00:00,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:00:00,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (1/1) ... [2023-11-26 12:00:00,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:00,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:00:00,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:00:00,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b1fa3-62ee-4f44-9917-a933a4cd5ab5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:00:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:00:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:00:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:00:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:00:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:00:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:00:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:00:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:00:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:00:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:00:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:00:01,119 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:00:01,122 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:00:01,851 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:00:01,901 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:00:01,902 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:00:01,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:01 BoogieIcfgContainer [2023-11-26 12:00:01,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:00:01,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:00:01,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:00:01,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:00:01,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:00" (1/3) ... [2023-11-26 12:00:01,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc90407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:01, skipping insertion in model container [2023-11-26 12:00:01,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:00" (2/3) ... [2023-11-26 12:00:01,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc90407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:01, skipping insertion in model container [2023-11-26 12:00:01,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:01" (3/3) ... [2023-11-26 12:00:01,919 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-71.i [2023-11-26 12:00:01,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:00:01,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:00:02,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:00:02,033 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;@7d8ee01a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:00:02,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:00:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 12:00:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 12:00:02,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:02,064 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:02,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:02,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1183335138, now seen corresponding path program 1 times [2023-11-26 12:00:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174160232] [2023-11-26 12:00:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174160232] [2023-11-26 12:00:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174160232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457526825] [2023-11-26 12:00:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:02,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:00:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:00:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:00:02,791 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:02,879 INFO L93 Difference]: Finished difference Result 193 states and 309 transitions. [2023-11-26 12:00:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:00:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2023-11-26 12:00:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:02,894 INFO L225 Difference]: With dead ends: 193 [2023-11-26 12:00:02,895 INFO L226 Difference]: Without dead ends: 96 [2023-11-26 12:00:02,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 12:00:02,904 INFO L413 NwaCegarLoop]: 135 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, 135 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 12:00:02,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:00:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-26 12:00:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-26 12:00:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 12:00:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2023-11-26 12:00:03,010 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 139 [2023-11-26 12:00:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:03,010 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2023-11-26 12:00:03,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2023-11-26 12:00:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 12:00:03,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:03,021 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:03,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:00:03,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:03,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 632234308, now seen corresponding path program 1 times [2023-11-26 12:00:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:03,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354302290] [2023-11-26 12:00:03,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354302290] [2023-11-26 12:00:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354302290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:03,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:00:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537652666] [2023-11-26 12:00:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:03,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:00:03,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:00:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:03,540 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:03,648 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-11-26 12:00:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:00:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-26 12:00:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:03,656 INFO L225 Difference]: With dead ends: 199 [2023-11-26 12:00:03,656 INFO L226 Difference]: Without dead ends: 104 [2023-11-26 12:00:03,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 12:00:03,660 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:03,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:00:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-26 12:00:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-26 12:00:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 12:00:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2023-11-26 12:00:03,699 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 139 [2023-11-26 12:00:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:03,702 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2023-11-26 12:00:03,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2023-11-26 12:00:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 12:00:03,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:03,713 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:03,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:00:03,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:03,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash 689492610, now seen corresponding path program 1 times [2023-11-26 12:00:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410548398] [2023-11-26 12:00:03,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:03,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:04,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410548398] [2023-11-26 12:00:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410548398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:00:04,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867880874] [2023-11-26 12:00:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:04,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:00:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:00:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:04,197 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:04,290 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-11-26 12:00:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:00:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-26 12:00:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:04,298 INFO L225 Difference]: With dead ends: 199 [2023-11-26 12:00:04,299 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 12:00:04,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 12:00:04,305 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:04,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 394 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:00:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 12:00:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-11-26 12:00:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 12:00:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-11-26 12:00:04,333 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 139 [2023-11-26 12:00:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:04,335 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-11-26 12:00:04,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-11-26 12:00:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 12:00:04,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:04,348 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:00:04,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:04,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 689552192, now seen corresponding path program 1 times [2023-11-26 12:00:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102881203] [2023-11-26 12:00:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:05,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:05,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102881203] [2023-11-26 12:00:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102881203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:05,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:00:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328942749] [2023-11-26 12:00:05,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:05,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:00:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:05,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:00:05,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:00:05,745 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:06,525 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2023-11-26 12:00:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:00:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2023-11-26 12:00:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:06,529 INFO L225 Difference]: With dead ends: 271 [2023-11-26 12:00:06,530 INFO L226 Difference]: Without dead ends: 172 [2023-11-26 12:00:06,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:00:06,535 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 107 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:06,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 470 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 12:00:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-26 12:00:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2023-11-26 12:00:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 138 states have internal predecessors, (182), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-26 12:00:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2023-11-26 12:00:06,569 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 139 [2023-11-26 12:00:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:06,570 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2023-11-26 12:00:06,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2023-11-26 12:00:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-26 12:00:06,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:06,574 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:06,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:00:06,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:06,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1419147393, now seen corresponding path program 1 times [2023-11-26 12:00:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11293021] [2023-11-26 12:00:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11293021] [2023-11-26 12:00:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11293021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:00:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27968841] [2023-11-26 12:00:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:08,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:00:08,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:00:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:00:08,496 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:09,442 INFO L93 Difference]: Finished difference Result 475 states and 670 transitions. [2023-11-26 12:00:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:00:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 140 [2023-11-26 12:00:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:09,448 INFO L225 Difference]: With dead ends: 475 [2023-11-26 12:00:09,449 INFO L226 Difference]: Without dead ends: 307 [2023-11-26 12:00:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:00:09,451 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 218 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:09,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 583 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 12:00:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-26 12:00:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 178. [2023-11-26 12:00:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 147 states have internal predecessors, (196), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-26 12:00:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2023-11-26 12:00:09,487 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 140 [2023-11-26 12:00:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:09,488 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2023-11-26 12:00:09,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2023-11-26 12:00:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-26 12:00:09,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:09,492 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:09,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:00:09,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:09,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2017300935, now seen corresponding path program 1 times [2023-11-26 12:00:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997373707] [2023-11-26 12:00:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997373707] [2023-11-26 12:00:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997373707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:11,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:00:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941827266] [2023-11-26 12:00:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:11,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:00:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:11,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:00:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:00:11,340 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:12,236 INFO L93 Difference]: Finished difference Result 431 states and 608 transitions. [2023-11-26 12:00:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:00:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2023-11-26 12:00:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:12,239 INFO L225 Difference]: With dead ends: 431 [2023-11-26 12:00:12,239 INFO L226 Difference]: Without dead ends: 254 [2023-11-26 12:00:12,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:00:12,241 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 134 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:12,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 932 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 12:00:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-26 12:00:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 231. [2023-11-26 12:00:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 192 states have (on average 1.328125) internal successors, (255), 194 states have internal predecessors, (255), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-26 12:00:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 325 transitions. [2023-11-26 12:00:12,269 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 325 transitions. Word has length 141 [2023-11-26 12:00:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:12,270 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 325 transitions. [2023-11-26 12:00:12,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 325 transitions. [2023-11-26 12:00:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-26 12:00:12,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:12,273 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:12,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:00:12,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:12,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2005029732, now seen corresponding path program 1 times [2023-11-26 12:00:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926172037] [2023-11-26 12:00:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926172037] [2023-11-26 12:00:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926172037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:00:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950078820] [2023-11-26 12:00:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:13,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:00:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:00:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:00:13,734 INFO L87 Difference]: Start difference. First operand 231 states and 325 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:14,201 INFO L93 Difference]: Finished difference Result 578 states and 810 transitions. [2023-11-26 12:00:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:00:14,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2023-11-26 12:00:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:14,206 INFO L225 Difference]: With dead ends: 578 [2023-11-26 12:00:14,206 INFO L226 Difference]: Without dead ends: 348 [2023-11-26 12:00:14,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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 12:00:14,208 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:14,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 442 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:00:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-26 12:00:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 241. [2023-11-26 12:00:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 202 states have (on average 1.3267326732673268) internal successors, (268), 204 states have internal predecessors, (268), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-26 12:00:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2023-11-26 12:00:14,241 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 141 [2023-11-26 12:00:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:14,241 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2023-11-26 12:00:14,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 12:00:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2023-11-26 12:00:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:14,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:14,245 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:14,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:00:14,245 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:14,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1216347448, now seen corresponding path program 1 times [2023-11-26 12:00:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837766275] [2023-11-26 12:00:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837766275] [2023-11-26 12:00:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837766275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 12:00:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588216958] [2023-11-26 12:00:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:15,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 12:00:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 12:00:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:00:15,958 INFO L87 Difference]: Start difference. First operand 241 states and 338 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-26 12:00:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:17,355 INFO L93 Difference]: Finished difference Result 673 states and 931 transitions. [2023-11-26 12:00:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 12:00:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2023-11-26 12:00:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:17,362 INFO L225 Difference]: With dead ends: 673 [2023-11-26 12:00:17,362 INFO L226 Difference]: Without dead ends: 433 [2023-11-26 12:00:17,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-26 12:00:17,365 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 265 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:17,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 657 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-26 12:00:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-11-26 12:00:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 339. [2023-11-26 12:00:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 282 states have (on average 1.3085106382978724) internal successors, (369), 286 states have internal predecessors, (369), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-26 12:00:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 471 transitions. [2023-11-26 12:00:17,414 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 471 transitions. Word has length 142 [2023-11-26 12:00:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:17,418 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 471 transitions. [2023-11-26 12:00:17,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-26 12:00:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 471 transitions. [2023-11-26 12:00:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:17,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:17,421 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:17,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:00:17,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:17,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1636853817, now seen corresponding path program 1 times [2023-11-26 12:00:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849878961] [2023-11-26 12:00:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849878961] [2023-11-26 12:00:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849878961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 12:00:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116859884] [2023-11-26 12:00:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:19,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 12:00:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 12:00:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:00:19,803 INFO L87 Difference]: Start difference. First operand 339 states and 471 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-26 12:00:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:20,964 INFO L93 Difference]: Finished difference Result 827 states and 1140 transitions. [2023-11-26 12:00:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 12:00:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2023-11-26 12:00:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:20,978 INFO L225 Difference]: With dead ends: 827 [2023-11-26 12:00:20,978 INFO L226 Difference]: Without dead ends: 489 [2023-11-26 12:00:20,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-26 12:00:20,983 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 141 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:20,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 940 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 12:00:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-26 12:00:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 445. [2023-11-26 12:00:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 378 states have (on average 1.3042328042328042) internal successors, (493), 384 states have internal predecessors, (493), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-26 12:00:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 611 transitions. [2023-11-26 12:00:21,062 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 611 transitions. Word has length 142 [2023-11-26 12:00:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:21,063 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 611 transitions. [2023-11-26 12:00:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-26 12:00:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 611 transitions. [2023-11-26 12:00:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:21,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:21,068 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:21,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:00:21,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:21,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1646996229, now seen corresponding path program 1 times [2023-11-26 12:00:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385649931] [2023-11-26 12:00:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385649931] [2023-11-26 12:00:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385649931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:23,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 12:00:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368301416] [2023-11-26 12:00:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:23,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 12:00:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:00:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:00:23,658 INFO L87 Difference]: Start difference. First operand 445 states and 611 transitions. Second operand has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 12:00:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:24,928 INFO L93 Difference]: Finished difference Result 1020 states and 1388 transitions. [2023-11-26 12:00:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 12:00:24,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 142 [2023-11-26 12:00:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:24,934 INFO L225 Difference]: With dead ends: 1020 [2023-11-26 12:00:24,935 INFO L226 Difference]: Without dead ends: 576 [2023-11-26 12:00:24,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-26 12:00:24,937 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:24,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 758 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 12:00:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2023-11-26 12:00:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 453. [2023-11-26 12:00:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 381 states have (on average 1.2913385826771653) internal successors, (492), 388 states have internal predecessors, (492), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2023-11-26 12:00:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 614 transitions. [2023-11-26 12:00:25,008 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 614 transitions. Word has length 142 [2023-11-26 12:00:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:25,009 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 614 transitions. [2023-11-26 12:00:25,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 12:00:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 614 transitions. [2023-11-26 12:00:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:25,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:25,012 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:00:25,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:25,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1770867323, now seen corresponding path program 1 times [2023-11-26 12:00:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553725654] [2023-11-26 12:00:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:28,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553725654] [2023-11-26 12:00:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553725654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:28,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 12:00:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280610532] [2023-11-26 12:00:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 12:00:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 12:00:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:00:28,407 INFO L87 Difference]: Start difference. First operand 453 states and 614 transitions. Second operand has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 12:00:36,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-26 12:00:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:36,596 INFO L93 Difference]: Finished difference Result 992 states and 1334 transitions. [2023-11-26 12:00:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 12:00:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 142 [2023-11-26 12:00:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:36,601 INFO L225 Difference]: With dead ends: 992 [2023-11-26 12:00:36,602 INFO L226 Difference]: Without dead ends: 548 [2023-11-26 12:00:36,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-11-26 12:00:36,604 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 183 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:36,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 797 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-26 12:00:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-11-26 12:00:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2023-11-26 12:00:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 400 states have internal predecessors, (508), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-26 12:00:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2023-11-26 12:00:36,665 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 142 [2023-11-26 12:00:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:36,666 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2023-11-26 12:00:36,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 12:00:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2023-11-26 12:00:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:36,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:36,669 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:00:36,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:36,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1512982723, now seen corresponding path program 1 times [2023-11-26 12:00:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866779758] [2023-11-26 12:00:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:37,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866779758] [2023-11-26 12:00:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866779758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:37,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:37,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:00:37,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983960876] [2023-11-26 12:00:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:37,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:00:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:37,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:00:37,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:00:37,176 INFO L87 Difference]: Start difference. First operand 465 states and 626 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:37,696 INFO L93 Difference]: Finished difference Result 1059 states and 1422 transitions. [2023-11-26 12:00:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:00:37,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2023-11-26 12:00:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:37,701 INFO L225 Difference]: With dead ends: 1059 [2023-11-26 12:00:37,702 INFO L226 Difference]: Without dead ends: 595 [2023-11-26 12:00:37,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:00:37,704 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 191 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:37,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 950 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:00:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-11-26 12:00:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 543. [2023-11-26 12:00:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 442 states have (on average 1.257918552036199) internal successors, (556), 449 states have internal predecessors, (556), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-26 12:00:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 724 transitions. [2023-11-26 12:00:37,837 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 724 transitions. Word has length 142 [2023-11-26 12:00:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:37,838 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 724 transitions. [2023-11-26 12:00:37,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 12:00:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 724 transitions. [2023-11-26 12:00:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 12:00:37,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:37,842 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:37,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:00:37,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:37,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -953218873, now seen corresponding path program 1 times [2023-11-26 12:00:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977397149] [2023-11-26 12:00:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:00:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:00:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 12:00:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 12:00:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 12:00:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:00:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:00:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 12:00:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 12:00:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:00:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:00:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 12:00:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 12:00:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 12:00:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 12:00:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 12:00:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 12:00:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977397149] [2023-11-26 12:00:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977397149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 12:00:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709028676] [2023-11-26 12:00:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 12:00:40,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:00:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:00:40,450 INFO L87 Difference]: Start difference. First operand 543 states and 724 transitions. Second operand has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19)