./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.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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.01.cil-1.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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:05:13,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:05:14,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:05:14,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:05:14,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:05:14,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:05:14,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:05:14,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:05:14,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:05:14,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:05:14,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:05:14,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:05:14,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:05:14,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:05:14,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:05:14,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:05:14,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:05:14,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:05:14,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:05:14,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:05:14,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:05:14,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:05:14,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:05:14,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:05:14,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:05:14,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:05:14,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:05:14,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:05:14,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:05:14,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:05:14,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:05:14,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:05:14,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:05:14,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:05:14,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:05:14,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:05:14,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:05:14,063 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2024-11-20 00:05:14,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:05:14,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:05:14,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:05:14,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:05:14,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:05:14,281 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.01.cil-1.c [2024-11-20 00:05:15,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:05:15,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:05:15,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-11-20 00:05:15,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedf120c4/b186e01a0aa94e70b613bfc0f00f138c/FLAGadd5d7fc2 [2024-11-20 00:05:15,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedf120c4/b186e01a0aa94e70b613bfc0f00f138c [2024-11-20 00:05:15,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:05:15,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:05:15,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:05:15,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:05:15,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:05:15,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:15" (1/1) ... [2024-11-20 00:05:15,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bbaea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:15, skipping insertion in model container [2024-11-20 00:05:15,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:15" (1/1) ... [2024-11-20 00:05:15,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:05:15,980 WARN L250 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.01.cil-1.c[913,926] [2024-11-20 00:05:16,027 WARN L250 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.01.cil-1.c[5977,5990] [2024-11-20 00:05:16,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:05:16,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:05:16,087 WARN L250 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.01.cil-1.c[913,926] [2024-11-20 00:05:16,105 WARN L250 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.01.cil-1.c[5977,5990] [2024-11-20 00:05:16,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:05:16,140 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:05:16,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16 WrapperNode [2024-11-20 00:05:16,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:05:16,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:05:16,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:05:16,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:05:16,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,183 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 423 [2024-11-20 00:05:16,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:05:16,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:05:16,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:05:16,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:05:16,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,211 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-11-20 00:05:16,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:05:16,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:05:16,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:05:16,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:05:16,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (1/1) ... [2024-11-20 00:05:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:05:16,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:16,259 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-11-20 00:05:16,263 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-11-20 00:05:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:05:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:05:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:05:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-20 00:05:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-20 00:05:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:05:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:05:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:05:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:05:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:05:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:05:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:05:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:05:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:05:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:05:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:05:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:05:16,299 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:05:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:05:16,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:05:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:05:16,299 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:05:16,366 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:05:16,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:05:16,696 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-20 00:05:16,696 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:05:16,707 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:05:16,707 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 00:05:16,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:05:16 BoogieIcfgContainer [2024-11-20 00:05:16,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:05:16,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:05:16,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:05:16,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:05:16,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:05:15" (1/3) ... [2024-11-20 00:05:16,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e81f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:05:16, skipping insertion in model container [2024-11-20 00:05:16,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:16" (2/3) ... [2024-11-20 00:05:16,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e81f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:05:16, skipping insertion in model container [2024-11-20 00:05:16,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:05:16" (3/3) ... [2024-11-20 00:05:16,714 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-11-20 00:05:16,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:05:16,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:05:16,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:05:16,782 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;@10cbfe22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:05:16,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:05:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 00:05:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 00:05:16,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:16,796 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] [2024-11-20 00:05:16,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:16,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 730224026, now seen corresponding path program 1 times [2024-11-20 00:05:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405365200] [2024-11-20 00:05:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-20 00:05:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405365200] [2024-11-20 00:05:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405365200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:05:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766502635] [2024-11-20 00:05:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:17,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:05:17,116 INFO L87 Difference]: Start difference. First operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-20 00:05:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:17,454 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2024-11-20 00:05:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2024-11-20 00:05:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:17,467 INFO L225 Difference]: With dead ends: 418 [2024-11-20 00:05:17,468 INFO L226 Difference]: Without dead ends: 241 [2024-11-20 00:05:17,471 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-11-20 00:05:17,474 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 285 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:17,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 419 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:05:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-20 00:05:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-11-20 00:05:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 197 states have (on average 1.401015228426396) internal successors, (276), 201 states have internal predecessors, (276), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2024-11-20 00:05:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 330 transitions. [2024-11-20 00:05:17,571 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 330 transitions. Word has length 44 [2024-11-20 00:05:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:17,573 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 330 transitions. [2024-11-20 00:05:17,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-20 00:05:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2024-11-20 00:05:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:05:17,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:17,579 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] [2024-11-20 00:05:17,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:05:17,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:17,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2090661330, now seen corresponding path program 1 times [2024-11-20 00:05:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980005183] [2024-11-20 00:05:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:05:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:17,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980005183] [2024-11-20 00:05:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980005183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:17,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:05:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494066548] [2024-11-20 00:05:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:05:17,705 INFO L87 Difference]: Start difference. First operand 235 states and 330 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-20 00:05:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:17,938 INFO L93 Difference]: Finished difference Result 483 states and 670 transitions. [2024-11-20 00:05:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-20 00:05:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:17,941 INFO L225 Difference]: With dead ends: 483 [2024-11-20 00:05:17,942 INFO L226 Difference]: Without dead ends: 359 [2024-11-20 00:05:17,945 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-11-20 00:05:17,946 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 149 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:17,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 520 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:05:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-20 00:05:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 302. [2024-11-20 00:05:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 262 states have internal predecessors, (360), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-20 00:05:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2024-11-20 00:05:17,987 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 45 [2024-11-20 00:05:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:17,987 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2024-11-20 00:05:17,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-20 00:05:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2024-11-20 00:05:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 00:05:17,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:17,992 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] [2024-11-20 00:05:17,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:05:17,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash 806303869, now seen corresponding path program 1 times [2024-11-20 00:05:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127951407] [2024-11-20 00:05:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 00:05:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127951407] [2024-11-20 00:05:18,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127951407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:18,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:05:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097368505] [2024-11-20 00:05:18,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:18,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:18,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:05:18,089 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-20 00:05:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:18,291 INFO L93 Difference]: Finished difference Result 710 states and 979 transitions. [2024-11-20 00:05:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-20 00:05:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:18,294 INFO L225 Difference]: With dead ends: 710 [2024-11-20 00:05:18,294 INFO L226 Difference]: Without dead ends: 519 [2024-11-20 00:05:18,296 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-11-20 00:05:18,296 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 295 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:18,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:05:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-20 00:05:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 467. [2024-11-20 00:05:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 404 states have (on average 1.3613861386138615) internal successors, (550), 411 states have internal predecessors, (550), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-20 00:05:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 638 transitions. [2024-11-20 00:05:18,330 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 638 transitions. Word has length 45 [2024-11-20 00:05:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:18,330 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 638 transitions. [2024-11-20 00:05:18,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-20 00:05:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 638 transitions. [2024-11-20 00:05:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:18,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:18,335 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] [2024-11-20 00:05:18,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:05:18,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash -737201202, now seen corresponding path program 1 times [2024-11-20 00:05:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066270929] [2024-11-20 00:05:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:18,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066270929] [2024-11-20 00:05:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066270929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:18,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:05:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722764141] [2024-11-20 00:05:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:18,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:05:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:05:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:05:18,438 INFO L87 Difference]: Start difference. First operand 467 states and 638 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 00:05:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:18,796 INFO L93 Difference]: Finished difference Result 586 states and 812 transitions. [2024-11-20 00:05:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:05:18,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:18,802 INFO L225 Difference]: With dead ends: 586 [2024-11-20 00:05:18,802 INFO L226 Difference]: Without dead ends: 488 [2024-11-20 00:05:18,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:18,807 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 269 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:18,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 442 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-20 00:05:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 467. [2024-11-20 00:05:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 404 states have (on average 1.358910891089109) internal successors, (549), 411 states have internal predecessors, (549), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-20 00:05:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 637 transitions. [2024-11-20 00:05:18,842 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 637 transitions. Word has length 57 [2024-11-20 00:05:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 637 transitions. [2024-11-20 00:05:18,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 00:05:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 637 transitions. [2024-11-20 00:05:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:18,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:18,847 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] [2024-11-20 00:05:18,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:05:18,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -721682484, now seen corresponding path program 1 times [2024-11-20 00:05:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950133255] [2024-11-20 00:05:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950133255] [2024-11-20 00:05:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950133255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:18,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:05:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777143951] [2024-11-20 00:05:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:05:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:05:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:05:18,996 INFO L87 Difference]: Start difference. First operand 467 states and 637 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-20 00:05:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:19,549 INFO L93 Difference]: Finished difference Result 695 states and 968 transitions. [2024-11-20 00:05:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:05:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:19,554 INFO L225 Difference]: With dead ends: 695 [2024-11-20 00:05:19,556 INFO L226 Difference]: Without dead ends: 600 [2024-11-20 00:05:19,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:19,562 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 444 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:19,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 598 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:05:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-20 00:05:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 559. [2024-11-20 00:05:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 479 states have (on average 1.3695198329853862) internal successors, (656), 487 states have internal predecessors, (656), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2024-11-20 00:05:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 767 transitions. [2024-11-20 00:05:19,608 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 767 transitions. Word has length 57 [2024-11-20 00:05:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:19,609 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 767 transitions. [2024-11-20 00:05:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-20 00:05:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 767 transitions. [2024-11-20 00:05:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:19,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:19,611 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] [2024-11-20 00:05:19,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:05:19,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:19,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1633634480, now seen corresponding path program 1 times [2024-11-20 00:05:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043728904] [2024-11-20 00:05:19,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043728904] [2024-11-20 00:05:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043728904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782643512] [2024-11-20 00:05:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:19,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:19,732 INFO L87 Difference]: Start difference. First operand 559 states and 767 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:20,379 INFO L93 Difference]: Finished difference Result 897 states and 1247 transitions. [2024-11-20 00:05:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:05:20,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:20,383 INFO L225 Difference]: With dead ends: 897 [2024-11-20 00:05:20,383 INFO L226 Difference]: Without dead ends: 710 [2024-11-20 00:05:20,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:05:20,385 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 443 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:20,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 917 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:05:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-20 00:05:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 646. [2024-11-20 00:05:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 549 states have (on average 1.3715846994535519) internal successors, (753), 558 states have internal predecessors, (753), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2024-11-20 00:05:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 886 transitions. [2024-11-20 00:05:20,430 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 886 transitions. Word has length 57 [2024-11-20 00:05:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:20,430 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 886 transitions. [2024-11-20 00:05:20,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 886 transitions. [2024-11-20 00:05:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:20,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:20,433 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] [2024-11-20 00:05:20,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:05:20,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 611944974, now seen corresponding path program 1 times [2024-11-20 00:05:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:20,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424562940] [2024-11-20 00:05:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424562940] [2024-11-20 00:05:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424562940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501549694] [2024-11-20 00:05:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:20,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:20,533 INFO L87 Difference]: Start difference. First operand 646 states and 886 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:21,204 INFO L93 Difference]: Finished difference Result 1214 states and 1686 transitions. [2024-11-20 00:05:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:05:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:21,210 INFO L225 Difference]: With dead ends: 1214 [2024-11-20 00:05:21,210 INFO L226 Difference]: Without dead ends: 940 [2024-11-20 00:05:21,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:05:21,212 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 451 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:21,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 901 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:05:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-20 00:05:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 808. [2024-11-20 00:05:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 679 states have (on average 1.3755522827687776) internal successors, (934), 690 states have internal predecessors, (934), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2024-11-20 00:05:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1111 transitions. [2024-11-20 00:05:21,285 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1111 transitions. Word has length 57 [2024-11-20 00:05:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1111 transitions. [2024-11-20 00:05:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1111 transitions. [2024-11-20 00:05:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:21,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:21,287 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] [2024-11-20 00:05:21,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:05:21,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:21,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 860091468, now seen corresponding path program 1 times [2024-11-20 00:05:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:21,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772401033] [2024-11-20 00:05:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772401033] [2024-11-20 00:05:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772401033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431645250] [2024-11-20 00:05:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:21,413 INFO L87 Difference]: Start difference. First operand 808 states and 1111 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:21,872 INFO L93 Difference]: Finished difference Result 1336 states and 1870 transitions. [2024-11-20 00:05:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 00:05:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:21,877 INFO L225 Difference]: With dead ends: 1336 [2024-11-20 00:05:21,877 INFO L226 Difference]: Without dead ends: 901 [2024-11-20 00:05:21,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:21,879 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 168 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:21,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 805 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-20 00:05:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 823. [2024-11-20 00:05:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 694 states have (on average 1.3674351585014408) internal successors, (949), 705 states have internal predecessors, (949), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2024-11-20 00:05:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1126 transitions. [2024-11-20 00:05:21,957 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1126 transitions. Word has length 57 [2024-11-20 00:05:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:21,958 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1126 transitions. [2024-11-20 00:05:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1126 transitions. [2024-11-20 00:05:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:21,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:21,960 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] [2024-11-20 00:05:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:05:21,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 787704910, now seen corresponding path program 1 times [2024-11-20 00:05:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380319480] [2024-11-20 00:05:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380319480] [2024-11-20 00:05:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380319480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:05:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447814603] [2024-11-20 00:05:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:05:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:05:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:05:22,051 INFO L87 Difference]: Start difference. First operand 823 states and 1126 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-20 00:05:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:22,650 INFO L93 Difference]: Finished difference Result 1833 states and 2529 transitions. [2024-11-20 00:05:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:05:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:22,660 INFO L225 Difference]: With dead ends: 1833 [2024-11-20 00:05:22,660 INFO L226 Difference]: Without dead ends: 1383 [2024-11-20 00:05:22,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:05:22,662 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 585 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:22,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 696 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:05:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-20 00:05:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1224. [2024-11-20 00:05:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1021 states have (on average 1.3643486777668952) internal successors, (1393), 1036 states have internal predecessors, (1393), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2024-11-20 00:05:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1664 transitions. [2024-11-20 00:05:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1664 transitions. Word has length 57 [2024-11-20 00:05:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1664 transitions. [2024-11-20 00:05:22,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-20 00:05:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1664 transitions. [2024-11-20 00:05:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:22,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:22,731 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] [2024-11-20 00:05:22,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:05:22,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash -983766065, now seen corresponding path program 1 times [2024-11-20 00:05:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:22,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515165958] [2024-11-20 00:05:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:22,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:22,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515165958] [2024-11-20 00:05:22,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515165958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:22,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:22,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603572316] [2024-11-20 00:05:22,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:22,817 INFO L87 Difference]: Start difference. First operand 1224 states and 1664 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:23,289 INFO L93 Difference]: Finished difference Result 2252 states and 3095 transitions. [2024-11-20 00:05:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:05:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-20 00:05:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:23,304 INFO L225 Difference]: With dead ends: 2252 [2024-11-20 00:05:23,305 INFO L226 Difference]: Without dead ends: 1401 [2024-11-20 00:05:23,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:05:23,317 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 173 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:23,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 801 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-20 00:05:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1239. [2024-11-20 00:05:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1036 states have (on average 1.3542471042471043) internal successors, (1403), 1051 states have internal predecessors, (1403), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2024-11-20 00:05:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1674 transitions. [2024-11-20 00:05:23,403 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1674 transitions. Word has length 57 [2024-11-20 00:05:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:23,404 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1674 transitions. [2024-11-20 00:05:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-20 00:05:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1674 transitions. [2024-11-20 00:05:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:23,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:23,406 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] [2024-11-20 00:05:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:05:23,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 939461969, now seen corresponding path program 1 times [2024-11-20 00:05:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721314670] [2024-11-20 00:05:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:23,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:23,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721314670] [2024-11-20 00:05:23,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721314670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:23,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:05:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003178362] [2024-11-20 00:05:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:23,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:05:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:05:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:05:23,524 INFO L87 Difference]: Start difference. First operand 1239 states and 1674 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:24,225 INFO L93 Difference]: Finished difference Result 1795 states and 2425 transitions. [2024-11-20 00:05:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:05:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-20 00:05:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:24,233 INFO L225 Difference]: With dead ends: 1795 [2024-11-20 00:05:24,233 INFO L226 Difference]: Without dead ends: 1253 [2024-11-20 00:05:24,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:05:24,236 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 494 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:24,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 815 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:05:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-20 00:05:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1067. [2024-11-20 00:05:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 895 states have (on average 1.3452513966480446) internal successors, (1204), 906 states have internal predecessors, (1204), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2024-11-20 00:05:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1427 transitions. [2024-11-20 00:05:24,324 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1427 transitions. Word has length 57 [2024-11-20 00:05:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:24,324 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1427 transitions. [2024-11-20 00:05:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1427 transitions. [2024-11-20 00:05:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:24,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:24,326 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] [2024-11-20 00:05:24,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:05:24,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1158316687, now seen corresponding path program 1 times [2024-11-20 00:05:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810742354] [2024-11-20 00:05:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810742354] [2024-11-20 00:05:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810742354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:05:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057494733] [2024-11-20 00:05:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:05:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:05:24,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:05:24,441 INFO L87 Difference]: Start difference. First operand 1067 states and 1427 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:25,100 INFO L93 Difference]: Finished difference Result 2374 states and 3144 transitions. [2024-11-20 00:05:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:05:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-20 00:05:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:25,108 INFO L225 Difference]: With dead ends: 2374 [2024-11-20 00:05:25,108 INFO L226 Difference]: Without dead ends: 1681 [2024-11-20 00:05:25,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:05:25,110 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 513 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:25,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 815 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:05:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2024-11-20 00:05:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1389. [2024-11-20 00:05:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1155 states have (on average 1.3316017316017317) internal successors, (1538), 1172 states have internal predecessors, (1538), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2024-11-20 00:05:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1843 transitions. [2024-11-20 00:05:25,180 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1843 transitions. Word has length 57 [2024-11-20 00:05:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:25,181 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1843 transitions. [2024-11-20 00:05:25,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1843 transitions. [2024-11-20 00:05:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:25,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:25,183 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] [2024-11-20 00:05:25,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:05:25,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1581018513, now seen corresponding path program 1 times [2024-11-20 00:05:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10875461] [2024-11-20 00:05:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10875461] [2024-11-20 00:05:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10875461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:05:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081851591] [2024-11-20 00:05:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:05:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:05:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:05:25,325 INFO L87 Difference]: Start difference. First operand 1389 states and 1843 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:26,018 INFO L93 Difference]: Finished difference Result 2374 states and 3134 transitions. [2024-11-20 00:05:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:05:26,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-20 00:05:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:26,027 INFO L225 Difference]: With dead ends: 2374 [2024-11-20 00:05:26,027 INFO L226 Difference]: Without dead ends: 1657 [2024-11-20 00:05:26,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:05:26,030 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 616 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:26,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 698 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:05:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-20 00:05:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1379. [2024-11-20 00:05:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1149 states have (on average 1.3281114012184507) internal successors, (1526), 1162 states have internal predecessors, (1526), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2024-11-20 00:05:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1821 transitions. [2024-11-20 00:05:26,109 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1821 transitions. Word has length 57 [2024-11-20 00:05:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:26,110 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 1821 transitions. [2024-11-20 00:05:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:05:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1821 transitions. [2024-11-20 00:05:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 00:05:26,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:26,112 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] [2024-11-20 00:05:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:05:26,112 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:26,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 763370063, now seen corresponding path program 1 times [2024-11-20 00:05:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87488611] [2024-11-20 00:05:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87488611] [2024-11-20 00:05:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87488611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:05:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60503856] [2024-11-20 00:05:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:26,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:05:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:05:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:05:26,161 INFO L87 Difference]: Start difference. First operand 1379 states and 1821 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:05:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:26,557 INFO L93 Difference]: Finished difference Result 3018 states and 3989 transitions. [2024-11-20 00:05:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:05:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-11-20 00:05:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:26,566 INFO L225 Difference]: With dead ends: 3018 [2024-11-20 00:05:26,566 INFO L226 Difference]: Without dead ends: 2009 [2024-11-20 00:05:26,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:26,569 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 461 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:26,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 439 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-11-20 00:05:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1791. [2024-11-20 00:05:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1479 states have (on average 1.3116970926301554) internal successors, (1940), 1502 states have internal predecessors, (1940), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2024-11-20 00:05:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2333 transitions. [2024-11-20 00:05:26,663 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2333 transitions. Word has length 57 [2024-11-20 00:05:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:26,664 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2333 transitions. [2024-11-20 00:05:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:05:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2333 transitions. [2024-11-20 00:05:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 00:05:26,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:26,666 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:26,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:05:26,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1207485526, now seen corresponding path program 1 times [2024-11-20 00:05:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256483498] [2024-11-20 00:05:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 00:05:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 00:05:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256483498] [2024-11-20 00:05:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256483498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:26,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:05:26,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938385412] [2024-11-20 00:05:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:26,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:05:26,737 INFO L87 Difference]: Start difference. First operand 1791 states and 2333 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-20 00:05:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:26,970 INFO L93 Difference]: Finished difference Result 2375 states and 3118 transitions. [2024-11-20 00:05:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:26,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 62 [2024-11-20 00:05:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:26,978 INFO L225 Difference]: With dead ends: 2375 [2024-11-20 00:05:26,978 INFO L226 Difference]: Without dead ends: 2019 [2024-11-20 00:05:26,980 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-11-20 00:05:26,980 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 133 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:26,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 570 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 00:05:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2024-11-20 00:05:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1981. [2024-11-20 00:05:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1645 states have (on average 1.3009118541033435) internal successors, (2140), 1670 states have internal predecessors, (2140), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2024-11-20 00:05:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2571 transitions. [2024-11-20 00:05:27,130 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2571 transitions. Word has length 62 [2024-11-20 00:05:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:27,130 INFO L471 AbstractCegarLoop]: Abstraction has 1981 states and 2571 transitions. [2024-11-20 00:05:27,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-20 00:05:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2571 transitions. [2024-11-20 00:05:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:05:27,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:27,132 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:05:27,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash -231379727, now seen corresponding path program 1 times [2024-11-20 00:05:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926204500] [2024-11-20 00:05:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:05:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:05:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 00:05:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926204500] [2024-11-20 00:05:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926204500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:05:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330786806] [2024-11-20 00:05:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:27,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:05:27,167 INFO L87 Difference]: Start difference. First operand 1981 states and 2571 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 00:05:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:27,405 INFO L93 Difference]: Finished difference Result 2634 states and 3424 transitions. [2024-11-20 00:05:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 67 [2024-11-20 00:05:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:27,413 INFO L225 Difference]: With dead ends: 2634 [2024-11-20 00:05:27,413 INFO L226 Difference]: Without dead ends: 2180 [2024-11-20 00:05:27,415 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-11-20 00:05:27,415 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 281 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:27,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 404 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 00:05:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-11-20 00:05:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2125. [2024-11-20 00:05:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1773 states have (on average 1.2921601804850535) internal successors, (2291), 1800 states have internal predecessors, (2291), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2024-11-20 00:05:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2744 transitions. [2024-11-20 00:05:27,530 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2744 transitions. Word has length 67 [2024-11-20 00:05:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:27,530 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2744 transitions. [2024-11-20 00:05:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 00:05:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2744 transitions. [2024-11-20 00:05:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:05:27,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:27,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:27,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:05:27,533 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:27,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2093542921, now seen corresponding path program 1 times [2024-11-20 00:05:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:27,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159896469] [2024-11-20 00:05:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:05:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:05:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:05:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159896469] [2024-11-20 00:05:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159896469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710498509] [2024-11-20 00:05:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:27,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:27,615 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-11-20 00:05:27,616 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-11-20 00:05:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:27,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 00:05:27,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:27,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:05:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:05:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710498509] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 00:05:27,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-20 00:05:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570652416] [2024-11-20 00:05:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:27,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:05:27,834 INFO L87 Difference]: Start difference. First operand 2125 states and 2744 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:05:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:28,068 INFO L93 Difference]: Finished difference Result 2181 states and 2812 transitions. [2024-11-20 00:05:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:05:28,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 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 68 [2024-11-20 00:05:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:28,079 INFO L225 Difference]: With dead ends: 2181 [2024-11-20 00:05:28,080 INFO L226 Difference]: Without dead ends: 2178 [2024-11-20 00:05:28,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:28,081 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 403 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:28,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 329 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 00:05:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2024-11-20 00:05:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2124. [2024-11-20 00:05:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 1773 states have (on average 1.2910321489001693) internal successors, (2289), 1799 states have internal predecessors, (2289), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2024-11-20 00:05:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2741 transitions. [2024-11-20 00:05:28,256 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2741 transitions. Word has length 68 [2024-11-20 00:05:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:28,256 INFO L471 AbstractCegarLoop]: Abstraction has 2124 states and 2741 transitions. [2024-11-20 00:05:28,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 00:05:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2741 transitions. [2024-11-20 00:05:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 00:05:28,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:28,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:28,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 00:05:28,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 00:05:28,460 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -475909068, now seen corresponding path program 1 times [2024-11-20 00:05:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703758245] [2024-11-20 00:05:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:28,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:28,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:05:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:05:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 00:05:28,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703758245] [2024-11-20 00:05:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703758245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92645167] [2024-11-20 00:05:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:28,530 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-11-20 00:05:28,533 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-11-20 00:05:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:28,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:05:28,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:05:28,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:05:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:05:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92645167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:05:28,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:05:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-20 00:05:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005796233] [2024-11-20 00:05:28,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:05:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 00:05:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 00:05:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:28,850 INFO L87 Difference]: Start difference. First operand 2124 states and 2741 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:05:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:29,664 INFO L93 Difference]: Finished difference Result 3631 states and 4729 transitions. [2024-11-20 00:05:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:05:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-20 00:05:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:29,677 INFO L225 Difference]: With dead ends: 3631 [2024-11-20 00:05:29,677 INFO L226 Difference]: Without dead ends: 3087 [2024-11-20 00:05:29,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-20 00:05:29,682 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 537 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:29,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1769 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:05:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2024-11-20 00:05:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2487. [2024-11-20 00:05:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2097 states have (on average 1.2823080591320934) internal successors, (2689), 2131 states have internal predecessors, (2689), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2024-11-20 00:05:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3195 transitions. [2024-11-20 00:05:29,876 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3195 transitions. Word has length 69 [2024-11-20 00:05:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3195 transitions. [2024-11-20 00:05:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 00:05:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3195 transitions. [2024-11-20 00:05:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 00:05:29,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:29,881 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-20 00:05:29,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 00:05:30,085 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,SelfDestructingSolverStorable17 [2024-11-20 00:05:30,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:30,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1613897456, now seen corresponding path program 1 times [2024-11-20 00:05:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581283038] [2024-11-20 00:05:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:05:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:05:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-20 00:05:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581283038] [2024-11-20 00:05:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581283038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047529237] [2024-11-20 00:05:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:30,169 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-11-20 00:05:30,176 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-11-20 00:05:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:05:30,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 00:05:30,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:30,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047529237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:30,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:30,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:05:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706842716] [2024-11-20 00:05:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:30,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:05:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:05:30,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:30,289 INFO L87 Difference]: Start difference. First operand 2487 states and 3195 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:05:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:30,478 INFO L93 Difference]: Finished difference Result 3184 states and 4099 transitions. [2024-11-20 00:05:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:05:30,479 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-20 00:05:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:30,495 INFO L225 Difference]: With dead ends: 3184 [2024-11-20 00:05:30,496 INFO L226 Difference]: Without dead ends: 2365 [2024-11-20 00:05:30,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:30,499 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 198 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:30,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 343 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-11-20 00:05:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2350. [2024-11-20 00:05:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1976 states have (on average 1.2808704453441295) internal successors, (2531), 2009 states have internal predecessors, (2531), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2024-11-20 00:05:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3015 transitions. [2024-11-20 00:05:30,683 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3015 transitions. Word has length 88 [2024-11-20 00:05:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:30,683 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 3015 transitions. [2024-11-20 00:05:30,683 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 00:05:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3015 transitions. [2024-11-20 00:05:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:05:30,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:30,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:30,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 00:05:30,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:30,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 667474523, now seen corresponding path program 1 times [2024-11-20 00:05:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949996054] [2024-11-20 00:05:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:05:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 00:05:31,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949996054] [2024-11-20 00:05:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949996054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158564651] [2024-11-20 00:05:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:31,052 INFO L87 Difference]: Start difference. First operand 2350 states and 3015 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:05:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:31,763 INFO L93 Difference]: Finished difference Result 5525 states and 7211 transitions. [2024-11-20 00:05:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:05:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2024-11-20 00:05:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:31,778 INFO L225 Difference]: With dead ends: 5525 [2024-11-20 00:05:31,779 INFO L226 Difference]: Without dead ends: 4110 [2024-11-20 00:05:31,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:05:31,784 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 464 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:31,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 621 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2024-11-20 00:05:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3712. [2024-11-20 00:05:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3059 states have (on average 1.276887871853547) internal successors, (3906), 3119 states have internal predecessors, (3906), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2024-11-20 00:05:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4789 transitions. [2024-11-20 00:05:32,098 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4789 transitions. Word has length 93 [2024-11-20 00:05:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:32,099 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4789 transitions. [2024-11-20 00:05:32,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:05:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4789 transitions. [2024-11-20 00:05:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:05:32,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:32,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:05:32,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:32,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1211656423, now seen corresponding path program 1 times [2024-11-20 00:05:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679095288] [2024-11-20 00:05:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:05:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-20 00:05:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679095288] [2024-11-20 00:05:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679095288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:05:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140081628] [2024-11-20 00:05:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:05:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:05:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:05:32,171 INFO L87 Difference]: Start difference. First operand 3712 states and 4789 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:05:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:32,634 INFO L93 Difference]: Finished difference Result 6159 states and 7953 transitions. [2024-11-20 00:05:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:05:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2024-11-20 00:05:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:32,646 INFO L225 Difference]: With dead ends: 6159 [2024-11-20 00:05:32,646 INFO L226 Difference]: Without dead ends: 3382 [2024-11-20 00:05:32,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:32,653 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 315 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:32,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 428 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:05:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2024-11-20 00:05:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3070. [2024-11-20 00:05:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2550 states have (on average 1.2741176470588236) internal successors, (3249), 2601 states have internal predecessors, (3249), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2024-11-20 00:05:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3943 transitions. [2024-11-20 00:05:32,902 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3943 transitions. Word has length 93 [2024-11-20 00:05:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:32,902 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3943 transitions. [2024-11-20 00:05:32,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:05:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3943 transitions. [2024-11-20 00:05:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 00:05:32,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:32,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:05:32,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:05:32,907 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:32,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1243514336, now seen corresponding path program 1 times [2024-11-20 00:05:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:32,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475452325] [2024-11-20 00:05:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 00:05:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 00:05:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475452325] [2024-11-20 00:05:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475452325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:05:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983480304] [2024-11-20 00:05:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:32,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:05:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:05:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:32,991 INFO L87 Difference]: Start difference. First operand 3070 states and 3943 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:05:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:34,233 INFO L93 Difference]: Finished difference Result 6645 states and 8676 transitions. [2024-11-20 00:05:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 00:05:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 95 [2024-11-20 00:05:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:34,249 INFO L225 Difference]: With dead ends: 6645 [2024-11-20 00:05:34,249 INFO L226 Difference]: Without dead ends: 4510 [2024-11-20 00:05:34,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-20 00:05:34,257 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1189 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:34,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 815 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:05:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2024-11-20 00:05:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4214. [2024-11-20 00:05:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4214 states, 3498 states have (on average 1.2547169811320755) internal successors, (4389), 3573 states have internal predecessors, (4389), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2024-11-20 00:05:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 5334 transitions. [2024-11-20 00:05:34,635 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 5334 transitions. Word has length 95 [2024-11-20 00:05:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 4214 states and 5334 transitions. [2024-11-20 00:05:34,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:05:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 5334 transitions. [2024-11-20 00:05:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 00:05:34,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:34,639 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 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-11-20 00:05:34,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:05:34,639 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -801124630, now seen corresponding path program 1 times [2024-11-20 00:05:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420238353] [2024-11-20 00:05:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:05:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 00:05:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 00:05:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 00:05:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:05:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 00:05:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420238353] [2024-11-20 00:05:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420238353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194436216] [2024-11-20 00:05:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:34,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:34,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:34,758 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-11-20 00:05:34,759 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-11-20 00:05:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:34,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:05:34,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 00:05:34,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194436216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:34,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-20 00:05:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181622405] [2024-11-20 00:05:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:34,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:05:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:05:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:34,850 INFO L87 Difference]: Start difference. First operand 4214 states and 5334 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-20 00:05:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:35,114 INFO L93 Difference]: Finished difference Result 4593 states and 5802 transitions. [2024-11-20 00:05:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:05:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 103 [2024-11-20 00:05:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:35,129 INFO L225 Difference]: With dead ends: 4593 [2024-11-20 00:05:35,129 INFO L226 Difference]: Without dead ends: 3293 [2024-11-20 00:05:35,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:05:35,133 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 62 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:35,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 494 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2024-11-20 00:05:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2024-11-20 00:05:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 2680 states have (on average 1.2555970149253732) internal successors, (3365), 2739 states have internal predecessors, (3365), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2024-11-20 00:05:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4161 transitions. [2024-11-20 00:05:35,419 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4161 transitions. Word has length 103 [2024-11-20 00:05:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:35,420 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 4161 transitions. [2024-11-20 00:05:35,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-20 00:05:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4161 transitions. [2024-11-20 00:05:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 00:05:35,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:35,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:05:35,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 00:05:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:35,625 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -291436951, now seen corresponding path program 1 times [2024-11-20 00:05:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301935789] [2024-11-20 00:05:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:05:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 00:05:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:05:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-20 00:05:35,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301935789] [2024-11-20 00:05:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301935789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704630376] [2024-11-20 00:05:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:35,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:05:35,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 00:05:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:35,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:05:35,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-20 00:05:35,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704630376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-20 00:05:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102856067] [2024-11-20 00:05:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:35,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:05:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:35,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:05:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:35,871 INFO L87 Difference]: Start difference. First operand 3293 states and 4161 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:36,172 INFO L93 Difference]: Finished difference Result 6730 states and 8624 transitions. [2024-11-20 00:05:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:05:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2024-11-20 00:05:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:36,185 INFO L225 Difference]: With dead ends: 6730 [2024-11-20 00:05:36,185 INFO L226 Difference]: Without dead ends: 3580 [2024-11-20 00:05:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:36,194 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2024-11-20 00:05:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3432. [2024-11-20 00:05:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 2812 states have (on average 1.209103840682788) internal successors, (3400), 2863 states have internal predecessors, (3400), 333 states have call successors, (333), 237 states have call predecessors, (333), 286 states have return successors, (410), 333 states have call predecessors, (410), 333 states have call successors, (410) [2024-11-20 00:05:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4143 transitions. [2024-11-20 00:05:36,459 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4143 transitions. Word has length 138 [2024-11-20 00:05:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:36,460 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4143 transitions. [2024-11-20 00:05:36,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4143 transitions. [2024-11-20 00:05:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 00:05:36,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:36,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-11-20 00:05:36,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 00:05:36,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 00:05:36,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:36,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1122563028, now seen corresponding path program 1 times [2024-11-20 00:05:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624678223] [2024-11-20 00:05:36,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:05:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 00:05:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:05:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 00:05:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624678223] [2024-11-20 00:05:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624678223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179418248] [2024-11-20 00:05:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:36,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:36,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:36,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:05:36,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 00:05:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:36,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:05:36,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 00:05:36,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179418248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-20 00:05:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22148374] [2024-11-20 00:05:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:05:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:05:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:36,901 INFO L87 Difference]: Start difference. First operand 3432 states and 4143 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:37,292 INFO L93 Difference]: Finished difference Result 5627 states and 6803 transitions. [2024-11-20 00:05:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:05:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2024-11-20 00:05:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:37,303 INFO L225 Difference]: With dead ends: 5627 [2024-11-20 00:05:37,304 INFO L226 Difference]: Without dead ends: 3277 [2024-11-20 00:05:37,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:05:37,311 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 98 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:37,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 371 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2024-11-20 00:05:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2024-11-20 00:05:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2706 states have (on average 1.2036215816703622) internal successors, (3257), 2758 states have internal predecessors, (3257), 298 states have call successors, (298), 220 states have call predecessors, (298), 270 states have return successors, (360), 298 states have call predecessors, (360), 298 states have call successors, (360) [2024-11-20 00:05:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3915 transitions. [2024-11-20 00:05:37,574 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3915 transitions. Word has length 138 [2024-11-20 00:05:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:37,575 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 3915 transitions. [2024-11-20 00:05:37,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3915 transitions. [2024-11-20 00:05:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 00:05:37,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:37,578 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:05:37,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 00:05:37,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:37,779 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1493582248, now seen corresponding path program 1 times [2024-11-20 00:05:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2404744] [2024-11-20 00:05:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 00:05:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 00:05:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 00:05:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:05:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-20 00:05:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2404744] [2024-11-20 00:05:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2404744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6944841] [2024-11-20 00:05:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:37,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:05:37,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 00:05:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:37,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:05:37,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 00:05:38,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6944841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:05:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247847636] [2024-11-20 00:05:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:05:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:05:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:05:38,018 INFO L87 Difference]: Start difference. First operand 3275 states and 3915 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:38,269 INFO L93 Difference]: Finished difference Result 5466 states and 6628 transitions. [2024-11-20 00:05:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:05:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-20 00:05:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:38,280 INFO L225 Difference]: With dead ends: 5466 [2024-11-20 00:05:38,280 INFO L226 Difference]: Without dead ends: 3289 [2024-11-20 00:05:38,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:05:38,285 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:38,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-11-20 00:05:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3271. [2024-11-20 00:05:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2702 states have (on average 1.1813471502590673) internal successors, (3192), 2754 states have internal predecessors, (3192), 298 states have call successors, (298), 220 states have call predecessors, (298), 270 states have return successors, (360), 298 states have call predecessors, (360), 298 states have call successors, (360) [2024-11-20 00:05:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 3850 transitions. [2024-11-20 00:05:38,513 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 3850 transitions. Word has length 139 [2024-11-20 00:05:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:38,513 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 3850 transitions. [2024-11-20 00:05:38,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 00:05:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 3850 transitions. [2024-11-20 00:05:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 00:05:38,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:38,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:05:38,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 00:05:38,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:38,718 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:38,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1715579866, now seen corresponding path program 1 times [2024-11-20 00:05:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63720444] [2024-11-20 00:05:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 00:05:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 00:05:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 00:05:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:05:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-20 00:05:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63720444] [2024-11-20 00:05:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63720444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:38,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:05:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:05:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479598401] [2024-11-20 00:05:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:05:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:05:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:05:38,822 INFO L87 Difference]: Start difference. First operand 3271 states and 3850 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-20 00:05:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:39,588 INFO L93 Difference]: Finished difference Result 7001 states and 8228 transitions. [2024-11-20 00:05:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:05:39,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 140 [2024-11-20 00:05:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:39,599 INFO L225 Difference]: With dead ends: 7001 [2024-11-20 00:05:39,599 INFO L226 Difference]: Without dead ends: 4296 [2024-11-20 00:05:39,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:05:39,604 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 435 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:39,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 429 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:05:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-11-20 00:05:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3735. [2024-11-20 00:05:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 3087 states have (on average 1.1817298347910592) internal successors, (3648), 3144 states have internal predecessors, (3648), 342 states have call successors, (342), 250 states have call predecessors, (342), 305 states have return successors, (410), 342 states have call predecessors, (410), 342 states have call successors, (410) [2024-11-20 00:05:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4400 transitions. [2024-11-20 00:05:39,934 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4400 transitions. Word has length 140 [2024-11-20 00:05:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:39,935 INFO L471 AbstractCegarLoop]: Abstraction has 3735 states and 4400 transitions. [2024-11-20 00:05:39,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-20 00:05:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4400 transitions. [2024-11-20 00:05:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 00:05:39,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:39,940 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:05:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 00:05:39,940 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -575413283, now seen corresponding path program 1 times [2024-11-20 00:05:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640031361] [2024-11-20 00:05:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 00:05:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 00:05:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 00:05:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 00:05:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 00:05:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:05:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:05:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 00:05:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-20 00:05:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640031361] [2024-11-20 00:05:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640031361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868509613] [2024-11-20 00:05:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:40,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:40,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:05:40,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 00:05:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:05:40,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-20 00:05:40,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868509613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-11-20 00:05:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656366618] [2024-11-20 00:05:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:40,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:05:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:05:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:40,174 INFO L87 Difference]: Start difference. First operand 3735 states and 4400 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 00:05:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:40,291 INFO L93 Difference]: Finished difference Result 5262 states and 6168 transitions. [2024-11-20 00:05:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:05:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2024-11-20 00:05:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:40,297 INFO L225 Difference]: With dead ends: 5262 [2024-11-20 00:05:40,297 INFO L226 Difference]: Without dead ends: 1541 [2024-11-20 00:05:40,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:40,302 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:40,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:05:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-20 00:05:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1524. [2024-11-20 00:05:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1274 states have (on average 1.1554160125588697) internal successors, (1472), 1288 states have internal predecessors, (1472), 122 states have call successors, (122), 92 states have call predecessors, (122), 127 states have return successors, (160), 143 states have call predecessors, (160), 122 states have call successors, (160) [2024-11-20 00:05:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1754 transitions. [2024-11-20 00:05:40,414 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1754 transitions. Word has length 161 [2024-11-20 00:05:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:40,415 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1754 transitions. [2024-11-20 00:05:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 00:05:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1754 transitions. [2024-11-20 00:05:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 00:05:40,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:05:40,417 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 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, 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, 1, 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-11-20 00:05:40,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 00:05:40,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 00:05:40,618 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:05:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:05:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1040199976, now seen corresponding path program 1 times [2024-11-20 00:05:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:05:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618973446] [2024-11-20 00:05:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:05:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:05:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:05:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:05:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 00:05:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:05:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 00:05:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:05:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:05:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 00:05:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 00:05:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:05:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 00:05:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 00:05:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 00:05:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 00:05:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-20 00:05:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:05:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618973446] [2024-11-20 00:05:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618973446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:05:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90765047] [2024-11-20 00:05:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:05:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:05:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:05:40,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:05:40,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 00:05:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:05:40,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 00:05:40,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:05:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-20 00:05:40,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:05:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90765047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:05:40,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:05:40,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-20 00:05:40,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744946383] [2024-11-20 00:05:40,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:05:40,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:05:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:05:41,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:05:41,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:05:41,000 INFO L87 Difference]: Start difference. First operand 1524 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:05:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:05:41,182 INFO L93 Difference]: Finished difference Result 2149 states and 2521 transitions. [2024-11-20 00:05:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:05:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 166 [2024-11-20 00:05:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:05:41,186 INFO L225 Difference]: With dead ends: 2149 [2024-11-20 00:05:41,186 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 00:05:41,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:05:41,189 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:05:41,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 147 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 00:05:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 00:05:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 00:05:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:05:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 00:05:41,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2024-11-20 00:05:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:05:41,194 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 00:05:41,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:05:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 00:05:41,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 00:05:41,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-20 00:05:41,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-20 00:05:41,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-20 00:05:41,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 00:05:41,402 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-20 00:05:41,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 00:06:06,961 WARN L286 SmtUtils]: Spent 25.18s on a formula simplification. DAG size of input: 108 DAG size of output: 60 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-20 00:06:18,540 WARN L286 SmtUtils]: Spent 11.58s on a formula simplification. DAG size of input: 103 DAG size of output: 60 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-20 00:06:29,394 WARN L286 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 103 DAG size of output: 60 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)