./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU --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 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:14:41,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:14:41,201 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:14:41,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:14:41,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:14:41,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:14:41,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:14:41,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:14:41,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:14:41,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:14:41,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:14:41,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:14:41,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:14:41,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:14:41,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:14:41,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:14:41,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:14:41,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:14:41,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:14:41,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:14:41,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:14:41,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:14:41,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:14:41,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:14:41,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:14:41,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:14:41,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:14:41,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:14:41,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:14:41,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:14:41,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:14:41,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:14:41,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:14:41,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:14:41,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:14:41,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:14:41,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:14:41,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:14:41,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:14:41,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:14:41,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:14:41,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:14:41,269 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_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/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_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2024-10-31 22:14:41,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:14:41,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:14:41,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:14:41,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:14:41,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:14:41,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i Unable to find full path for "g++" [2024-10-31 22:14:43,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:14:43,883 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:14:43,883 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-10-31 22:14:43,901 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/data/dc6c2fe35/c381c4f8e2ae46f7a870c789b21231f2/FLAGa1dd31440 [2024-10-31 22:14:44,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/data/dc6c2fe35/c381c4f8e2ae46f7a870c789b21231f2 [2024-10-31 22:14:44,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:14:44,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:14:44,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:44,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:14:44,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:14:44,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562f9331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44, skipping insertion in model container [2024-10-31 22:14:44,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:14:44,446 WARN L251 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_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-10-31 22:14:44,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:44,522 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:14:44,535 WARN L251 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_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-10-31 22:14:44,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:44,603 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:14:44,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44 WrapperNode [2024-10-31 22:14:44,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:44,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:44,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:14:44,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:14:44,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,675 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2024-10-31 22:14:44,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:44,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:14:44,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:14:44,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:14:44,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,738 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-10-31 22:14:44,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:14:44,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:14:44,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:14:44,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:14:44,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (1/1) ... [2024-10-31 22:14:44,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:14:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:44,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:14:44,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78790ceb-fea8-4a1b-ab3a-e1b0073a4669/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:14:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:14:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:14:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:14:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:14:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:14:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:14:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:14:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:14:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:14:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:14:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:14:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:14:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:14:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:14:44,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:14:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:14:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:14:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:14:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:14:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:14:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:14:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:14:44,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:14:45,087 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:14:45,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:14:45,677 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-31 22:14:45,678 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:14:45,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:14:45,693 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:14:45,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:45 BoogieIcfgContainer [2024-10-31 22:14:45,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:14:45,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:14:45,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:14:45,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:14:45,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:14:44" (1/3) ... [2024-10-31 22:14:45,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e5d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:14:45, skipping insertion in model container [2024-10-31 22:14:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:44" (2/3) ... [2024-10-31 22:14:45,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e5d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:14:45, skipping insertion in model container [2024-10-31 22:14:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:45" (3/3) ... [2024-10-31 22:14:45,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2024-10-31 22:14:45,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:14:45,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:14:45,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:14:45,806 INFO L333 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, 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;@2e4e9649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:14:45,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:14:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:14:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:14:45,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:45,826 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:45,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 31279224, now seen corresponding path program 1 times [2024-10-31 22:14:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:45,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104577942] [2024-10-31 22:14:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104577942] [2024-10-31 22:14:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104577942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35089406] [2024-10-31 22:14:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:46,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:14:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:14:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:14:46,401 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:14:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:46,444 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-10-31 22:14:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:14:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-31 22:14:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:46,456 INFO L225 Difference]: With dead ends: 219 [2024-10-31 22:14:46,457 INFO L226 Difference]: Without dead ends: 109 [2024-10-31 22:14:46,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:14:46,468 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:46,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-31 22:14:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-31 22:14:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:14:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-10-31 22:14:46,524 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-10-31 22:14:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:46,524 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-10-31 22:14:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:14:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-10-31 22:14:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:14:46,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:46,532 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:14:46,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1829017178, now seen corresponding path program 1 times [2024-10-31 22:14:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559604157] [2024-10-31 22:14:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559604157] [2024-10-31 22:14:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559604157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:14:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541765289] [2024-10-31 22:14:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:14:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:14:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:14:46,912 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:14:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:46,982 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-10-31 22:14:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:14:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-31 22:14:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:46,985 INFO L225 Difference]: With dead ends: 217 [2024-10-31 22:14:46,985 INFO L226 Difference]: Without dead ends: 111 [2024-10-31 22:14:46,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:14:46,988 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:46,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-31 22:14:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-31 22:14:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:14:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-10-31 22:14:47,019 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-10-31 22:14:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:47,020 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-10-31 22:14:47,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:14:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-10-31 22:14:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:14:47,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:47,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:14:47,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1512009960, now seen corresponding path program 1 times [2024-10-31 22:14:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775170951] [2024-10-31 22:14:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:47,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775170951] [2024-10-31 22:14:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775170951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:47,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:47,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:14:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336471420] [2024-10-31 22:14:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:47,319 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:47,357 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-10-31 22:14:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:47,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-31 22:14:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:47,359 INFO L225 Difference]: With dead ends: 220 [2024-10-31 22:14:47,360 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:14:47,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:47,362 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:47,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:14:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:14:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:14:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-10-31 22:14:47,379 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 115 [2024-10-31 22:14:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-10-31 22:14:47,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-10-31 22:14:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:14:47,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:47,385 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:14:47,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -176933782, now seen corresponding path program 1 times [2024-10-31 22:14:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718710530] [2024-10-31 22:14:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:47,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:47,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718710530] [2024-10-31 22:14:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718710530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:47,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:47,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:14:47,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040060807] [2024-10-31 22:14:47,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:47,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:47,631 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:47,667 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-10-31 22:14:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-31 22:14:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:47,670 INFO L225 Difference]: With dead ends: 222 [2024-10-31 22:14:47,670 INFO L226 Difference]: Without dead ends: 113 [2024-10-31 22:14:47,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:47,676 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:47,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-31 22:14:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-31 22:14:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:14:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-10-31 22:14:47,691 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-10-31 22:14:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-10-31 22:14:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-10-31 22:14:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:14:47,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:47,696 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:47,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:14:47,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:47,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 81231656, now seen corresponding path program 1 times [2024-10-31 22:14:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:47,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960616453] [2024-10-31 22:14:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:48,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960616453] [2024-10-31 22:14:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960616453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789430089] [2024-10-31 22:14:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:48,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:48,380 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:48,530 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2024-10-31 22:14:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:48,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-31 22:14:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:48,534 INFO L225 Difference]: With dead ends: 333 [2024-10-31 22:14:48,535 INFO L226 Difference]: Without dead ends: 223 [2024-10-31 22:14:48,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:48,539 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 152 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:48,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 586 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-31 22:14:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2024-10-31 22:14:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 191 states have (on average 1.387434554973822) internal successors, (265), 191 states have internal predecessors, (265), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:14:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-10-31 22:14:48,597 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 115 [2024-10-31 22:14:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-10-31 22:14:48,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-10-31 22:14:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:14:48,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:48,604 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:14:48,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:48,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1305195944, now seen corresponding path program 1 times [2024-10-31 22:14:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:48,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797296444] [2024-10-31 22:14:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797296444] [2024-10-31 22:14:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797296444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:49,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:14:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801741408] [2024-10-31 22:14:49,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:49,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:49,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:49,346 INFO L87 Difference]: Start difference. First operand 218 states and 313 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:49,621 INFO L93 Difference]: Finished difference Result 437 states and 627 transitions. [2024-10-31 22:14:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:49,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-31 22:14:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:49,626 INFO L225 Difference]: With dead ends: 437 [2024-10-31 22:14:49,626 INFO L226 Difference]: Without dead ends: 222 [2024-10-31 22:14:49,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:14:49,629 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 152 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:49,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 817 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:14:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-31 22:14:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-10-31 22:14:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.3842105263157896) internal successors, (263), 190 states have internal predecessors, (263), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:14:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 311 transitions. [2024-10-31 22:14:49,669 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 311 transitions. Word has length 116 [2024-10-31 22:14:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:49,673 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 311 transitions. [2024-10-31 22:14:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 311 transitions. [2024-10-31 22:14:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-31 22:14:49,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:49,676 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:14:49,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:49,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 635553891, now seen corresponding path program 1 times [2024-10-31 22:14:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158916801] [2024-10-31 22:14:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158916801] [2024-10-31 22:14:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158916801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:50,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:14:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870702984] [2024-10-31 22:14:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:50,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:50,445 INFO L87 Difference]: Start difference. First operand 217 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:50,744 INFO L93 Difference]: Finished difference Result 498 states and 713 transitions. [2024-10-31 22:14:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:50,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-31 22:14:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:50,747 INFO L225 Difference]: With dead ends: 498 [2024-10-31 22:14:50,747 INFO L226 Difference]: Without dead ends: 388 [2024-10-31 22:14:50,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:14:50,748 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 215 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:50,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 820 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:14:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-31 22:14:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2024-10-31 22:14:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 339 states have (on average 1.3893805309734513) internal successors, (471), 341 states have internal predecessors, (471), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:14:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 551 transitions. [2024-10-31 22:14:50,789 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 551 transitions. Word has length 117 [2024-10-31 22:14:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 551 transitions. [2024-10-31 22:14:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 551 transitions. [2024-10-31 22:14:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:14:50,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:50,791 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:50,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:14:50,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1552103804, now seen corresponding path program 1 times [2024-10-31 22:14:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647775513] [2024-10-31 22:14:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647775513] [2024-10-31 22:14:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647775513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:51,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:51,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:14:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644201713] [2024-10-31 22:14:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:51,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:51,222 INFO L87 Difference]: Start difference. First operand 384 states and 551 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:51,411 INFO L93 Difference]: Finished difference Result 940 states and 1348 transitions. [2024-10-31 22:14:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 22:14:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:51,417 INFO L225 Difference]: With dead ends: 940 [2024-10-31 22:14:51,417 INFO L226 Difference]: Without dead ends: 559 [2024-10-31 22:14:51,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:14:51,419 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 114 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:51,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 990 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-31 22:14:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 409. [2024-10-31 22:14:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 364 states have (on average 1.3928571428571428) internal successors, (507), 366 states have internal predecessors, (507), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:14:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 587 transitions. [2024-10-31 22:14:51,453 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 587 transitions. Word has length 118 [2024-10-31 22:14:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 587 transitions. [2024-10-31 22:14:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 587 transitions. [2024-10-31 22:14:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:14:51,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:51,456 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:14:51,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:51,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1309316045, now seen corresponding path program 1 times [2024-10-31 22:14:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960759444] [2024-10-31 22:14:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:51,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960759444] [2024-10-31 22:14:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960759444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:52,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072976943] [2024-10-31 22:14:52,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:52,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:52,008 INFO L87 Difference]: Start difference. First operand 409 states and 587 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:52,143 INFO L93 Difference]: Finished difference Result 1027 states and 1470 transitions. [2024-10-31 22:14:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:52,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 22:14:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:52,147 INFO L225 Difference]: With dead ends: 1027 [2024-10-31 22:14:52,147 INFO L226 Difference]: Without dead ends: 621 [2024-10-31 22:14:52,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:52,149 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:52,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-31 22:14:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 474. [2024-10-31 22:14:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 429 states have (on average 1.3986013986013985) internal successors, (600), 431 states have internal predecessors, (600), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:14:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 680 transitions. [2024-10-31 22:14:52,182 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 680 transitions. Word has length 118 [2024-10-31 22:14:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:52,182 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 680 transitions. [2024-10-31 22:14:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 680 transitions. [2024-10-31 22:14:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:14:52,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:52,185 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:52,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:14:52,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1732196226, now seen corresponding path program 1 times [2024-10-31 22:14:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:52,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642451221] [2024-10-31 22:14:52,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642451221] [2024-10-31 22:14:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642451221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:52,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:52,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37549038] [2024-10-31 22:14:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:52,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:52,562 INFO L87 Difference]: Start difference. First operand 474 states and 680 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:52,688 INFO L93 Difference]: Finished difference Result 1088 states and 1553 transitions. [2024-10-31 22:14:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 22:14:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:52,692 INFO L225 Difference]: With dead ends: 1088 [2024-10-31 22:14:52,692 INFO L226 Difference]: Without dead ends: 617 [2024-10-31 22:14:52,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:52,694 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:52,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 657 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-31 22:14:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 473. [2024-10-31 22:14:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 428 states have (on average 1.394859813084112) internal successors, (597), 430 states have internal predecessors, (597), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:14:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 677 transitions. [2024-10-31 22:14:52,725 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 677 transitions. Word has length 118 [2024-10-31 22:14:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:52,725 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 677 transitions. [2024-10-31 22:14:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 677 transitions. [2024-10-31 22:14:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:14:52,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:52,728 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:52,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:14:52,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:52,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 914547776, now seen corresponding path program 1 times [2024-10-31 22:14:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081664036] [2024-10-31 22:14:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:53,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081664036] [2024-10-31 22:14:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081664036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:53,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:14:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843720760] [2024-10-31 22:14:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:53,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:14:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:14:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:14:53,173 INFO L87 Difference]: Start difference. First operand 473 states and 677 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:53,349 INFO L93 Difference]: Finished difference Result 954 states and 1365 transitions. [2024-10-31 22:14:53,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:14:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 22:14:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:53,354 INFO L225 Difference]: With dead ends: 954 [2024-10-31 22:14:53,354 INFO L226 Difference]: Without dead ends: 714 [2024-10-31 22:14:53,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:14:53,356 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 183 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:53,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 630 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-31 22:14:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 684. [2024-10-31 22:14:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 617 states have (on average 1.3889789303079416) internal successors, (857), 620 states have internal predecessors, (857), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-31 22:14:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 977 transitions. [2024-10-31 22:14:53,419 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 977 transitions. Word has length 118 [2024-10-31 22:14:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:53,420 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 977 transitions. [2024-10-31 22:14:53,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 977 transitions. [2024-10-31 22:14:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:53,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:53,422 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:14:53,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:53,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -364021403, now seen corresponding path program 1 times [2024-10-31 22:14:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008116297] [2024-10-31 22:14:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:53,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008116297] [2024-10-31 22:14:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008116297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:53,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:53,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501883746] [2024-10-31 22:14:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:53,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:53,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:53,755 INFO L87 Difference]: Start difference. First operand 684 states and 977 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:53,892 INFO L93 Difference]: Finished difference Result 1442 states and 2053 transitions. [2024-10-31 22:14:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:14:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:53,897 INFO L225 Difference]: With dead ends: 1442 [2024-10-31 22:14:53,897 INFO L226 Difference]: Without dead ends: 761 [2024-10-31 22:14:53,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:53,899 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 73 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:53,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 667 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-31 22:14:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 643. [2024-10-31 22:14:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 576 states have (on average 1.3871527777777777) internal successors, (799), 579 states have internal predecessors, (799), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-31 22:14:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 919 transitions. [2024-10-31 22:14:53,945 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 919 transitions. Word has length 119 [2024-10-31 22:14:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 919 transitions. [2024-10-31 22:14:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 919 transitions. [2024-10-31 22:14:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:53,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:53,949 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:53,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:14:53,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2023782025, now seen corresponding path program 1 times [2024-10-31 22:14:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553198829] [2024-10-31 22:14:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553198829] [2024-10-31 22:14:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553198829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:54,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205497180] [2024-10-31 22:14:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:54,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:54,300 INFO L87 Difference]: Start difference. First operand 643 states and 919 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:54,426 INFO L93 Difference]: Finished difference Result 1098 states and 1564 transitions. [2024-10-31 22:14:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:54,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:14:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:54,430 INFO L225 Difference]: With dead ends: 1098 [2024-10-31 22:14:54,431 INFO L226 Difference]: Without dead ends: 655 [2024-10-31 22:14:54,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:54,432 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 68 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:54,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 741 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-31 22:14:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 616. [2024-10-31 22:14:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 549 states have (on average 1.3825136612021858) internal successors, (759), 552 states have internal predecessors, (759), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-31 22:14:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 879 transitions. [2024-10-31 22:14:54,477 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 879 transitions. Word has length 119 [2024-10-31 22:14:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:54,478 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 879 transitions. [2024-10-31 22:14:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 879 transitions. [2024-10-31 22:14:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:54,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:54,480 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:54,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:14:54,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:54,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:54,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1945076014, now seen corresponding path program 1 times [2024-10-31 22:14:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:54,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229901342] [2024-10-31 22:14:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229901342] [2024-10-31 22:14:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229901342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:55,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:14:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114416571] [2024-10-31 22:14:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:55,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:14:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:14:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:14:55,364 INFO L87 Difference]: Start difference. First operand 616 states and 879 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:56,067 INFO L93 Difference]: Finished difference Result 1344 states and 1910 transitions. [2024-10-31 22:14:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:14:56,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:14:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:56,072 INFO L225 Difference]: With dead ends: 1344 [2024-10-31 22:14:56,072 INFO L226 Difference]: Without dead ends: 731 [2024-10-31 22:14:56,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:14:56,076 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 407 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:56,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1427 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:14:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-31 22:14:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 716. [2024-10-31 22:14:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3767660910518054) internal successors, (877), 641 states have internal predecessors, (877), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-31 22:14:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2024-10-31 22:14:56,138 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 119 [2024-10-31 22:14:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:56,139 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2024-10-31 22:14:56,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2024-10-31 22:14:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:56,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:56,141 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:56,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:14:56,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1799398302, now seen corresponding path program 1 times [2024-10-31 22:14:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:56,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609226148] [2024-10-31 22:14:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:56,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609226148] [2024-10-31 22:14:56,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609226148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300241879] [2024-10-31 22:14:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:56,481 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:56,617 INFO L93 Difference]: Finished difference Result 1467 states and 2081 transitions. [2024-10-31 22:14:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:14:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:56,622 INFO L225 Difference]: With dead ends: 1467 [2024-10-31 22:14:56,622 INFO L226 Difference]: Without dead ends: 754 [2024-10-31 22:14:56,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:56,625 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 62 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:56,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 581 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-31 22:14:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 716. [2024-10-31 22:14:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3642072213500784) internal successors, (869), 641 states have internal predecessors, (869), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-31 22:14:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1009 transitions. [2024-10-31 22:14:56,684 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1009 transitions. Word has length 119 [2024-10-31 22:14:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1009 transitions. [2024-10-31 22:14:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1009 transitions. [2024-10-31 22:14:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:56,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:56,686 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:56,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:14:56,687 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:56,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1484451744, now seen corresponding path program 1 times [2024-10-31 22:14:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803169002] [2024-10-31 22:14:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:57,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803169002] [2024-10-31 22:14:57,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803169002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:57,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:57,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019569926] [2024-10-31 22:14:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:57,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:14:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:14:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:57,049 INFO L87 Difference]: Start difference. First operand 716 states and 1009 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:57,183 INFO L93 Difference]: Finished difference Result 1262 states and 1776 transitions. [2024-10-31 22:14:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:14:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:14:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:57,188 INFO L225 Difference]: With dead ends: 1262 [2024-10-31 22:14:57,188 INFO L226 Difference]: Without dead ends: 817 [2024-10-31 22:14:57,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:57,190 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 137 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:57,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 842 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:14:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-10-31 22:14:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 807. [2024-10-31 22:14:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 714 states have (on average 1.3571428571428572) internal successors, (969), 718 states have internal predecessors, (969), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-31 22:14:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1133 transitions. [2024-10-31 22:14:57,250 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1133 transitions. Word has length 119 [2024-10-31 22:14:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:57,250 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1133 transitions. [2024-10-31 22:14:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:14:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1133 transitions. [2024-10-31 22:14:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:14:57,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:57,253 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:57,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:14:57,253 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:57,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 829300942, now seen corresponding path program 1 times [2024-10-31 22:14:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704833566] [2024-10-31 22:14:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:14:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:14:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:14:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:14:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:14:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:14:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:14:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:14:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:14:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704833566] [2024-10-31 22:14:58,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704833566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:58,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:14:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633860363] [2024-10-31 22:14:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:58,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:14:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:14:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:14:58,439 INFO L87 Difference]: Start difference. First operand 807 states and 1133 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:00,173 INFO L93 Difference]: Finished difference Result 1752 states and 2457 transitions. [2024-10-31 22:15:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:15:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 22:15:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:00,180 INFO L225 Difference]: With dead ends: 1752 [2024-10-31 22:15:00,180 INFO L226 Difference]: Without dead ends: 948 [2024-10-31 22:15:00,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:15:00,184 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 433 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:00,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2189 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 22:15:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-31 22:15:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 841. [2024-10-31 22:15:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 737 states have (on average 1.3541383989145184) internal successors, (998), 742 states have internal predecessors, (998), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-31 22:15:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1182 transitions. [2024-10-31 22:15:00,290 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1182 transitions. Word has length 119 [2024-10-31 22:15:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:00,290 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1182 transitions. [2024-10-31 22:15:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1182 transitions. [2024-10-31 22:15:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:00,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:00,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:00,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:15:00,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 751755826, now seen corresponding path program 1 times [2024-10-31 22:15:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:00,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090904582] [2024-10-31 22:15:00,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090904582] [2024-10-31 22:15:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090904582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:00,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:15:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722989108] [2024-10-31 22:15:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:00,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:15:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:15:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:00,982 INFO L87 Difference]: Start difference. First operand 841 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:01,522 INFO L93 Difference]: Finished difference Result 1739 states and 2434 transitions. [2024-10-31 22:15:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:01,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-31 22:15:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:01,527 INFO L225 Difference]: With dead ends: 1739 [2024-10-31 22:15:01,528 INFO L226 Difference]: Without dead ends: 944 [2024-10-31 22:15:01,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:15:01,531 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 378 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:01,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1075 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:15:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-31 22:15:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 851. [2024-10-31 22:15:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 747 states have (on average 1.3534136546184738) internal successors, (1011), 752 states have internal predecessors, (1011), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-31 22:15:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1195 transitions. [2024-10-31 22:15:01,607 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1195 transitions. Word has length 120 [2024-10-31 22:15:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:01,607 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1195 transitions. [2024-10-31 22:15:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1195 transitions. [2024-10-31 22:15:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:01,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:01,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:01,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:15:01,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2137959220, now seen corresponding path program 1 times [2024-10-31 22:15:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829005726] [2024-10-31 22:15:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829005726] [2024-10-31 22:15:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829005726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:15:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132146040] [2024-10-31 22:15:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:15:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:15:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:15:02,706 INFO L87 Difference]: Start difference. First operand 851 states and 1195 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:03,797 INFO L93 Difference]: Finished difference Result 1665 states and 2329 transitions. [2024-10-31 22:15:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:15:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-31 22:15:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:03,802 INFO L225 Difference]: With dead ends: 1665 [2024-10-31 22:15:03,802 INFO L226 Difference]: Without dead ends: 860 [2024-10-31 22:15:03,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:15:03,804 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 490 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:03,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1880 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:15:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-10-31 22:15:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 836. [2024-10-31 22:15:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 732 states have (on average 1.3524590163934427) internal successors, (990), 737 states have internal predecessors, (990), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-31 22:15:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1174 transitions. [2024-10-31 22:15:03,874 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1174 transitions. Word has length 120 [2024-10-31 22:15:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:03,874 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1174 transitions. [2024-10-31 22:15:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1174 transitions. [2024-10-31 22:15:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:15:03,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:03,877 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:15:03,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2118823200, now seen corresponding path program 1 times [2024-10-31 22:15:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187247390] [2024-10-31 22:15:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187247390] [2024-10-31 22:15:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187247390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:15:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224251278] [2024-10-31 22:15:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:04,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:15:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:15:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:04,426 INFO L87 Difference]: Start difference. First operand 836 states and 1174 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:04,742 INFO L93 Difference]: Finished difference Result 1508 states and 2115 transitions. [2024-10-31 22:15:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:15:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-10-31 22:15:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:04,749 INFO L225 Difference]: With dead ends: 1508 [2024-10-31 22:15:04,749 INFO L226 Difference]: Without dead ends: 1001 [2024-10-31 22:15:04,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:04,751 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 129 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:04,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1142 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-31 22:15:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 996. [2024-10-31 22:15:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 868 states have (on average 1.347926267281106) internal successors, (1170), 875 states have internal predecessors, (1170), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:15:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1394 transitions. [2024-10-31 22:15:04,894 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1394 transitions. Word has length 121 [2024-10-31 22:15:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:04,895 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1394 transitions. [2024-10-31 22:15:04,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1394 transitions. [2024-10-31 22:15:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:15:04,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:04,899 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:04,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:15:04,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -408783257, now seen corresponding path program 1 times [2024-10-31 22:15:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604987951] [2024-10-31 22:15:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604987951] [2024-10-31 22:15:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604987951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:05,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482816779] [2024-10-31 22:15:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:05,242 INFO L87 Difference]: Start difference. First operand 996 states and 1394 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:05,433 INFO L93 Difference]: Finished difference Result 1934 states and 2707 transitions. [2024-10-31 22:15:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-10-31 22:15:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:05,439 INFO L225 Difference]: With dead ends: 1934 [2024-10-31 22:15:05,439 INFO L226 Difference]: Without dead ends: 984 [2024-10-31 22:15:05,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:05,442 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 55 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:05,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 583 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:15:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-31 22:15:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 982. [2024-10-31 22:15:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 854 states have (on average 1.345433255269321) internal successors, (1149), 861 states have internal predecessors, (1149), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:15:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1373 transitions. [2024-10-31 22:15:05,534 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1373 transitions. Word has length 121 [2024-10-31 22:15:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:05,535 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1373 transitions. [2024-10-31 22:15:05,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1373 transitions. [2024-10-31 22:15:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:15:05,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:05,538 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:05,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:15:05,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash -8353378, now seen corresponding path program 1 times [2024-10-31 22:15:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910488505] [2024-10-31 22:15:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:05,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910488505] [2024-10-31 22:15:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910488505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:05,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315184898] [2024-10-31 22:15:05,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:05,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:05,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:05,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:05,800 INFO L87 Difference]: Start difference. First operand 982 states and 1373 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:05,966 INFO L93 Difference]: Finished difference Result 1641 states and 2292 transitions. [2024-10-31 22:15:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-10-31 22:15:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:05,972 INFO L225 Difference]: With dead ends: 1641 [2024-10-31 22:15:05,972 INFO L226 Difference]: Without dead ends: 982 [2024-10-31 22:15:05,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:05,974 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 66 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:05,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 571 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:15:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-31 22:15:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2024-10-31 22:15:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 852 states have (on average 1.3392018779342723) internal successors, (1141), 859 states have internal predecessors, (1141), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:15:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1365 transitions. [2024-10-31 22:15:06,062 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1365 transitions. Word has length 121 [2024-10-31 22:15:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1365 transitions. [2024-10-31 22:15:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1365 transitions. [2024-10-31 22:15:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:15:06,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:06,065 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:06,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:15:06,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 417061139, now seen corresponding path program 1 times [2024-10-31 22:15:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873115366] [2024-10-31 22:15:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873115366] [2024-10-31 22:15:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873115366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168934174] [2024-10-31 22:15:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:06,553 INFO L87 Difference]: Start difference. First operand 980 states and 1365 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:07,000 INFO L93 Difference]: Finished difference Result 1939 states and 2691 transitions. [2024-10-31 22:15:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:15:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-10-31 22:15:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:07,007 INFO L225 Difference]: With dead ends: 1939 [2024-10-31 22:15:07,007 INFO L226 Difference]: Without dead ends: 1005 [2024-10-31 22:15:07,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:15:07,010 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 202 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:07,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1306 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-31 22:15:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 994. [2024-10-31 22:15:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 866 states have (on average 1.3302540415704387) internal successors, (1152), 873 states have internal predecessors, (1152), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:15:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1376 transitions. [2024-10-31 22:15:07,135 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1376 transitions. Word has length 121 [2024-10-31 22:15:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:07,136 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1376 transitions. [2024-10-31 22:15:07,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1376 transitions. [2024-10-31 22:15:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:15:07,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:07,139 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:15:07,139 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:07,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 635915857, now seen corresponding path program 1 times [2024-10-31 22:15:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226731850] [2024-10-31 22:15:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226731850] [2024-10-31 22:15:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226731850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:07,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490498845] [2024-10-31 22:15:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:07,418 INFO L87 Difference]: Start difference. First operand 994 states and 1376 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:07,601 INFO L93 Difference]: Finished difference Result 1932 states and 2670 transitions. [2024-10-31 22:15:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-10-31 22:15:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:07,608 INFO L225 Difference]: With dead ends: 1932 [2024-10-31 22:15:07,608 INFO L226 Difference]: Without dead ends: 984 [2024-10-31 22:15:07,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:07,611 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 50 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:07,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 729 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:15:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-31 22:15:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 982. [2024-10-31 22:15:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 854 states have (on average 1.3278688524590163) internal successors, (1134), 861 states have internal predecessors, (1134), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:15:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1358 transitions. [2024-10-31 22:15:07,709 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1358 transitions. Word has length 121 [2024-10-31 22:15:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:07,710 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1358 transitions. [2024-10-31 22:15:07,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1358 transitions. [2024-10-31 22:15:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 22:15:07,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:07,712 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:07,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:15:07,712 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:07,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1095319066, now seen corresponding path program 1 times [2024-10-31 22:15:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908122121] [2024-10-31 22:15:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:15:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:15:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:15:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:15:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:15:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:15:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:15:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:15:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:15:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:15:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908122121] [2024-10-31 22:15:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908122121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:08,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889944234] [2024-10-31 22:15:08,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:08,771 INFO L87 Difference]: Start difference. First operand 982 states and 1358 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:15:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:09,627 INFO L93 Difference]: Finished difference Result 1646 states and 2266 transitions. [2024-10-31 22:15:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-10-31 22:15:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:09,633 INFO L225 Difference]: With dead ends: 1646 [2024-10-31 22:15:09,633 INFO L226 Difference]: Without dead ends: 987 [2024-10-31 22:15:09,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:15:09,636 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 358 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:09,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 753 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]