./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:01:47,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:01:47,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:01:47,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:01:47,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:01:47,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:01:47,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:01:47,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:01:47,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:01:47,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:01:47,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:01:47,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:01:47,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:01:47,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:01:47,699 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:01:47,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:01:47,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:01:47,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:01:47,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:01:47,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:01:47,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:01:47,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:01:47,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:01:47,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:01:47,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:01:47,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:01:47,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:01:47,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:01:47,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:01:47,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:01:47,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:01:47,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:01:47,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:01:47,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:01:47,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:01:47,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:01:47,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:01:47,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:01:47,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:01:47,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:01:47,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:01:47,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:01:47,710 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c [2024-10-11 05:01:47,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:01:47,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:01:47,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:01:48,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:01:48,000 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:01:48,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-11 05:01:49,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:01:49,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:01:49,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-11 05:01:49,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/167edfcab/5c18a5204eca4ff7b7d47572c7b6c228/FLAG87de42905 [2024-10-11 05:01:50,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/167edfcab/5c18a5204eca4ff7b7d47572c7b6c228 [2024-10-11 05:01:50,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:01:50,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:01:50,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:01:50,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:01:50,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:01:50,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c90b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50, skipping insertion in model container [2024-10-11 05:01:50,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:01:50,461 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-10-11 05:01:50,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-10-11 05:01:50,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:01:50,696 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:01:50,706 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-10-11 05:01:50,716 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-10-11 05:01:50,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:01:50,808 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:01:50,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50 WrapperNode [2024-10-11 05:01:50,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:01:50,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:01:50,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:01:50,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:01:50,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,913 INFO L138 Inliner]: procedures = 72, calls = 84, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1083 [2024-10-11 05:01:50,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:01:50,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:01:50,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:01:50,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:01:50,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:01:50,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:50,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:51,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:51,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:51,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:01:51,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:01:51,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:01:51,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:01:51,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (1/1) ... [2024-10-11 05:01:51,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:01:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:51,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:01:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:01:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:01:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:01:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:01:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-11 05:01:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:01:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:01:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:01:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:01:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:01:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:01:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:01:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:01:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:01:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:01:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:01:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:01:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:01:51,249 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:01:51,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:01:52,191 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-11 05:01:52,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:01:52,286 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:01:52,286 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-11 05:01:52,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:01:52 BoogieIcfgContainer [2024-10-11 05:01:52,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:01:52,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:01:52,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:01:52,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:01:52,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:01:50" (1/3) ... [2024-10-11 05:01:52,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1e339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:01:52, skipping insertion in model container [2024-10-11 05:01:52,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:50" (2/3) ... [2024-10-11 05:01:52,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1e339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:01:52, skipping insertion in model container [2024-10-11 05:01:52,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:01:52" (3/3) ... [2024-10-11 05:01:52,306 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-11 05:01:52,337 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:01:52,338 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:01:52,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:01:52,463 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;@48b0601a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:01:52,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:01:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 411 states, 367 states have (on average 1.7247956403269755) internal successors, (633), 372 states have internal predecessors, (633), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 05:01:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:01:52,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:52,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:52,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:52,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1061080809, now seen corresponding path program 1 times [2024-10-11 05:01:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:52,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073632275] [2024-10-11 05:01:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073632275] [2024-10-11 05:01:53,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073632275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:53,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893575231] [2024-10-11 05:01:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:53,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:53,061 INFO L87 Difference]: Start difference. First operand has 411 states, 367 states have (on average 1.7247956403269755) internal successors, (633), 372 states have internal predecessors, (633), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:54,160 INFO L93 Difference]: Finished difference Result 863 states and 1458 transitions. [2024-10-11 05:01:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-11 05:01:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:54,177 INFO L225 Difference]: With dead ends: 863 [2024-10-11 05:01:54,178 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 05:01:54,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:54,186 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 886 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:54,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 696 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:01:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 05:01:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2024-10-11 05:01:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 414 states have (on average 1.5893719806763285) internal successors, (658), 418 states have internal predecessors, (658), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-11 05:01:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 734 transitions. [2024-10-11 05:01:54,250 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 734 transitions. Word has length 37 [2024-10-11 05:01:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:54,250 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 734 transitions. [2024-10-11 05:01:54,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 734 transitions. [2024-10-11 05:01:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 05:01:54,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:54,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:01:54,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1285072114, now seen corresponding path program 1 times [2024-10-11 05:01:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:54,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619410564] [2024-10-11 05:01:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 05:01:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619410564] [2024-10-11 05:01:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619410564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471723791] [2024-10-11 05:01:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:54,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:54,376 INFO L87 Difference]: Start difference. First operand 463 states and 734 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:54,878 INFO L93 Difference]: Finished difference Result 697 states and 1078 transitions. [2024-10-11 05:01:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 05:01:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:54,884 INFO L225 Difference]: With dead ends: 697 [2024-10-11 05:01:54,884 INFO L226 Difference]: Without dead ends: 586 [2024-10-11 05:01:54,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:54,886 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 899 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:54,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 697 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-11 05:01:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 563. [2024-10-11 05:01:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 501 states have (on average 1.5489021956087825) internal successors, (776), 506 states have internal predecessors, (776), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (54), 42 states have call predecessors, (54), 42 states have call successors, (54) [2024-10-11 05:01:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 874 transitions. [2024-10-11 05:01:54,968 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 874 transitions. Word has length 38 [2024-10-11 05:01:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:54,968 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 874 transitions. [2024-10-11 05:01:54,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 874 transitions. [2024-10-11 05:01:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 05:01:54,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:54,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:01:54,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -652138764, now seen corresponding path program 1 times [2024-10-11 05:01:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505201441] [2024-10-11 05:01:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:01:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505201441] [2024-10-11 05:01:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505201441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856772472] [2024-10-11 05:01:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:55,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:55,067 INFO L87 Difference]: Start difference. First operand 563 states and 874 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:55,687 INFO L93 Difference]: Finished difference Result 983 states and 1455 transitions. [2024-10-11 05:01:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 05:01:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:55,691 INFO L225 Difference]: With dead ends: 983 [2024-10-11 05:01:55,692 INFO L226 Difference]: Without dead ends: 772 [2024-10-11 05:01:55,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:55,694 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 346 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:55,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 987 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:01:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-11 05:01:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 668. [2024-10-11 05:01:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 594 states have (on average 1.5235690235690236) internal successors, (905), 601 states have internal predecessors, (905), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (60), 46 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-11 05:01:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1015 transitions. [2024-10-11 05:01:55,724 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1015 transitions. Word has length 39 [2024-10-11 05:01:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:55,725 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1015 transitions. [2024-10-11 05:01:55,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1015 transitions. [2024-10-11 05:01:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 05:01:55,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:55,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11 05:01:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:01:55,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:55,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2082821182, now seen corresponding path program 1 times [2024-10-11 05:01:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629158146] [2024-10-11 05:01:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 05:01:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:01:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629158146] [2024-10-11 05:01:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629158146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442055776] [2024-10-11 05:01:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:55,805 INFO L87 Difference]: Start difference. First operand 668 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:56,435 INFO L93 Difference]: Finished difference Result 1184 states and 1732 transitions. [2024-10-11 05:01:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-11 05:01:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:56,439 INFO L225 Difference]: With dead ends: 1184 [2024-10-11 05:01:56,440 INFO L226 Difference]: Without dead ends: 868 [2024-10-11 05:01:56,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:56,441 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 331 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:56,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1031 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:01:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-11 05:01:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 834. [2024-10-11 05:01:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 736 states have (on average 1.46875) internal successors, (1081), 745 states have internal predecessors, (1081), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-10-11 05:01:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1229 transitions. [2024-10-11 05:01:56,478 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1229 transitions. Word has length 54 [2024-10-11 05:01:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1229 transitions. [2024-10-11 05:01:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1229 transitions. [2024-10-11 05:01:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:01:56,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:56,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:01:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:01:56,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash -775611185, now seen corresponding path program 1 times [2024-10-11 05:01:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011549503] [2024-10-11 05:01:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:01:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:01:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:01:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011549503] [2024-10-11 05:01:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011549503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486623943] [2024-10-11 05:01:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:56,542 INFO L87 Difference]: Start difference. First operand 834 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:57,012 INFO L93 Difference]: Finished difference Result 1413 states and 2008 transitions. [2024-10-11 05:01:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-11 05:01:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:57,017 INFO L225 Difference]: With dead ends: 1413 [2024-10-11 05:01:57,017 INFO L226 Difference]: Without dead ends: 1011 [2024-10-11 05:01:57,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:57,019 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 885 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:57,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 709 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-10-11 05:01:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 962. [2024-10-11 05:01:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 848 states have (on average 1.4339622641509433) internal successors, (1216), 859 states have internal predecessors, (1216), 72 states have call successors, (72), 35 states have call predecessors, (72), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-11 05:01:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1386 transitions. [2024-10-11 05:01:57,057 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1386 transitions. Word has length 59 [2024-10-11 05:01:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1386 transitions. [2024-10-11 05:01:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1386 transitions. [2024-10-11 05:01:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:57,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:57,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:01:57,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:01:57,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1102984900, now seen corresponding path program 1 times [2024-10-11 05:01:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989707361] [2024-10-11 05:01:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:01:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989707361] [2024-10-11 05:01:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989707361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910411910] [2024-10-11 05:01:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:57,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:57,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:57,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:01:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:01:57,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:01:57,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910411910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:01:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364372778] [2024-10-11 05:01:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:57,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:57,304 INFO L87 Difference]: Start difference. First operand 962 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:57,453 INFO L93 Difference]: Finished difference Result 1450 states and 2060 transitions. [2024-10-11 05:01:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:01:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:01:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:57,458 INFO L225 Difference]: With dead ends: 1450 [2024-10-11 05:01:57,459 INFO L226 Difference]: Without dead ends: 967 [2024-10-11 05:01:57,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:57,461 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:57,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1789 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-10-11 05:01:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-10-11 05:01:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 853 states have (on average 1.422039859320047) internal successors, (1213), 864 states have internal predecessors, (1213), 72 states have call successors, (72), 35 states have call predecessors, (72), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-11 05:01:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1383 transitions. [2024-10-11 05:01:57,510 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1383 transitions. Word has length 60 [2024-10-11 05:01:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1383 transitions. [2024-10-11 05:01:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1383 transitions. [2024-10-11 05:01:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:57,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:57,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:01:57,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:01:57,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:57,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:57,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 258979398, now seen corresponding path program 1 times [2024-10-11 05:01:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585575534] [2024-10-11 05:01:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:01:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585575534] [2024-10-11 05:01:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585575534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768989183] [2024-10-11 05:01:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:57,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:57,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:57,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:01:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:57,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:01:57,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:01:57,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768989183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:01:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139718315] [2024-10-11 05:01:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:57,917 INFO L87 Difference]: Start difference. First operand 967 states and 1383 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:58,038 INFO L93 Difference]: Finished difference Result 1393 states and 1962 transitions. [2024-10-11 05:01:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:01:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:01:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:58,042 INFO L225 Difference]: With dead ends: 1393 [2024-10-11 05:01:58,043 INFO L226 Difference]: Without dead ends: 864 [2024-10-11 05:01:58,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:58,044 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1789 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-11 05:01:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 857. [2024-10-11 05:01:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 761 states have (on average 1.4323258869908015) internal successors, (1090), 770 states have internal predecessors, (1090), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-11 05:01:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1231 transitions. [2024-10-11 05:01:58,074 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1231 transitions. Word has length 60 [2024-10-11 05:01:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1231 transitions. [2024-10-11 05:01:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1231 transitions. [2024-10-11 05:01:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:58,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:58,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:01:58,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:01:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:58,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2056619014, now seen corresponding path program 1 times [2024-10-11 05:01:58,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:58,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863866194] [2024-10-11 05:01:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:58,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863866194] [2024-10-11 05:01:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863866194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:58,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:01:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042932849] [2024-10-11 05:01:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:58,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:01:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:58,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:01:58,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:58,367 INFO L87 Difference]: Start difference. First operand 857 states and 1231 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:58,920 INFO L93 Difference]: Finished difference Result 942 states and 1334 transitions. [2024-10-11 05:01:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:01:58,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-11 05:01:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:58,925 INFO L225 Difference]: With dead ends: 942 [2024-10-11 05:01:58,925 INFO L226 Difference]: Without dead ends: 939 [2024-10-11 05:01:58,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:01:58,926 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1481 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:58,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 706 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:01:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-11 05:01:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 856. [2024-10-11 05:01:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 761 states have (on average 1.4296977660972405) internal successors, (1088), 769 states have internal predecessors, (1088), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-11 05:01:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1228 transitions. [2024-10-11 05:01:58,962 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1228 transitions. Word has length 60 [2024-10-11 05:01:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:58,963 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1228 transitions. [2024-10-11 05:01:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1228 transitions. [2024-10-11 05:01:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 05:01:58,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:58,965 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:01:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:01:58,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:58,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash -670725648, now seen corresponding path program 1 times [2024-10-11 05:01:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124153150] [2024-10-11 05:01:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:59,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124153150] [2024-10-11 05:01:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124153150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629071826] [2024-10-11 05:01:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:59,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:59,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:59,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:01:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:59,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:01:59,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:59,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:01:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:59,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629071826] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:01:59,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:01:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-11 05:01:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272089722] [2024-10-11 05:01:59,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:01:59,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:01:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:01:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:01:59,613 INFO L87 Difference]: Start difference. First operand 856 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:02:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:00,573 INFO L93 Difference]: Finished difference Result 1659 states and 2263 transitions. [2024-10-11 05:02:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:02:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-11 05:02:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:00,580 INFO L225 Difference]: With dead ends: 1659 [2024-10-11 05:02:00,580 INFO L226 Difference]: Without dead ends: 1656 [2024-10-11 05:02:00,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:02:00,584 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1081 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:00,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1646 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:02:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-10-11 05:02:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1159. [2024-10-11 05:02:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1028 states have (on average 1.394941634241245) internal successors, (1434), 1042 states have internal predecessors, (1434), 80 states have call successors, (80), 42 states have call predecessors, (80), 49 states have return successors, (109), 75 states have call predecessors, (109), 79 states have call successors, (109) [2024-10-11 05:02:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1623 transitions. [2024-10-11 05:02:00,644 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1623 transitions. Word has length 61 [2024-10-11 05:02:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:00,644 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1623 transitions. [2024-10-11 05:02:00,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:02:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1623 transitions. [2024-10-11 05:02:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:02:00,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:00,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:00,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:02:00,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:02:00,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:00,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1722584425, now seen corresponding path program 2 times [2024-10-11 05:02:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598825866] [2024-10-11 05:02:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:02:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:02:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:02:00,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:00,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598825866] [2024-10-11 05:02:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598825866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:00,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:00,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:02:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532476184] [2024-10-11 05:02:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:00,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:02:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:00,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:02:00,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:02:00,918 INFO L87 Difference]: Start difference. First operand 1159 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:02:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:01,436 INFO L93 Difference]: Finished difference Result 1787 states and 2440 transitions. [2024-10-11 05:02:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:02:01,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-11 05:02:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:01,441 INFO L225 Difference]: With dead ends: 1787 [2024-10-11 05:02:01,441 INFO L226 Difference]: Without dead ends: 1128 [2024-10-11 05:02:01,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:02:01,442 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 898 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:01,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 725 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:02:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-10-11 05:02:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1051. [2024-10-11 05:02:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 933 states have (on average 1.39978563772776) internal successors, (1306), 947 states have internal predecessors, (1306), 73 states have call successors, (73), 37 states have call predecessors, (73), 43 states have return successors, (98), 67 states have call predecessors, (98), 72 states have call successors, (98) [2024-10-11 05:02:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1477 transitions. [2024-10-11 05:02:01,483 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1477 transitions. Word has length 78 [2024-10-11 05:02:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:01,484 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1477 transitions. [2024-10-11 05:02:01,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:02:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1477 transitions. [2024-10-11 05:02:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:02:01,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:01,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:01,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:02:01,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:01,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 234886168, now seen corresponding path program 1 times [2024-10-11 05:02:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152769854] [2024-10-11 05:02:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:02:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 05:02:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 05:02:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:02:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:02:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152769854] [2024-10-11 05:02:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152769854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:02:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742862396] [2024-10-11 05:02:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:02:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:02:01,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:02:01,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:02:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:01,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:02:01,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:02:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:02:01,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:02:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742862396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:02:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:02:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758405625] [2024-10-11 05:02:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:02:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:02:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:01,701 INFO L87 Difference]: Start difference. First operand 1051 states and 1477 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:02:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:01,818 INFO L93 Difference]: Finished difference Result 1334 states and 1833 transitions. [2024-10-11 05:02:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:02:01,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-11 05:02:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:01,821 INFO L225 Difference]: With dead ends: 1334 [2024-10-11 05:02:01,821 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 05:02:01,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:01,823 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 55 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:01,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1208 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:02:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 05:02:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-11 05:02:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.6337579617834395) internal successors, (513), 315 states have internal predecessors, (513), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:02:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2024-10-11 05:02:01,837 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 92 [2024-10-11 05:02:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:01,837 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2024-10-11 05:02:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:02:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2024-10-11 05:02:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:01,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:01,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:01,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:02:02,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:02:02,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:02,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash 21736103, now seen corresponding path program 1 times [2024-10-11 05:02:02,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738651190] [2024-10-11 05:02:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:02,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738651190] [2024-10-11 05:02:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738651190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:02:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525440157] [2024-10-11 05:02:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:02:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:02:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:02:02,226 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:04,083 INFO L93 Difference]: Finished difference Result 819 states and 1356 transitions. [2024-10-11 05:02:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:02:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:04,087 INFO L225 Difference]: With dead ends: 819 [2024-10-11 05:02:04,087 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 05:02:04,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:02:04,089 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 977 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:04,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 622 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:02:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 05:02:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 347. [2024-10-11 05:02:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.6305732484076434) internal successors, (512), 315 states have internal predecessors, (512), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:02:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 564 transitions. [2024-10-11 05:02:04,116 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 564 transitions. Word has length 161 [2024-10-11 05:02:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:04,116 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 564 transitions. [2024-10-11 05:02:04,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 564 transitions. [2024-10-11 05:02:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:04,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:04,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:02:04,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:04,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1791207717, now seen corresponding path program 1 times [2024-10-11 05:02:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21057352] [2024-10-11 05:02:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:04,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21057352] [2024-10-11 05:02:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21057352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:04,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:02:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732524596] [2024-10-11 05:02:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:04,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:02:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:02:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:02:04,346 INFO L87 Difference]: Start difference. First operand 347 states and 564 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:06,112 INFO L93 Difference]: Finished difference Result 811 states and 1339 transitions. [2024-10-11 05:02:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:02:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:06,115 INFO L225 Difference]: With dead ends: 811 [2024-10-11 05:02:06,115 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 05:02:06,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:02:06,120 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 968 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:06,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 620 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:02:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 05:02:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 347. [2024-10-11 05:02:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.627388535031847) internal successors, (511), 315 states have internal predecessors, (511), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:02:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 563 transitions. [2024-10-11 05:02:06,172 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 563 transitions. Word has length 161 [2024-10-11 05:02:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:06,173 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 563 transitions. [2024-10-11 05:02:06,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 563 transitions. [2024-10-11 05:02:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:06,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:06,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:02:06,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -139917917, now seen corresponding path program 1 times [2024-10-11 05:02:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890740700] [2024-10-11 05:02:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:06,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890740700] [2024-10-11 05:02:06,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890740700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:06,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:06,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:02:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113333855] [2024-10-11 05:02:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:02:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:02:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:06,540 INFO L87 Difference]: Start difference. First operand 347 states and 563 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:09,261 INFO L93 Difference]: Finished difference Result 1282 states and 2129 transitions. [2024-10-11 05:02:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:02:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:09,266 INFO L225 Difference]: With dead ends: 1282 [2024-10-11 05:02:09,267 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 05:02:09,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:09,268 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1476 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:09,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1048 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:02:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 05:02:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 695. [2024-10-11 05:02:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 634 states have (on average 1.638801261829653) internal successors, (1039), 636 states have internal predecessors, (1039), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 05:02:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1136 transitions. [2024-10-11 05:02:09,312 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1136 transitions. Word has length 161 [2024-10-11 05:02:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:09,312 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1136 transitions. [2024-10-11 05:02:09,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1136 transitions. [2024-10-11 05:02:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:09,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:09,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:09,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:02:09,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -626700829, now seen corresponding path program 1 times [2024-10-11 05:02:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350267655] [2024-10-11 05:02:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350267655] [2024-10-11 05:02:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350267655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062290134] [2024-10-11 05:02:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:09,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:09,647 INFO L87 Difference]: Start difference. First operand 695 states and 1136 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:13,690 INFO L93 Difference]: Finished difference Result 2127 states and 3535 transitions. [2024-10-11 05:02:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:13,697 INFO L225 Difference]: With dead ends: 2127 [2024-10-11 05:02:13,698 INFO L226 Difference]: Without dead ends: 1451 [2024-10-11 05:02:13,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:02:13,701 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1521 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:13,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1992 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 05:02:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-10-11 05:02:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1016. [2024-10-11 05:02:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.6321467098166127) internal successors, (1513), 930 states have internal predecessors, (1513), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 05:02:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1654 transitions. [2024-10-11 05:02:13,783 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1654 transitions. Word has length 161 [2024-10-11 05:02:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1654 transitions. [2024-10-11 05:02:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1654 transitions. [2024-10-11 05:02:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:13,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:13,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:13,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:02:13,786 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:13,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1880396645, now seen corresponding path program 1 times [2024-10-11 05:02:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653013873] [2024-10-11 05:02:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653013873] [2024-10-11 05:02:14,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653013873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307003283] [2024-10-11 05:02:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:14,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:14,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:14,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:14,118 INFO L87 Difference]: Start difference. First operand 1016 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:16,033 INFO L93 Difference]: Finished difference Result 2466 states and 4095 transitions. [2024-10-11 05:02:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:16,038 INFO L225 Difference]: With dead ends: 2466 [2024-10-11 05:02:16,038 INFO L226 Difference]: Without dead ends: 1469 [2024-10-11 05:02:16,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:16,040 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1322 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:16,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 861 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:02:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2024-10-11 05:02:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1016. [2024-10-11 05:02:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.62891046386192) internal successors, (1510), 930 states have internal predecessors, (1510), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 05:02:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1651 transitions. [2024-10-11 05:02:16,092 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1651 transitions. Word has length 161 [2024-10-11 05:02:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:16,092 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1651 transitions. [2024-10-11 05:02:16,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1651 transitions. [2024-10-11 05:02:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:16,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:16,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:16,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:02:16,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1950044519, now seen corresponding path program 1 times [2024-10-11 05:02:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630247537] [2024-10-11 05:02:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630247537] [2024-10-11 05:02:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630247537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:16,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688954881] [2024-10-11 05:02:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:16,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:16,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:16,286 INFO L87 Difference]: Start difference. First operand 1016 states and 1651 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:18,128 INFO L93 Difference]: Finished difference Result 2462 states and 4078 transitions. [2024-10-11 05:02:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:18,134 INFO L225 Difference]: With dead ends: 2462 [2024-10-11 05:02:18,135 INFO L226 Difference]: Without dead ends: 1465 [2024-10-11 05:02:18,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:18,137 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1078 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:18,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1024 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:02:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-10-11 05:02:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1016. [2024-10-11 05:02:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.6256742179072277) internal successors, (1507), 930 states have internal predecessors, (1507), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 05:02:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1648 transitions. [2024-10-11 05:02:18,206 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1648 transitions. Word has length 161 [2024-10-11 05:02:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:18,207 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1648 transitions. [2024-10-11 05:02:18,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1648 transitions. [2024-10-11 05:02:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:18,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:18,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:02:18,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1927034075, now seen corresponding path program 1 times [2024-10-11 05:02:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960922221] [2024-10-11 05:02:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960922221] [2024-10-11 05:02:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960922221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:18,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597233889] [2024-10-11 05:02:18,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:18,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:18,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:18,461 INFO L87 Difference]: Start difference. First operand 1016 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:20,279 INFO L93 Difference]: Finished difference Result 2458 states and 4061 transitions. [2024-10-11 05:02:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:20,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:20,284 INFO L225 Difference]: With dead ends: 2458 [2024-10-11 05:02:20,284 INFO L226 Difference]: Without dead ends: 1461 [2024-10-11 05:02:20,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:20,286 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1228 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:20,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 862 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:02:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2024-10-11 05:02:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1016. [2024-10-11 05:02:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.622437971952535) internal successors, (1504), 930 states have internal predecessors, (1504), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 05:02:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1645 transitions. [2024-10-11 05:02:20,339 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1645 transitions. Word has length 161 [2024-10-11 05:02:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1645 transitions. [2024-10-11 05:02:20,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1645 transitions. [2024-10-11 05:02:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:20,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:20,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:02:20,341 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -528080473, now seen corresponding path program 1 times [2024-10-11 05:02:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222534249] [2024-10-11 05:02:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222534249] [2024-10-11 05:02:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222534249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965670212] [2024-10-11 05:02:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:20,573 INFO L87 Difference]: Start difference. First operand 1016 states and 1645 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:24,273 INFO L93 Difference]: Finished difference Result 3352 states and 5515 transitions. [2024-10-11 05:02:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:24,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:24,284 INFO L225 Difference]: With dead ends: 3352 [2024-10-11 05:02:24,284 INFO L226 Difference]: Without dead ends: 2355 [2024-10-11 05:02:24,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:02:24,288 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1494 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:24,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1990 Invalid, 3692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 05:02:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2024-10-11 05:02:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1671. [2024-10-11 05:02:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1526 states have (on average 1.6153342070773264) internal successors, (2465), 1531 states have internal predecessors, (2465), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 05:02:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2698 transitions. [2024-10-11 05:02:24,420 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2698 transitions. Word has length 161 [2024-10-11 05:02:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2698 transitions. [2024-10-11 05:02:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2698 transitions. [2024-10-11 05:02:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:24,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:24,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:02:24,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:24,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2145520923, now seen corresponding path program 1 times [2024-10-11 05:02:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746045727] [2024-10-11 05:02:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746045727] [2024-10-11 05:02:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746045727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94738035] [2024-10-11 05:02:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:24,679 INFO L87 Difference]: Start difference. First operand 1671 states and 2698 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:26,518 INFO L93 Difference]: Finished difference Result 3994 states and 6556 transitions. [2024-10-11 05:02:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:26,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:26,526 INFO L225 Difference]: With dead ends: 3994 [2024-10-11 05:02:26,526 INFO L226 Difference]: Without dead ends: 2342 [2024-10-11 05:02:26,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:26,529 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1227 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:26,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 862 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:02:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-10-11 05:02:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1671. [2024-10-11 05:02:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1526 states have (on average 1.6120576671035387) internal successors, (2460), 1531 states have internal predecessors, (2460), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 05:02:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2693 transitions. [2024-10-11 05:02:26,696 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2693 transitions. Word has length 161 [2024-10-11 05:02:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2693 transitions. [2024-10-11 05:02:26,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2693 transitions. [2024-10-11 05:02:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:26,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:26,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:26,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:02:26,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:26,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1782054425, now seen corresponding path program 1 times [2024-10-11 05:02:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296409264] [2024-10-11 05:02:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:26,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:26,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296409264] [2024-10-11 05:02:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296409264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:26,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:26,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965173894] [2024-10-11 05:02:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:26,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:26,994 INFO L87 Difference]: Start difference. First operand 1671 states and 2693 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:31,116 INFO L93 Difference]: Finished difference Result 5725 states and 9356 transitions. [2024-10-11 05:02:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:31,133 INFO L225 Difference]: With dead ends: 5725 [2024-10-11 05:02:31,133 INFO L226 Difference]: Without dead ends: 4073 [2024-10-11 05:02:31,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:02:31,139 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1486 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3591 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:31,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1990 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3591 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 05:02:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2024-10-11 05:02:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 2981. [2024-10-11 05:02:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2724 states have (on average 1.604992657856094) internal successors, (4372), 2733 states have internal predecessors, (4372), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 05:02:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4795 transitions. [2024-10-11 05:02:31,456 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4795 transitions. Word has length 161 [2024-10-11 05:02:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:31,457 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4795 transitions. [2024-10-11 05:02:31,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4795 transitions. [2024-10-11 05:02:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:31,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:31,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:02:31,461 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:31,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1493235035, now seen corresponding path program 1 times [2024-10-11 05:02:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769216065] [2024-10-11 05:02:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769216065] [2024-10-11 05:02:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769216065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626669302] [2024-10-11 05:02:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:31,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:31,790 INFO L87 Difference]: Start difference. First operand 2981 states and 4795 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:35,984 INFO L93 Difference]: Finished difference Result 10477 states and 17092 transitions. [2024-10-11 05:02:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:35,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:36,018 INFO L225 Difference]: With dead ends: 10477 [2024-10-11 05:02:36,018 INFO L226 Difference]: Without dead ends: 7515 [2024-10-11 05:02:36,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:02:36,030 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1491 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:36,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1990 Invalid, 3636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 05:02:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2024-10-11 05:02:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 5606. [2024-10-11 05:02:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.6003902439024391) internal successors, (8202), 5142 states have internal predecessors, (8202), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 05:02:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 9023 transitions. [2024-10-11 05:02:36,516 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 9023 transitions. Word has length 161 [2024-10-11 05:02:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:36,516 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 9023 transitions. [2024-10-11 05:02:36,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 9023 transitions. [2024-10-11 05:02:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:36,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:36,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:36,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:02:36,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:36,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2038107609, now seen corresponding path program 1 times [2024-10-11 05:02:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675423653] [2024-10-11 05:02:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:36,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675423653] [2024-10-11 05:02:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675423653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933628299] [2024-10-11 05:02:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:36,706 INFO L87 Difference]: Start difference. First operand 5606 states and 9023 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:38,709 INFO L93 Difference]: Finished difference Result 13164 states and 21513 transitions. [2024-10-11 05:02:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:38,731 INFO L225 Difference]: With dead ends: 13164 [2024-10-11 05:02:38,731 INFO L226 Difference]: Without dead ends: 7577 [2024-10-11 05:02:38,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:38,747 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1137 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:38,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1023 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:02:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2024-10-11 05:02:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5606. [2024-10-11 05:02:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.5970731707317074) internal successors, (8185), 5142 states have internal predecessors, (8185), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 05:02:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 9006 transitions. [2024-10-11 05:02:39,182 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 9006 transitions. Word has length 161 [2024-10-11 05:02:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:39,182 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 9006 transitions. [2024-10-11 05:02:39,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 9006 transitions. [2024-10-11 05:02:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:39,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:39,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:39,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:02:39,186 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1308807721, now seen corresponding path program 1 times [2024-10-11 05:02:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719720862] [2024-10-11 05:02:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719720862] [2024-10-11 05:02:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719720862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643460754] [2024-10-11 05:02:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:39,357 INFO L87 Difference]: Start difference. First operand 5606 states and 9006 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:41,458 INFO L93 Difference]: Finished difference Result 13146 states and 21426 transitions. [2024-10-11 05:02:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:41,478 INFO L225 Difference]: With dead ends: 13146 [2024-10-11 05:02:41,478 INFO L226 Difference]: Without dead ends: 7559 [2024-10-11 05:02:41,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:41,489 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1077 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:41,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1024 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:02:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2024-10-11 05:02:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5606. [2024-10-11 05:02:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.5937560975609757) internal successors, (8168), 5142 states have internal predecessors, (8168), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 05:02:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 8989 transitions. [2024-10-11 05:02:41,833 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 8989 transitions. Word has length 161 [2024-10-11 05:02:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:41,834 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 8989 transitions. [2024-10-11 05:02:41,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 8989 transitions. [2024-10-11 05:02:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:41,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:02:41,837 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 724036071, now seen corresponding path program 1 times [2024-10-11 05:02:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026743124] [2024-10-11 05:02:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:42,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026743124] [2024-10-11 05:02:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026743124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617188784] [2024-10-11 05:02:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:42,133 INFO L87 Difference]: Start difference. First operand 5606 states and 8989 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:46,890 INFO L93 Difference]: Finished difference Result 22358 states and 36300 transitions. [2024-10-11 05:02:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:02:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:46,936 INFO L225 Difference]: With dead ends: 22358 [2024-10-11 05:02:46,936 INFO L226 Difference]: Without dead ends: 16771 [2024-10-11 05:02:46,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:02:46,951 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1906 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:46,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1983 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 05:02:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16771 states. [2024-10-11 05:02:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16771 to 10890. [2024-10-11 05:02:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 9977 states have (on average 1.5908589756439813) internal successors, (15872), 10010 states have internal predecessors, (15872), 682 states have call successors, (682), 198 states have call predecessors, (682), 230 states have return successors, (957), 713 states have call predecessors, (957), 682 states have call successors, (957) [2024-10-11 05:02:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 17511 transitions. [2024-10-11 05:02:48,125 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 17511 transitions. Word has length 161 [2024-10-11 05:02:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:48,126 INFO L471 AbstractCegarLoop]: Abstraction has 10890 states and 17511 transitions. [2024-10-11 05:02:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 17511 transitions. [2024-10-11 05:02:48,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:48,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:48,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:02:48,131 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 289530473, now seen corresponding path program 1 times [2024-10-11 05:02:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800552735] [2024-10-11 05:02:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800552735] [2024-10-11 05:02:48,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800552735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:48,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027262597] [2024-10-11 05:02:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:48,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:48,356 INFO L87 Difference]: Start difference. First operand 10890 states and 17511 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:54,643 INFO L93 Difference]: Finished difference Result 43352 states and 70600 transitions. [2024-10-11 05:02:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:02:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:02:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:54,727 INFO L225 Difference]: With dead ends: 43352 [2024-10-11 05:02:54,728 INFO L226 Difference]: Without dead ends: 32481 [2024-10-11 05:02:54,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:02:54,755 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 1869 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:54,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 1979 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 05:02:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32481 states. [2024-10-11 05:02:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32481 to 21291. [2024-10-11 05:02:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21291 states, 19530 states have (on average 1.5894521249359959) internal successors, (31042), 19595 states have internal predecessors, (31042), 1306 states have call successors, (1306), 390 states have call predecessors, (1306), 454 states have return successors, (2099), 1369 states have call predecessors, (2099), 1306 states have call successors, (2099) [2024-10-11 05:02:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21291 states to 21291 states and 34447 transitions. [2024-10-11 05:02:56,695 INFO L78 Accepts]: Start accepts. Automaton has 21291 states and 34447 transitions. Word has length 161 [2024-10-11 05:02:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:56,695 INFO L471 AbstractCegarLoop]: Abstraction has 21291 states and 34447 transitions. [2024-10-11 05:02:56,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21291 states and 34447 transitions. [2024-10-11 05:02:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:02:56,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:56,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:02:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:02:56,710 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:56,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash -140127833, now seen corresponding path program 1 times [2024-10-11 05:02:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977566270] [2024-10-11 05:02:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:02:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:02:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:02:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:02:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977566270] [2024-10-11 05:02:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977566270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:57,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192459760] [2024-10-11 05:02:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:57,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:57,067 INFO L87 Difference]: Start difference. First operand 21291 states and 34447 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:06,742 INFO L93 Difference]: Finished difference Result 84407 states and 138238 transitions. [2024-10-11 05:03:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:06,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:03:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:06,988 INFO L225 Difference]: With dead ends: 84407 [2024-10-11 05:03:06,989 INFO L226 Difference]: Without dead ends: 63135 [2024-10-11 05:03:07,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:07,055 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1562 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:07,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1983 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 05:03:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63135 states. [2024-10-11 05:03:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63135 to 42252. [2024-10-11 05:03:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42252 states, 38827 states have (on average 1.5891003683004095) internal successors, (61700), 38956 states have internal predecessors, (61700), 2522 states have call successors, (2522), 774 states have call predecessors, (2522), 902 states have return successors, (4837), 2649 states have call predecessors, (4837), 2522 states have call successors, (4837) [2024-10-11 05:03:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42252 states to 42252 states and 69059 transitions. [2024-10-11 05:03:11,564 INFO L78 Accepts]: Start accepts. Automaton has 42252 states and 69059 transitions. Word has length 161 [2024-10-11 05:03:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:11,564 INFO L471 AbstractCegarLoop]: Abstraction has 42252 states and 69059 transitions. [2024-10-11 05:03:11,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 42252 states and 69059 transitions. [2024-10-11 05:03:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:03:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:11,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:03:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:03:11,590 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:11,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash -846724439, now seen corresponding path program 1 times [2024-10-11 05:03:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815849228] [2024-10-11 05:03:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:03:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:03:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:03:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:03:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:11,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:11,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815849228] [2024-10-11 05:03:11,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815849228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:11,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:11,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135542842] [2024-10-11 05:03:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:11,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:11,865 INFO L87 Difference]: Start difference. First operand 42252 states and 69059 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)