./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.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b77809112787d30d81c7c3c0f8f2a230e1ec99494e3dfc2397bd48db4468ad64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:42:12,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:42:12,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:42:12,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:42:12,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:42:12,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:42:12,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:42:12,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:42:12,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:42:12,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:42:12,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:42:12,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:42:12,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:42:12,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:42:12,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:42:12,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:42:12,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:42:12,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:42:12,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:42:12,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:42:12,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:42:12,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:42:12,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:42:12,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:42:12,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:42:12,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:42:12,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:42:12,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:42:12,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:42:12,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:42:12,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:42:12,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:42:12,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:42:12,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:42:12,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:42:12,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:42:12,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:42:12,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:42:12,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:42:12,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:42:12,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:42:12,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:42:12,992 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/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/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 -> b77809112787d30d81c7c3c0f8f2a230e1ec99494e3dfc2397bd48db4468ad64 [2024-10-12 21:42:13,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:42:13,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:42:13,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:42:13,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:42:13,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:42:13,256 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.13.cil-2.c [2024-10-12 21:42:14,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:42:14,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:42:14,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-2.c [2024-10-12 21:42:14,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985eb66c5/6edeab0cf3b94562a55bde72dbfb5525/FLAG8d2b74ccc [2024-10-12 21:42:15,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985eb66c5/6edeab0cf3b94562a55bde72dbfb5525 [2024-10-12 21:42:15,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:42:15,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:42:15,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:42:15,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:42:15,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:42:15,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:15,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e4d1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15, skipping insertion in model container [2024-10-12 21:42:15,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:15,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:42:15,575 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.13.cil-2.c[913,926] [2024-10-12 21:42:15,625 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.13.cil-2.c[5977,5990] [2024-10-12 21:42:15,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:42:15,751 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:42:15,763 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.13.cil-2.c[913,926] [2024-10-12 21:42:15,803 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.13.cil-2.c[5977,5990] [2024-10-12 21:42:15,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:42:15,939 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:42:15,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15 WrapperNode [2024-10-12 21:42:15,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:42:15,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:42:15,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:42:15,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:42:15,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:15,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,011 INFO L138 Inliner]: procedures = 74, calls = 87, calls flagged for inlining = 49, calls inlined = 49, statements flattened = 1143 [2024-10-12 21:42:16,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:42:16,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:42:16,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:42:16,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:42:16,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,053 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-12 21:42:16,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:42:16,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:42:16,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:42:16,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:42:16,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (1/1) ... [2024-10-12 21:42:16,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:42:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:16,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:42:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:42:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:42:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:42:16,209 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:42:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:42:16,211 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:42:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:42:16,211 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:42:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:42:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:42:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:42:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:42:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:42:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:42:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:42:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:42:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:42:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:42:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:42:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:42:16,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:42:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:42:16,214 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:42:16,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:42:16,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:42:17,433 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-10-12 21:42:17,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:42:17,521 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:42:17,522 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-12 21:42:17,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:42:17 BoogieIcfgContainer [2024-10-12 21:42:17,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:42:17,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:42:17,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:42:17,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:42:17,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:42:15" (1/3) ... [2024-10-12 21:42:17,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98c7a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:42:17, skipping insertion in model container [2024-10-12 21:42:17,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:15" (2/3) ... [2024-10-12 21:42:17,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98c7a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:42:17, skipping insertion in model container [2024-10-12 21:42:17,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:42:17" (3/3) ... [2024-10-12 21:42:17,532 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.13.cil-2.c [2024-10-12 21:42:17,548 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:42:17,548 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:42:17,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:42:17,634 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;@7665f799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:42:17,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:42:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 389 states have (on average 1.7275064267352185) internal successors, (672), 394 states have internal predecessors, (672), 33 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-12 21:42:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:42:17,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:17,658 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-12 21:42:17,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -995552835, now seen corresponding path program 1 times [2024-10-12 21:42:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790379681] [2024-10-12 21:42:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,006 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-12 21:42:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790379681] [2024-10-12 21:42:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790379681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895444508] [2024-10-12 21:42:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:18,041 INFO L87 Difference]: Start difference. First operand has 434 states, 389 states have (on average 1.7275064267352185) internal successors, (672), 394 states have internal predecessors, (672), 33 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:42:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:18,944 INFO L93 Difference]: Finished difference Result 853 states and 1444 transitions. [2024-10-12 21:42:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:18,946 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), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-12 21:42:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:18,968 INFO L225 Difference]: With dead ends: 853 [2024-10-12 21:42:18,968 INFO L226 Difference]: Without dead ends: 437 [2024-10-12 21:42:18,974 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-12 21:42:18,977 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 381 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:18,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 942 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:42:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-12 21:42:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2024-10-12 21:42:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 386 states have (on average 1.616580310880829) internal successors, (624), 389 states have internal predecessors, (624), 33 states have call successors, (33), 9 states have call predecessors, (33), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-12 21:42:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 688 transitions. [2024-10-12 21:42:19,048 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 688 transitions. Word has length 37 [2024-10-12 21:42:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 688 transitions. [2024-10-12 21:42:19,049 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), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:42:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 688 transitions. [2024-10-12 21:42:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:42:19,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:19,051 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-12 21:42:19,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:42:19,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:19,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1248430463, now seen corresponding path program 1 times [2024-10-12 21:42:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961242413] [2024-10-12 21:42:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,168 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-12 21:42:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961242413] [2024-10-12 21:42:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961242413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:19,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468010446] [2024-10-12 21:42:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:19,175 INFO L87 Difference]: Start difference. First operand 429 states and 688 transitions. 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-12 21:42:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:19,798 INFO L93 Difference]: Finished difference Result 548 states and 860 transitions. [2024-10-12 21:42:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:19,799 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-12 21:42:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:19,803 INFO L225 Difference]: With dead ends: 548 [2024-10-12 21:42:19,803 INFO L226 Difference]: Without dead ends: 492 [2024-10-12 21:42:19,804 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-12 21:42:19,805 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 937 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:19,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 723 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:42:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-12 21:42:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 486. [2024-10-12 21:42:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 436 states have (on average 1.5894495412844036) internal successors, (693), 440 states have internal predecessors, (693), 37 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2024-10-12 21:42:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 771 transitions. [2024-10-12 21:42:19,859 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 771 transitions. Word has length 37 [2024-10-12 21:42:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:19,859 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 771 transitions. [2024-10-12 21:42:19,859 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-12 21:42:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 771 transitions. [2024-10-12 21:42:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:42:19,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:19,863 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-12 21:42:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:42:19,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -987178231, now seen corresponding path program 1 times [2024-10-12 21:42:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147473962] [2024-10-12 21:42:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:19,979 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-12 21:42:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147473962] [2024-10-12 21:42:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147473962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758408872] [2024-10-12 21:42:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:19,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:19,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:19,985 INFO L87 Difference]: Start difference. First operand 486 states and 771 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-12 21:42:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:20,566 INFO L93 Difference]: Finished difference Result 720 states and 1115 transitions. [2024-10-12 21:42:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:20,566 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-12 21:42:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:20,572 INFO L225 Difference]: With dead ends: 720 [2024-10-12 21:42:20,572 INFO L226 Difference]: Without dead ends: 609 [2024-10-12 21:42:20,574 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-12 21:42:20,576 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 955 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:20,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 730 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:42:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-12 21:42:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 586. [2024-10-12 21:42:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 523 states have (on average 1.5506692160611855) internal successors, (811), 528 states have internal predecessors, (811), 45 states have call successors, (45), 15 states have call predecessors, (45), 16 states have return successors, (55), 43 states have call predecessors, (55), 43 states have call successors, (55) [2024-10-12 21:42:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 911 transitions. [2024-10-12 21:42:20,617 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 911 transitions. Word has length 38 [2024-10-12 21:42:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:20,617 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 911 transitions. [2024-10-12 21:42:20,617 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-12 21:42:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 911 transitions. [2024-10-12 21:42:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:42:20,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:20,639 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-12 21:42:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:42:20,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:20,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2057625110, now seen corresponding path program 1 times [2024-10-12 21:42:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612033544] [2024-10-12 21:42:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:42:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,709 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-12 21:42:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612033544] [2024-10-12 21:42:20,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612033544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:20,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352990986] [2024-10-12 21:42:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:20,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:20,713 INFO L87 Difference]: Start difference. First operand 586 states and 911 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-12 21:42:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:21,379 INFO L93 Difference]: Finished difference Result 1006 states and 1492 transitions. [2024-10-12 21:42:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:21,381 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-12 21:42:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:21,388 INFO L225 Difference]: With dead ends: 1006 [2024-10-12 21:42:21,388 INFO L226 Difference]: Without dead ends: 795 [2024-10-12 21:42:21,391 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-12 21:42:21,392 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 364 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:21,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1037 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:42:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-12 21:42:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 691. [2024-10-12 21:42:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 616 states have (on average 1.525974025974026) internal successors, (940), 623 states have internal predecessors, (940), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (61), 47 states have call predecessors, (61), 49 states have call successors, (61) [2024-10-12 21:42:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1052 transitions. [2024-10-12 21:42:21,439 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1052 transitions. Word has length 39 [2024-10-12 21:42:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1052 transitions. [2024-10-12 21:42:21,440 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-12 21:42:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1052 transitions. [2024-10-12 21:42:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:42:21,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:21,442 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-12 21:42:21,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:42:21,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -961012926, now seen corresponding path program 1 times [2024-10-12 21:42:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320692619] [2024-10-12 21:42:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:42:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,543 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-12 21:42:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320692619] [2024-10-12 21:42:21,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320692619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:21,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:21,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694490915] [2024-10-12 21:42:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:21,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:21,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:21,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:21,546 INFO L87 Difference]: Start difference. First operand 691 states and 1052 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-12 21:42:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:22,214 INFO L93 Difference]: Finished difference Result 996 states and 1474 transitions. [2024-10-12 21:42:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:22,214 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-12 21:42:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:22,221 INFO L225 Difference]: With dead ends: 996 [2024-10-12 21:42:22,221 INFO L226 Difference]: Without dead ends: 785 [2024-10-12 21:42:22,223 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-12 21:42:22,224 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 349 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:22,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1082 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:42:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-12 21:42:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2024-10-12 21:42:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 667 states have (on average 1.5007496251874064) internal successors, (1001), 675 states have internal predecessors, (1001), 56 states have call successors, (56), 24 states have call predecessors, (56), 26 states have return successors, (70), 52 states have call predecessors, (70), 54 states have call successors, (70) [2024-10-12 21:42:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1127 transitions. [2024-10-12 21:42:22,268 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1127 transitions. Word has length 54 [2024-10-12 21:42:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:22,268 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1127 transitions. [2024-10-12 21:42:22,269 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-12 21:42:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1127 transitions. [2024-10-12 21:42:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:42:22,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:22,270 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-12 21:42:22,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:42:22,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:22,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -691278202, now seen corresponding path program 1 times [2024-10-12 21:42:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270295140] [2024-10-12 21:42:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:42:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,323 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-12 21:42:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270295140] [2024-10-12 21:42:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270295140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445127201] [2024-10-12 21:42:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:22,326 INFO L87 Difference]: Start difference. First operand 751 states and 1127 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-12 21:42:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:22,879 INFO L93 Difference]: Finished difference Result 1240 states and 1787 transitions. [2024-10-12 21:42:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:22,879 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-12 21:42:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:22,884 INFO L225 Difference]: With dead ends: 1240 [2024-10-12 21:42:22,884 INFO L226 Difference]: Without dead ends: 905 [2024-10-12 21:42:22,885 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-12 21:42:22,887 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 941 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:22,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 742 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:42:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-12 21:42:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 856. [2024-10-12 21:42:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 759 states have (on average 1.4677206851119895) internal successors, (1114), 768 states have internal predecessors, (1114), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-10-12 21:42:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1258 transitions. [2024-10-12 21:42:22,928 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1258 transitions. Word has length 59 [2024-10-12 21:42:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:22,928 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1258 transitions. [2024-10-12 21:42:22,928 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-12 21:42:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1258 transitions. [2024-10-12 21:42:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:22,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:22,930 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-12 21:42:22,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:42:22,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash -286134322, now seen corresponding path program 1 times [2024-10-12 21:42:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:22,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766344830] [2024-10-12 21:42:22,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,036 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-12 21:42:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766344830] [2024-10-12 21:42:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766344830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780618428] [2024-10-12 21:42:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:23,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:23,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:23,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:42:23,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:42:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:42:23,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:23,194 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-12 21:42:23,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780618428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:42:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782473730] [2024-10-12 21:42:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:23,202 INFO L87 Difference]: Start difference. First operand 856 states and 1258 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-12 21:42:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:23,349 INFO L93 Difference]: Finished difference Result 1259 states and 1818 transitions. [2024-10-12 21:42:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:42:23,349 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-12 21:42:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:23,353 INFO L225 Difference]: With dead ends: 1259 [2024-10-12 21:42:23,354 INFO L226 Difference]: Without dead ends: 864 [2024-10-12 21:42:23,355 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-12 21:42:23,356 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 0 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:23,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1894 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-12 21:42:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-10-12 21:42:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 767 states have (on average 1.455019556714472) internal successors, (1116), 776 states have internal predecessors, (1116), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-10-12 21:42:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1260 transitions. [2024-10-12 21:42:23,409 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1260 transitions. Word has length 60 [2024-10-12 21:42:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1260 transitions. [2024-10-12 21:42:23,410 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-12 21:42:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1260 transitions. [2024-10-12 21:42:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:23,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:23,412 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-12 21:42:23,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:42:23,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:23,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1130139824, now seen corresponding path program 1 times [2024-10-12 21:42:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456185710] [2024-10-12 21:42:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,689 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-12 21:42:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:23,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456185710] [2024-10-12 21:42:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456185710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:23,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795305355] [2024-10-12 21:42:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:23,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:23,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:42:23,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:42:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:23,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:42:23,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:23,824 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-12 21:42:23,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:23,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795305355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:42:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558897034] [2024-10-12 21:42:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:23,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:23,828 INFO L87 Difference]: Start difference. First operand 864 states and 1260 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-12 21:42:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:23,975 INFO L93 Difference]: Finished difference Result 1283 states and 1831 transitions. [2024-10-12 21:42:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:42:23,976 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-12 21:42:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:23,980 INFO L225 Difference]: With dead ends: 1283 [2024-10-12 21:42:23,981 INFO L226 Difference]: Without dead ends: 880 [2024-10-12 21:42:23,982 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-12 21:42:23,984 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 0 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:23,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1894 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-12 21:42:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-12 21:42:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 783 states have (on average 1.4393358876117497) internal successors, (1127), 792 states have internal predecessors, (1127), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (80), 59 states have call predecessors, (80), 61 states have call successors, (80) [2024-10-12 21:42:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1270 transitions. [2024-10-12 21:42:24,029 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1270 transitions. Word has length 60 [2024-10-12 21:42:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:24,031 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1270 transitions. [2024-10-12 21:42:24,031 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-12 21:42:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1270 transitions. [2024-10-12 21:42:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:24,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:24,033 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-12 21:42:24,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:42:24,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 21:42:24,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 667499792, now seen corresponding path program 1 times [2024-10-12 21:42:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:24,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272568212] [2024-10-12 21:42:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,333 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-12 21:42:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272568212] [2024-10-12 21:42:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272568212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581984924] [2024-10-12 21:42:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:24,335 INFO L87 Difference]: Start difference. First operand 880 states and 1270 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-12 21:42:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:25,001 INFO L93 Difference]: Finished difference Result 965 states and 1373 transitions. [2024-10-12 21:42:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:25,002 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-12 21:42:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:25,006 INFO L225 Difference]: With dead ends: 965 [2024-10-12 21:42:25,007 INFO L226 Difference]: Without dead ends: 962 [2024-10-12 21:42:25,007 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-12 21:42:25,008 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1574 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:25,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 740 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:42:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-12 21:42:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 879. [2024-10-12 21:42:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 783 states have (on average 1.4367816091954022) internal successors, (1125), 791 states have internal predecessors, (1125), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (80), 59 states have call predecessors, (80), 61 states have call successors, (80) [2024-10-12 21:42:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1267 transitions. [2024-10-12 21:42:25,052 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1267 transitions. Word has length 60 [2024-10-12 21:42:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:25,052 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1267 transitions. [2024-10-12 21:42:25,053 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-12 21:42:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1267 transitions. [2024-10-12 21:42:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:42:25,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:25,054 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-12 21:42:25,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:42:25,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash -783822905, now seen corresponding path program 1 times [2024-10-12 21:42:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539797270] [2024-10-12 21:42:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:25,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,207 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-12 21:42:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539797270] [2024-10-12 21:42:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539797270] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199733234] [2024-10-12 21:42:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:25,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:42:25,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:42:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:42:25,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:25,582 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-12 21:42:25,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:42:25,660 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-12 21:42:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199733234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:42:25,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:42:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:42:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027109517] [2024-10-12 21:42:25,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:42:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:42:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:42:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:25,662 INFO L87 Difference]: Start difference. First operand 879 states and 1267 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-12 21:42:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:26,689 INFO L93 Difference]: Finished difference Result 1682 states and 2302 transitions. [2024-10-12 21:42:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:42:26,690 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-12 21:42:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:26,697 INFO L225 Difference]: With dead ends: 1682 [2024-10-12 21:42:26,697 INFO L226 Difference]: Without dead ends: 1679 [2024-10-12 21:42:26,698 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-12 21:42:26,698 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 1708 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:26,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1661 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:42:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-10-12 21:42:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1182. [2024-10-12 21:42:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1050 states have (on average 1.400952380952381) internal successors, (1471), 1064 states have internal predecessors, (1471), 81 states have call successors, (81), 42 states have call predecessors, (81), 49 states have return successors, (110), 76 states have call predecessors, (110), 80 states have call successors, (110) [2024-10-12 21:42:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1662 transitions. [2024-10-12 21:42:26,760 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1662 transitions. Word has length 61 [2024-10-12 21:42:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1662 transitions. [2024-10-12 21:42:26,761 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-12 21:42:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1662 transitions. [2024-10-12 21:42:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:42:26,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:26,763 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-12 21:42:26,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:42:26,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:26,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -855987006, now seen corresponding path program 2 times [2024-10-12 21:42:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:26,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095622918] [2024-10-12 21:42:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:42:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,024 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-12 21:42:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095622918] [2024-10-12 21:42:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095622918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:27,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:27,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848552603] [2024-10-12 21:42:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:27,026 INFO L87 Difference]: Start difference. First operand 1182 states and 1662 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-12 21:42:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:27,594 INFO L93 Difference]: Finished difference Result 1810 states and 2479 transitions. [2024-10-12 21:42:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:27,595 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-12 21:42:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:27,600 INFO L225 Difference]: With dead ends: 1810 [2024-10-12 21:42:27,600 INFO L226 Difference]: Without dead ends: 1151 [2024-10-12 21:42:27,601 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-12 21:42:27,602 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 955 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:27,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 759 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:42:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-10-12 21:42:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1074. [2024-10-12 21:42:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 955 states have (on average 1.406282722513089) internal successors, (1343), 969 states have internal predecessors, (1343), 74 states have call successors, (74), 37 states have call predecessors, (74), 43 states have return successors, (99), 68 states have call predecessors, (99), 73 states have call successors, (99) [2024-10-12 21:42:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1516 transitions. [2024-10-12 21:42:27,649 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1516 transitions. Word has length 78 [2024-10-12 21:42:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1516 transitions. [2024-10-12 21:42:27,650 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-12 21:42:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1516 transitions. [2024-10-12 21:42:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:42:27,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:27,652 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-12 21:42:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:42:27,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -147214036, now seen corresponding path program 1 times [2024-10-12 21:42:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417872815] [2024-10-12 21:42:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:42:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:42:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:42:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,731 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-12 21:42:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417872815] [2024-10-12 21:42:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417872815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081478378] [2024-10-12 21:42:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:27,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:42:27,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:42:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:42:27,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:27,879 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-12 21:42:27,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:27,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081478378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:27,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:27,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:42:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349228783] [2024-10-12 21:42:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:42:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:42:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:27,884 INFO L87 Difference]: Start difference. First operand 1074 states and 1516 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-12 21:42:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:28,008 INFO L93 Difference]: Finished difference Result 1357 states and 1872 transitions. [2024-10-12 21:42:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:42:28,008 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-12 21:42:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:28,011 INFO L225 Difference]: With dead ends: 1357 [2024-10-12 21:42:28,011 INFO L226 Difference]: Without dead ends: 370 [2024-10-12 21:42:28,013 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-12 21:42:28,014 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 55 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:28,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1280 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-12 21:42:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-12 21:42:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 336 states have (on average 1.6369047619047619) internal successors, (550), 337 states have internal predecessors, (550), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 604 transitions. [2024-10-12 21:42:28,030 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 604 transitions. Word has length 92 [2024-10-12 21:42:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:28,031 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 604 transitions. [2024-10-12 21:42:28,031 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-12 21:42:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 604 transitions. [2024-10-12 21:42:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:28,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:28,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:28,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:42:28,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:28,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:28,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1809885346, now seen corresponding path program 1 times [2024-10-12 21:42:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274571211] [2024-10-12 21:42:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:28,492 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-12 21:42:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274571211] [2024-10-12 21:42:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274571211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671404128] [2024-10-12 21:42:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:28,494 INFO L87 Difference]: Start difference. First operand 370 states and 604 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-12 21:42:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:30,259 INFO L93 Difference]: Finished difference Result 873 states and 1448 transitions. [2024-10-12 21:42:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:30,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:30,263 INFO L225 Difference]: With dead ends: 873 [2024-10-12 21:42:30,263 INFO L226 Difference]: Without dead ends: 510 [2024-10-12 21:42:30,264 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-12 21:42:30,265 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1046 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:30,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 663 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:42:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-12 21:42:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 370. [2024-10-12 21:42:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 336 states have (on average 1.6339285714285714) internal successors, (549), 337 states have internal predecessors, (549), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 603 transitions. [2024-10-12 21:42:30,294 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 603 transitions. Word has length 171 [2024-10-12 21:42:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:30,294 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 603 transitions. [2024-10-12 21:42:30,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-12 21:42:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 603 transitions. [2024-10-12 21:42:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:30,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:30,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:30,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:42:30,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1986525148, now seen corresponding path program 1 times [2024-10-12 21:42:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247421857] [2024-10-12 21:42:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,521 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-12 21:42:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247421857] [2024-10-12 21:42:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247421857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625568818] [2024-10-12 21:42:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:30,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:30,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:30,523 INFO L87 Difference]: Start difference. First operand 370 states and 603 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-12 21:42:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:32,145 INFO L93 Difference]: Finished difference Result 865 states and 1431 transitions. [2024-10-12 21:42:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:32,149 INFO L225 Difference]: With dead ends: 865 [2024-10-12 21:42:32,149 INFO L226 Difference]: Without dead ends: 510 [2024-10-12 21:42:32,150 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-12 21:42:32,150 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1037 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:32,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 661 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:42:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-12 21:42:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 370. [2024-10-12 21:42:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 336 states have (on average 1.630952380952381) internal successors, (548), 337 states have internal predecessors, (548), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 602 transitions. [2024-10-12 21:42:32,173 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 602 transitions. Word has length 171 [2024-10-12 21:42:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:32,174 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 602 transitions. [2024-10-12 21:42:32,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-12 21:42:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 602 transitions. [2024-10-12 21:42:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:32,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:32,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:32,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:42:32,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -538970534, now seen corresponding path program 1 times [2024-10-12 21:42:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25116837] [2024-10-12 21:42:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,464 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-12 21:42:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25116837] [2024-10-12 21:42:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25116837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:42:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191735568] [2024-10-12 21:42:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:42:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:42:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:32,467 INFO L87 Difference]: Start difference. First operand 370 states and 602 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-12 21:42:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:35,178 INFO L93 Difference]: Finished difference Result 1371 states and 2282 transitions. [2024-10-12 21:42:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:42:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:35,183 INFO L225 Difference]: With dead ends: 1371 [2024-10-12 21:42:35,183 INFO L226 Difference]: Without dead ends: 1021 [2024-10-12 21:42:35,184 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-12 21:42:35,185 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1585 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:35,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 1284 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:42:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-12 21:42:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 742. [2024-10-12 21:42:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 679 states have (on average 1.642120765832106) internal successors, (1115), 681 states have internal predecessors, (1115), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-12 21:42:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1216 transitions. [2024-10-12 21:42:35,236 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1216 transitions. Word has length 171 [2024-10-12 21:42:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:35,236 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1216 transitions. [2024-10-12 21:42:35,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-12 21:42:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1216 transitions. [2024-10-12 21:42:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:35,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:35,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:42:35,239 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash 740378206, now seen corresponding path program 1 times [2024-10-12 21:42:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065135614] [2024-10-12 21:42:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:35,566 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-12 21:42:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065135614] [2024-10-12 21:42:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065135614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138511022] [2024-10-12 21:42:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:35,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:35,569 INFO L87 Difference]: Start difference. First operand 742 states and 1216 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:39,321 INFO L93 Difference]: Finished difference Result 2276 states and 3792 transitions. [2024-10-12 21:42:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:39,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:39,329 INFO L225 Difference]: With dead ends: 2276 [2024-10-12 21:42:39,329 INFO L226 Difference]: Without dead ends: 1554 [2024-10-12 21:42:39,331 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-12 21:42:39,332 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 1636 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 4053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:39,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2127 Invalid, 4053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 21:42:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2024-10-12 21:42:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1085. [2024-10-12 21:42:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 993 states have (on average 1.635448136958711) internal successors, (1624), 996 states have internal predecessors, (1624), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:42:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1771 transitions. [2024-10-12 21:42:39,406 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1771 transitions. Word has length 171 [2024-10-12 21:42:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:39,407 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1771 transitions. [2024-10-12 21:42:39,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1771 transitions. [2024-10-12 21:42:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:39,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:39,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:39,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:42:39,409 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:39,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 475730716, now seen corresponding path program 1 times [2024-10-12 21:42:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889135037] [2024-10-12 21:42:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:39,766 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-12 21:42:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889135037] [2024-10-12 21:42:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889135037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914720070] [2024-10-12 21:42:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:39,770 INFO L87 Difference]: Start difference. First operand 1085 states and 1771 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:41,572 INFO L93 Difference]: Finished difference Result 2639 states and 4393 transitions. [2024-10-12 21:42:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:41,580 INFO L225 Difference]: With dead ends: 2639 [2024-10-12 21:42:41,580 INFO L226 Difference]: Without dead ends: 1574 [2024-10-12 21:42:41,583 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-12 21:42:41,584 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1321 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:41,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 922 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:42:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-10-12 21:42:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1085. [2024-10-12 21:42:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 993 states have (on average 1.6324269889224572) internal successors, (1621), 996 states have internal predecessors, (1621), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:42:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1768 transitions. [2024-10-12 21:42:41,665 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1768 transitions. Word has length 171 [2024-10-12 21:42:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:41,666 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1768 transitions. [2024-10-12 21:42:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1768 transitions. [2024-10-12 21:42:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:41,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:41,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:42:41,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash -847448230, now seen corresponding path program 1 times [2024-10-12 21:42:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139591514] [2024-10-12 21:42:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,963 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-12 21:42:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139591514] [2024-10-12 21:42:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139591514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823633028] [2024-10-12 21:42:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:41,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:41,966 INFO L87 Difference]: Start difference. First operand 1085 states and 1768 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:43,625 INFO L93 Difference]: Finished difference Result 2635 states and 4376 transitions. [2024-10-12 21:42:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:43,632 INFO L225 Difference]: With dead ends: 2635 [2024-10-12 21:42:43,632 INFO L226 Difference]: Without dead ends: 1570 [2024-10-12 21:42:43,635 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-12 21:42:43,635 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1319 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:43,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 922 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:42:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-12 21:42:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1085. [2024-10-12 21:42:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 993 states have (on average 1.6294058408862033) internal successors, (1618), 996 states have internal predecessors, (1618), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:42:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1765 transitions. [2024-10-12 21:42:43,740 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1765 transitions. Word has length 171 [2024-10-12 21:42:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:43,740 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1765 transitions. [2024-10-12 21:42:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1765 transitions. [2024-10-12 21:42:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:43,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:43,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:43,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:42:43,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1049531228, now seen corresponding path program 1 times [2024-10-12 21:42:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466619562] [2024-10-12 21:42:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,006 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-12 21:42:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466619562] [2024-10-12 21:42:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466619562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674061012] [2024-10-12 21:42:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:44,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:44,009 INFO L87 Difference]: Start difference. First operand 1085 states and 1765 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:45,812 INFO L93 Difference]: Finished difference Result 2631 states and 4359 transitions. [2024-10-12 21:42:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:45,820 INFO L225 Difference]: With dead ends: 2631 [2024-10-12 21:42:45,821 INFO L226 Difference]: Without dead ends: 1566 [2024-10-12 21:42:45,823 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-12 21:42:45,824 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1154 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:45,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1095 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:42:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-12 21:42:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1085. [2024-10-12 21:42:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 993 states have (on average 1.6263846928499497) internal successors, (1615), 996 states have internal predecessors, (1615), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:42:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1762 transitions. [2024-10-12 21:42:45,924 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1762 transitions. Word has length 171 [2024-10-12 21:42:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:45,924 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1762 transitions. [2024-10-12 21:42:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1762 transitions. [2024-10-12 21:42:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:45,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:45,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:45,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:42:45,927 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1387818778, now seen corresponding path program 1 times [2024-10-12 21:42:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587769454] [2024-10-12 21:42:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:46,209 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-12 21:42:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587769454] [2024-10-12 21:42:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587769454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653532438] [2024-10-12 21:42:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:46,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:46,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:46,213 INFO L87 Difference]: Start difference. First operand 1085 states and 1762 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:49,956 INFO L93 Difference]: Finished difference Result 3589 states and 5923 transitions. [2024-10-12 21:42:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:49,966 INFO L225 Difference]: With dead ends: 3589 [2024-10-12 21:42:49,966 INFO L226 Difference]: Without dead ends: 2524 [2024-10-12 21:42:49,972 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-12 21:42:49,972 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1607 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:49,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 2125 Invalid, 3966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:42:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2024-10-12 21:42:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 1784. [2024-10-12 21:42:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1634 states have (on average 1.6193390452876377) internal successors, (2646), 1639 states have internal predecessors, (2646), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:42:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2889 transitions. [2024-10-12 21:42:50,127 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2889 transitions. Word has length 171 [2024-10-12 21:42:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:50,127 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2889 transitions. [2024-10-12 21:42:50,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2889 transitions. [2024-10-12 21:42:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:50,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:50,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:50,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:42:50,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1814373276, now seen corresponding path program 1 times [2024-10-12 21:42:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815690959] [2024-10-12 21:42:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:50,395 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-12 21:42:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815690959] [2024-10-12 21:42:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815690959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272199152] [2024-10-12 21:42:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:50,398 INFO L87 Difference]: Start difference. First operand 1784 states and 2889 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:52,070 INFO L93 Difference]: Finished difference Result 4275 states and 7038 transitions. [2024-10-12 21:42:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:52,082 INFO L225 Difference]: With dead ends: 4275 [2024-10-12 21:42:52,082 INFO L226 Difference]: Without dead ends: 2511 [2024-10-12 21:42:52,086 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-12 21:42:52,087 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1316 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:52,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 922 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-10-12 21:42:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 1784. [2024-10-12 21:42:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1634 states have (on average 1.6162790697674418) internal successors, (2641), 1639 states have internal predecessors, (2641), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:42:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2884 transitions. [2024-10-12 21:42:52,236 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2884 transitions. Word has length 171 [2024-10-12 21:42:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2884 transitions. [2024-10-12 21:42:52,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2884 transitions. [2024-10-12 21:42:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:52,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:52,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:52,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:42:52,239 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1273943770, now seen corresponding path program 1 times [2024-10-12 21:42:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481128258] [2024-10-12 21:42:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,540 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-12 21:42:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481128258] [2024-10-12 21:42:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481128258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182021521] [2024-10-12 21:42:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:52,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:52,544 INFO L87 Difference]: Start difference. First operand 1784 states and 2884 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:56,334 INFO L93 Difference]: Finished difference Result 6130 states and 10050 transitions. [2024-10-12 21:42:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:42:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:56,353 INFO L225 Difference]: With dead ends: 6130 [2024-10-12 21:42:56,353 INFO L226 Difference]: Without dead ends: 4366 [2024-10-12 21:42:56,358 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-12 21:42:56,359 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1599 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:56,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 2125 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:42:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2024-10-12 21:42:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 3182. [2024-10-12 21:42:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2916 states have (on average 1.6093964334705075) internal successors, (4693), 2925 states have internal predecessors, (4693), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 21:42:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 5134 transitions. [2024-10-12 21:42:56,646 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 5134 transitions. Word has length 171 [2024-10-12 21:42:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 5134 transitions. [2024-10-12 21:42:56,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:42:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 5134 transitions. [2024-10-12 21:42:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:42:56,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:56,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:42:56,650 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1117963228, now seen corresponding path program 1 times [2024-10-12 21:42:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006747341] [2024-10-12 21:42:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,925 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-12 21:42:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006747341] [2024-10-12 21:42:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006747341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998355778] [2024-10-12 21:42:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:56,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:56,928 INFO L87 Difference]: Start difference. First operand 3182 states and 5134 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:00,947 INFO L93 Difference]: Finished difference Result 11218 states and 18358 transitions. [2024-10-12 21:43:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:43:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:00,980 INFO L225 Difference]: With dead ends: 11218 [2024-10-12 21:43:00,980 INFO L226 Difference]: Without dead ends: 8056 [2024-10-12 21:43:00,990 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-12 21:43:00,991 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1604 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:00,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2125 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:43:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2024-10-12 21:43:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 5983. [2024-10-12 21:43:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5485 states have (on average 1.604922515952598) internal successors, (8803), 5502 states have internal predecessors, (8803), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:43:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 9658 transitions. [2024-10-12 21:43:01,548 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 9658 transitions. Word has length 171 [2024-10-12 21:43:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 9658 transitions. [2024-10-12 21:43:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 9658 transitions. [2024-10-12 21:43:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:43:01,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:01,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:01,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:43:01,555 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:01,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1528573594, now seen corresponding path program 1 times [2024-10-12 21:43:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294667215] [2024-10-12 21:43:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:01,895 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-12 21:43:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294667215] [2024-10-12 21:43:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294667215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315512079] [2024-10-12 21:43:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:01,898 INFO L87 Difference]: Start difference. First operand 5983 states and 9658 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:04,008 INFO L93 Difference]: Finished difference Result 14093 states and 23099 transitions. [2024-10-12 21:43:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:43:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:04,037 INFO L225 Difference]: With dead ends: 14093 [2024-10-12 21:43:04,037 INFO L226 Difference]: Without dead ends: 8130 [2024-10-12 21:43:04,052 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-12 21:43:04,053 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1157 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:04,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1095 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:43:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2024-10-12 21:43:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 5983. [2024-10-12 21:43:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5485 states have (on average 1.6018231540565178) internal successors, (8786), 5502 states have internal predecessors, (8786), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:43:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 9641 transitions. [2024-10-12 21:43:04,653 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 9641 transitions. Word has length 171 [2024-10-12 21:43:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:04,654 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 9641 transitions. [2024-10-12 21:43:04,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 9641 transitions. [2024-10-12 21:43:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:43:04,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:04,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:04,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:43:04,661 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash -607309608, now seen corresponding path program 1 times [2024-10-12 21:43:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627525587] [2024-10-12 21:43:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,958 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-12 21:43:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627525587] [2024-10-12 21:43:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627525587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330246124] [2024-10-12 21:43:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:04,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:04,960 INFO L87 Difference]: Start difference. First operand 5983 states and 9641 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:06,914 INFO L93 Difference]: Finished difference Result 14075 states and 23012 transitions. [2024-10-12 21:43:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:43:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:06,943 INFO L225 Difference]: With dead ends: 14075 [2024-10-12 21:43:06,943 INFO L226 Difference]: Without dead ends: 8112 [2024-10-12 21:43:06,959 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-12 21:43:06,960 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1318 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:06,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 922 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:43:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8112 states. [2024-10-12 21:43:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8112 to 5983. [2024-10-12 21:43:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5485 states have (on average 1.5987237921604376) internal successors, (8769), 5502 states have internal predecessors, (8769), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:43:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 9624 transitions. [2024-10-12 21:43:07,480 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 9624 transitions. Word has length 171 [2024-10-12 21:43:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 9624 transitions. [2024-10-12 21:43:07,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 9624 transitions. [2024-10-12 21:43:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:43:07,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:07,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:43:07,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:07,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash -537661734, now seen corresponding path program 1 times [2024-10-12 21:43:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589665408] [2024-10-12 21:43:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:07,736 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-12 21:43:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589665408] [2024-10-12 21:43:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589665408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242161908] [2024-10-12 21:43:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:07,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:07,739 INFO L87 Difference]: Start difference. First operand 5983 states and 9624 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:12,327 INFO L93 Difference]: Finished difference Result 21339 states and 34756 transitions. [2024-10-12 21:43:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:43:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:12,379 INFO L225 Difference]: With dead ends: 21339 [2024-10-12 21:43:12,379 INFO L226 Difference]: Without dead ends: 15376 [2024-10-12 21:43:12,400 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-12 21:43:12,401 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1585 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:12,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 2125 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:43:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15376 states. [2024-10-12 21:43:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15376 to 11651. [2024-10-12 21:43:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11651 states, 10689 states have (on average 1.5950042099354476) internal successors, (17049), 10722 states have internal predecessors, (17049), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-12 21:43:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11651 states to 11651 states and 18786 transitions. [2024-10-12 21:43:13,333 INFO L78 Accepts]: Start accepts. Automaton has 11651 states and 18786 transitions. Word has length 171 [2024-10-12 21:43:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 11651 states and 18786 transitions. [2024-10-12 21:43:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 11651 states and 18786 transitions. [2024-10-12 21:43:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:43:13,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:13,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:43:13,344 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -119773032, now seen corresponding path program 1 times [2024-10-12 21:43:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377145030] [2024-10-12 21:43:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:13,677 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-12 21:43:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377145030] [2024-10-12 21:43:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377145030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566669581] [2024-10-12 21:43:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:13,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:13,680 INFO L87 Difference]: Start difference. First operand 11651 states and 18786 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:19,869 INFO L93 Difference]: Finished difference Result 46941 states and 76658 transitions. [2024-10-12 21:43:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:43:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-12 21:43:19,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:20,087 INFO L225 Difference]: With dead ends: 46941 [2024-10-12 21:43:20,087 INFO L226 Difference]: Without dead ends: 35310 [2024-10-12 21:43:20,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:43:20,135 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 1703 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 4515 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 4582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:20,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 2118 Invalid, 4582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4515 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 21:43:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35310 states. [2024-10-12 21:43:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35310 to 22948. [2024-10-12 21:43:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22948 states, 21090 states have (on average 1.5936936936936936) internal successors, (33611), 21155 states have internal predecessors, (33611), 1403 states have call successors, (1403), 390 states have call predecessors, (1403), 454 states have return successors, (2196), 1466 states have call predecessors, (2196), 1403 states have call successors, (2196) [2024-10-12 21:43:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22948 states to 22948 states and 37210 transitions. [2024-10-12 21:43:22,194 INFO L78 Accepts]: Start accepts. Automaton has 22948 states and 37210 transitions. Word has length 171 [2024-10-12 21:43:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 22948 states and 37210 transitions. [2024-10-12 21:43:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-12 21:43:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22948 states and 37210 transitions. [2024-10-12 21:43:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 21:43:22,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:22,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:43:22,209 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:22,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1279180570, now seen corresponding path program 1 times [2024-10-12 21:43:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172373793] [2024-10-12 21:43:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:22,465 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-12 21:43:22,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172373793] [2024-10-12 21:43:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172373793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:22,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673805343] [2024-10-12 21:43:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:22,468 INFO L87 Difference]: Start difference. First operand 22948 states and 37210 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)