./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.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.09.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 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:10:07,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:10:07,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:10:07,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:10:07,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:10:07,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:10:07,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:10:07,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:10:07,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:10:07,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:10:07,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:10:07,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:10:07,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:10:07,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:10:07,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:10:07,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:10:07,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:10:07,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:10:07,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:10:07,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:10:07,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:10:07,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:10:07,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:10:07,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:10:07,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:10:07,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:10:07,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:10:07,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:10:07,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:10:07,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:10:07,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:10:07,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:10:07,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:07,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:10:07,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:10:07,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:10:07,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:10:07,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:10:07,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:10:07,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:10:07,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:10:07,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:10:07,203 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 -> 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 [2024-10-14 05:10:07,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:10:07,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:10:07,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:10:07,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:10:07,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:10:07,485 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.09.cil-1.c [2024-10-14 05:10:08,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:10:09,216 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:10:09,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2024-10-14 05:10:09,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cbb84cb/efe00ec8b07f4cb78cf0a03b1988ee6f/FLAGeda241c2b [2024-10-14 05:10:09,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cbb84cb/efe00ec8b07f4cb78cf0a03b1988ee6f [2024-10-14 05:10:09,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:10:09,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:10:09,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:09,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:10:09,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:10:09,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:09" (1/1) ... [2024-10-14 05:10:09,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292e96a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:09, skipping insertion in model container [2024-10-14 05:10:09,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:09" (1/1) ... [2024-10-14 05:10:09,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:10:09,781 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c[913,926] [2024-10-14 05:10:09,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c[5977,5990] [2024-10-14 05:10:09,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:09,947 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:10:09,962 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c[913,926] [2024-10-14 05:10:09,987 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c[5977,5990] [2024-10-14 05:10:10,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:10,094 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:10:10,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10 WrapperNode [2024-10-14 05:10:10,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:10,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:10,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:10:10,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:10:10,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,162 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 903 [2024-10-14 05:10:10,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:10,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:10:10,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:10:10,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:10:10,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:10:10,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:10:10,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:10:10,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:10:10,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:10:10,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (1/1) ... [2024-10-14 05:10:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:10,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:10:10,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:10:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:10:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:10:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:10:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:10:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:10:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:10:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:10:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:10:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:10:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:10:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:10:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:10:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:10:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:10:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:10:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:10:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:10:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:10:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:10:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:10:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:10:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:10:10,495 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:10:10,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:10:11,465 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-14 05:10:11,465 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:10:11,557 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:10:11,557 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-14 05:10:11,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:11 BoogieIcfgContainer [2024-10-14 05:10:11,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:10:11,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:10:11,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:10:11,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:10:11,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:10:09" (1/3) ... [2024-10-14 05:10:11,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17d46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:11, skipping insertion in model container [2024-10-14 05:10:11,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:10" (2/3) ... [2024-10-14 05:10:11,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17d46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:11, skipping insertion in model container [2024-10-14 05:10:11,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:11" (3/3) ... [2024-10-14 05:10:11,570 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2024-10-14 05:10:11,588 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:10:11,592 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:10:11,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:10:11,700 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;@1e3a9d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:10:11,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:10:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 301 states have (on average 1.7142857142857142) internal successors, (516), 306 states have internal predecessors, (516), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 05:10:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:10:11,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:11,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:11,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -677045665, now seen corresponding path program 1 times [2024-10-14 05:10:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678682916] [2024-10-14 05:10:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678682916] [2024-10-14 05:10:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678682916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:12,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896211480] [2024-10-14 05:10:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:12,164 INFO L87 Difference]: Start difference. First operand has 342 states, 301 states have (on average 1.7142857142857142) internal successors, (516), 306 states have internal predecessors, (516), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:12,832 INFO L93 Difference]: Finished difference Result 728 states and 1218 transitions. [2024-10-14 05:10:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:12,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-14 05:10:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:12,849 INFO L225 Difference]: With dead ends: 728 [2024-10-14 05:10:12,850 INFO L226 Difference]: Without dead ends: 400 [2024-10-14 05:10:12,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:12,857 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 715 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:12,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 599 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-14 05:10:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 394. [2024-10-14 05:10:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 348 states have (on average 1.5718390804597702) internal successors, (547), 352 states have internal predecessors, (547), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (37), 31 states have call predecessors, (37), 31 states have call successors, (37) [2024-10-14 05:10:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 617 transitions. [2024-10-14 05:10:12,929 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 617 transitions. Word has length 37 [2024-10-14 05:10:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 617 transitions. [2024-10-14 05:10:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 617 transitions. [2024-10-14 05:10:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:10:12,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:12,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:12,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:10:12,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2043879897, now seen corresponding path program 1 times [2024-10-14 05:10:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741757839] [2024-10-14 05:10:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:10:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741757839] [2024-10-14 05:10:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741757839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:13,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082193447] [2024-10-14 05:10:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:13,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:13,091 INFO L87 Difference]: Start difference. First operand 394 states and 617 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:13,568 INFO L93 Difference]: Finished difference Result 628 states and 961 transitions. [2024-10-14 05:10:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 05:10:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:13,577 INFO L225 Difference]: With dead ends: 628 [2024-10-14 05:10:13,577 INFO L226 Difference]: Without dead ends: 517 [2024-10-14 05:10:13,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:13,579 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 728 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 595 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:10:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-14 05:10:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 494. [2024-10-14 05:10:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 435 states have (on average 1.528735632183908) internal successors, (665), 440 states have internal predecessors, (665), 41 states have call successors, (41), 15 states have call predecessors, (41), 16 states have return successors, (51), 39 states have call predecessors, (51), 39 states have call successors, (51) [2024-10-14 05:10:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 757 transitions. [2024-10-14 05:10:13,639 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 757 transitions. Word has length 38 [2024-10-14 05:10:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:13,639 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 757 transitions. [2024-10-14 05:10:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 757 transitions. [2024-10-14 05:10:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:10:13,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:13,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:13,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:10:13,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash 504329108, now seen corresponding path program 1 times [2024-10-14 05:10:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192024895] [2024-10-14 05:10:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:10:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192024895] [2024-10-14 05:10:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192024895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:13,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993444018] [2024-10-14 05:10:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:13,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:13,743 INFO L87 Difference]: Start difference. First operand 494 states and 757 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:14,291 INFO L93 Difference]: Finished difference Result 914 states and 1338 transitions. [2024-10-14 05:10:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-14 05:10:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:14,297 INFO L225 Difference]: With dead ends: 914 [2024-10-14 05:10:14,297 INFO L226 Difference]: Without dead ends: 703 [2024-10-14 05:10:14,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:14,299 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 289 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:14,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 834 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-10-14 05:10:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 599. [2024-10-14 05:10:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 528 states have (on average 1.503787878787879) internal successors, (794), 535 states have internal predecessors, (794), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (57), 43 states have call predecessors, (57), 45 states have call successors, (57) [2024-10-14 05:10:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 898 transitions. [2024-10-14 05:10:14,348 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 898 transitions. Word has length 39 [2024-10-14 05:10:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 898 transitions. [2024-10-14 05:10:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 898 transitions. [2024-10-14 05:10:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:10:14,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:14,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:14,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:10:14,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 434964974, now seen corresponding path program 1 times [2024-10-14 05:10:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957468941] [2024-10-14 05:10:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:10:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:10:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:14,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957468941] [2024-10-14 05:10:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957468941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265446125] [2024-10-14 05:10:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:14,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:14,474 INFO L87 Difference]: Start difference. First operand 599 states and 898 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:15,025 INFO L93 Difference]: Finished difference Result 1115 states and 1615 transitions. [2024-10-14 05:10:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-14 05:10:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:15,031 INFO L225 Difference]: With dead ends: 1115 [2024-10-14 05:10:15,031 INFO L226 Difference]: Without dead ends: 799 [2024-10-14 05:10:15,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:15,033 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 274 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:15,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 878 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-14 05:10:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 765. [2024-10-14 05:10:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 670 states have (on average 1.4477611940298507) internal successors, (970), 679 states have internal predecessors, (970), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (81), 57 states have call predecessors, (81), 59 states have call successors, (81) [2024-10-14 05:10:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1112 transitions. [2024-10-14 05:10:15,075 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1112 transitions. Word has length 54 [2024-10-14 05:10:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:15,077 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1112 transitions. [2024-10-14 05:10:15,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1112 transitions. [2024-10-14 05:10:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:10:15,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:15,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:15,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:10:15,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:15,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash -25620436, now seen corresponding path program 1 times [2024-10-14 05:10:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:15,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667003577] [2024-10-14 05:10:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:10:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 05:10:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667003577] [2024-10-14 05:10:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667003577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646483441] [2024-10-14 05:10:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:15,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:15,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:15,162 INFO L87 Difference]: Start difference. First operand 765 states and 1112 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:15,606 INFO L93 Difference]: Finished difference Result 1344 states and 1891 transitions. [2024-10-14 05:10:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-14 05:10:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:15,613 INFO L225 Difference]: With dead ends: 1344 [2024-10-14 05:10:15,613 INFO L226 Difference]: Without dead ends: 942 [2024-10-14 05:10:15,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:15,615 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 714 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:15,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 607 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:10:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-14 05:10:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 893. [2024-10-14 05:10:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 782 states have (on average 1.4130434782608696) internal successors, (1105), 793 states have internal predecessors, (1105), 69 states have call successors, (69), 35 states have call predecessors, (69), 40 states have return successors, (95), 65 states have call predecessors, (95), 67 states have call successors, (95) [2024-10-14 05:10:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1269 transitions. [2024-10-14 05:10:15,659 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1269 transitions. Word has length 59 [2024-10-14 05:10:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1269 transitions. [2024-10-14 05:10:15,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1269 transitions. [2024-10-14 05:10:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:15,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:15,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:10:15,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2003284836, now seen corresponding path program 1 times [2024-10-14 05:10:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938394671] [2024-10-14 05:10:15,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:10:15,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938394671] [2024-10-14 05:10:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938394671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091335622] [2024-10-14 05:10:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:15,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:15,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:15,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:10:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:15,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:10:15,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091335622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107763294] [2024-10-14 05:10:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:15,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:15,956 INFO L87 Difference]: Start difference. First operand 893 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:16,106 INFO L93 Difference]: Finished difference Result 1381 states and 1943 transitions. [2024-10-14 05:10:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:10:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:16,112 INFO L225 Difference]: With dead ends: 1381 [2024-10-14 05:10:16,113 INFO L226 Difference]: Without dead ends: 898 [2024-10-14 05:10:16,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:16,115 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:16,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1465 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-14 05:10:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-10-14 05:10:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 787 states have (on average 1.400254129606099) internal successors, (1102), 798 states have internal predecessors, (1102), 69 states have call successors, (69), 35 states have call predecessors, (69), 40 states have return successors, (95), 65 states have call predecessors, (95), 67 states have call successors, (95) [2024-10-14 05:10:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1266 transitions. [2024-10-14 05:10:16,159 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1266 transitions. Word has length 60 [2024-10-14 05:10:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:16,160 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1266 transitions. [2024-10-14 05:10:16,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1266 transitions. [2024-10-14 05:10:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:16,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:16,162 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:16,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:10:16,362 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,SelfDestructingSolverStorable5 [2024-10-14 05:10:16,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1159279334, now seen corresponding path program 1 times [2024-10-14 05:10:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555126320] [2024-10-14 05:10:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:10:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555126320] [2024-10-14 05:10:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555126320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499593024] [2024-10-14 05:10:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:16,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:16,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:16,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:10:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:16,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:16,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:10:16,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:16,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499593024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:16,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:16,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:16,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65871581] [2024-10-14 05:10:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:16,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:16,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:16,581 INFO L87 Difference]: Start difference. First operand 898 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:16,694 INFO L93 Difference]: Finished difference Result 1324 states and 1845 transitions. [2024-10-14 05:10:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:10:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:16,700 INFO L225 Difference]: With dead ends: 1324 [2024-10-14 05:10:16,700 INFO L226 Difference]: Without dead ends: 795 [2024-10-14 05:10:16,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:16,702 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:16,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1465 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-14 05:10:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 788. [2024-10-14 05:10:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 695 states have (on average 1.4086330935251798) internal successors, (979), 704 states have internal predecessors, (979), 59 states have call successors, (59), 29 states have call predecessors, (59), 32 states have return successors, (76), 55 states have call predecessors, (76), 57 states have call successors, (76) [2024-10-14 05:10:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2024-10-14 05:10:16,734 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 60 [2024-10-14 05:10:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2024-10-14 05:10:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2024-10-14 05:10:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:16,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:16,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:16,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 05:10:16,940 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,SelfDestructingSolverStorable6 [2024-10-14 05:10:16,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:16,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1338048346, now seen corresponding path program 1 times [2024-10-14 05:10:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038742190] [2024-10-14 05:10:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038742190] [2024-10-14 05:10:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038742190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039656542] [2024-10-14 05:10:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:17,092 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:17,644 INFO L93 Difference]: Finished difference Result 873 states and 1217 transitions. [2024-10-14 05:10:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-14 05:10:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:17,650 INFO L225 Difference]: With dead ends: 873 [2024-10-14 05:10:17,651 INFO L226 Difference]: Without dead ends: 870 [2024-10-14 05:10:17,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:17,654 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1202 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:17,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 604 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-14 05:10:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 787. [2024-10-14 05:10:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.4057553956834532) internal successors, (977), 703 states have internal predecessors, (977), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (76), 55 states have call predecessors, (76), 57 states have call successors, (76) [2024-10-14 05:10:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1111 transitions. [2024-10-14 05:10:17,705 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1111 transitions. Word has length 60 [2024-10-14 05:10:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1111 transitions. [2024-10-14 05:10:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1111 transitions. [2024-10-14 05:10:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:10:17,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:17,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:17,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:10:17,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:17,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1468991597, now seen corresponding path program 1 times [2024-10-14 05:10:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457834101] [2024-10-14 05:10:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:17,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457834101] [2024-10-14 05:10:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457834101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023712006] [2024-10-14 05:10:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:17,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:17,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:17,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:17,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:10:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:17,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:10:17,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:18,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:10:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023712006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:10:18,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:10:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:10:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879842718] [2024-10-14 05:10:18,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:10:18,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:10:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:10:18,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:18,290 INFO L87 Difference]: Start difference. First operand 787 states and 1111 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:10:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:19,260 INFO L93 Difference]: Finished difference Result 1590 states and 2146 transitions. [2024-10-14 05:10:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:10:19,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-14 05:10:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:19,268 INFO L225 Difference]: With dead ends: 1590 [2024-10-14 05:10:19,268 INFO L226 Difference]: Without dead ends: 1587 [2024-10-14 05:10:19,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:10:19,270 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1325 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:19,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1626 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:10:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-10-14 05:10:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1090. [2024-10-14 05:10:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 962 states have (on average 1.3752598752598753) internal successors, (1323), 976 states have internal predecessors, (1323), 77 states have call successors, (77), 42 states have call predecessors, (77), 49 states have return successors, (106), 72 states have call predecessors, (106), 76 states have call successors, (106) [2024-10-14 05:10:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1506 transitions. [2024-10-14 05:10:19,336 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1506 transitions. Word has length 61 [2024-10-14 05:10:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1506 transitions. [2024-10-14 05:10:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:10:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1506 transitions. [2024-10-14 05:10:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:10:19,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:19,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:19,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:10:19,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:19,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:19,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1126483884, now seen corresponding path program 2 times [2024-10-14 05:10:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701022517] [2024-10-14 05:10:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:19,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:10:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:10:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701022517] [2024-10-14 05:10:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701022517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:19,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055446444] [2024-10-14 05:10:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:19,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:19,612 INFO L87 Difference]: Start difference. First operand 1090 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:10:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:20,098 INFO L93 Difference]: Finished difference Result 1718 states and 2323 transitions. [2024-10-14 05:10:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:20,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-14 05:10:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:20,103 INFO L225 Difference]: With dead ends: 1718 [2024-10-14 05:10:20,103 INFO L226 Difference]: Without dead ends: 1059 [2024-10-14 05:10:20,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:20,106 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 727 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:20,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 623 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:10:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-10-14 05:10:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 982. [2024-10-14 05:10:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 867 states have (on average 1.378316032295271) internal successors, (1195), 881 states have internal predecessors, (1195), 70 states have call successors, (70), 37 states have call predecessors, (70), 43 states have return successors, (95), 64 states have call predecessors, (95), 69 states have call successors, (95) [2024-10-14 05:10:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1360 transitions. [2024-10-14 05:10:20,160 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1360 transitions. Word has length 78 [2024-10-14 05:10:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:20,161 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1360 transitions. [2024-10-14 05:10:20,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:10:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1360 transitions. [2024-10-14 05:10:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:10:20,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:20,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:20,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:10:20,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1587975014, now seen corresponding path program 1 times [2024-10-14 05:10:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846440764] [2024-10-14 05:10:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:10:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:10:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:10:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 05:10:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846440764] [2024-10-14 05:10:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846440764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85357476] [2024-10-14 05:10:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:20,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:20,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:10:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:10:20,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:10:20,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85357476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:20,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:10:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938167681] [2024-10-14 05:10:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:10:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:10:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:20,431 INFO L87 Difference]: Start difference. First operand 982 states and 1360 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:10:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:20,538 INFO L93 Difference]: Finished difference Result 1265 states and 1716 transitions. [2024-10-14 05:10:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:10:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-14 05:10:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:20,541 INFO L225 Difference]: With dead ends: 1265 [2024-10-14 05:10:20,541 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 05:10:20,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:20,544 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 55 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:20,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 992 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 05:10:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-14 05:10:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 248 states have (on average 1.6209677419354838) internal successors, (402), 249 states have internal predecessors, (402), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 05:10:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 448 transitions. [2024-10-14 05:10:20,558 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 448 transitions. Word has length 92 [2024-10-14 05:10:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 448 transitions. [2024-10-14 05:10:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:10:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2024-10-14 05:10:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:20,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:20,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:20,583 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-10-14 05:10:20,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:20,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1803912779, now seen corresponding path program 1 times [2024-10-14 05:10:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445795368] [2024-10-14 05:10:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:20,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445795368] [2024-10-14 05:10:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445795368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823800991] [2024-10-14 05:10:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:20,909 INFO L87 Difference]: Start difference. First operand 278 states and 448 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:22,206 INFO L93 Difference]: Finished difference Result 647 states and 1060 transitions. [2024-10-14 05:10:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:22,210 INFO L225 Difference]: With dead ends: 647 [2024-10-14 05:10:22,210 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 05:10:22,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:22,212 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 764 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:22,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 499 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:10:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 05:10:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 278. [2024-10-14 05:10:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 248 states have (on average 1.6169354838709677) internal successors, (401), 249 states have internal predecessors, (401), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 05:10:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 447 transitions. [2024-10-14 05:10:22,261 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 447 transitions. Word has length 131 [2024-10-14 05:10:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 447 transitions. [2024-10-14 05:10:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 447 transitions. [2024-10-14 05:10:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:22,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:22,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:10:22,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1315865673, now seen corresponding path program 1 times [2024-10-14 05:10:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794872392] [2024-10-14 05:10:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794872392] [2024-10-14 05:10:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794872392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:22,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:10:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067971900] [2024-10-14 05:10:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:10:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:10:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:22,489 INFO L87 Difference]: Start difference. First operand 278 states and 447 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:24,686 INFO L93 Difference]: Finished difference Result 1015 states and 1671 transitions. [2024-10-14 05:10:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:10:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:24,691 INFO L225 Difference]: With dead ends: 1015 [2024-10-14 05:10:24,691 INFO L226 Difference]: Without dead ends: 753 [2024-10-14 05:10:24,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:24,693 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 1150 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:24,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 959 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 05:10:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-14 05:10:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 554. [2024-10-14 05:10:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 499 states have (on average 1.6272545090180361) internal successors, (812), 501 states have internal predecessors, (812), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-14 05:10:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 897 transitions. [2024-10-14 05:10:24,762 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 897 transitions. Word has length 131 [2024-10-14 05:10:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:24,762 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 897 transitions. [2024-10-14 05:10:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 897 transitions. [2024-10-14 05:10:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:24,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:24,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:24,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:10:24,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1251956661, now seen corresponding path program 1 times [2024-10-14 05:10:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196308146] [2024-10-14 05:10:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196308146] [2024-10-14 05:10:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196308146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506537915] [2024-10-14 05:10:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:25,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:25,029 INFO L87 Difference]: Start difference. First operand 554 states and 897 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:27,643 INFO L93 Difference]: Finished difference Result 1680 states and 2765 transitions. [2024-10-14 05:10:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:27,650 INFO L225 Difference]: With dead ends: 1680 [2024-10-14 05:10:27,650 INFO L226 Difference]: Without dead ends: 1142 [2024-10-14 05:10:27,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:27,653 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1183 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:27,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1591 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:10:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-10-14 05:10:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 809. [2024-10-14 05:10:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 729 states have (on average 1.6200274348422496) internal successors, (1181), 732 states have internal predecessors, (1181), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 05:10:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1304 transitions. [2024-10-14 05:10:27,715 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1304 transitions. Word has length 131 [2024-10-14 05:10:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:27,715 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1304 transitions. [2024-10-14 05:10:27,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1304 transitions. [2024-10-14 05:10:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:27,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:27,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:10:27,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:27,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -780600311, now seen corresponding path program 1 times [2024-10-14 05:10:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474530629] [2024-10-14 05:10:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474530629] [2024-10-14 05:10:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474530629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004737349] [2024-10-14 05:10:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:27,917 INFO L87 Difference]: Start difference. First operand 809 states and 1304 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:29,230 INFO L93 Difference]: Finished difference Result 1947 states and 3202 transitions. [2024-10-14 05:10:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:29,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:29,237 INFO L225 Difference]: With dead ends: 1947 [2024-10-14 05:10:29,237 INFO L226 Difference]: Without dead ends: 1154 [2024-10-14 05:10:29,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:29,240 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 847 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:29,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 815 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:10:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-10-14 05:10:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 809. [2024-10-14 05:10:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 729 states have (on average 1.615912208504801) internal successors, (1178), 732 states have internal predecessors, (1178), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 05:10:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1301 transitions. [2024-10-14 05:10:29,348 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1301 transitions. Word has length 131 [2024-10-14 05:10:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:29,349 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1301 transitions. [2024-10-14 05:10:29,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1301 transitions. [2024-10-14 05:10:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:29,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:29,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:29,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:10:29,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:29,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1383016263, now seen corresponding path program 1 times [2024-10-14 05:10:29,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:29,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869190981] [2024-10-14 05:10:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869190981] [2024-10-14 05:10:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869190981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020123399] [2024-10-14 05:10:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:29,595 INFO L87 Difference]: Start difference. First operand 809 states and 1301 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:30,943 INFO L93 Difference]: Finished difference Result 1943 states and 3185 transitions. [2024-10-14 05:10:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:30,949 INFO L225 Difference]: With dead ends: 1943 [2024-10-14 05:10:30,950 INFO L226 Difference]: Without dead ends: 1150 [2024-10-14 05:10:30,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:30,953 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 845 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:30,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 815 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:10:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-14 05:10:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 809. [2024-10-14 05:10:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 729 states have (on average 1.6117969821673526) internal successors, (1175), 732 states have internal predecessors, (1175), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 05:10:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1298 transitions. [2024-10-14 05:10:31,013 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1298 transitions. Word has length 131 [2024-10-14 05:10:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1298 transitions. [2024-10-14 05:10:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1298 transitions. [2024-10-14 05:10:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:31,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:31,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:10:31,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 344431689, now seen corresponding path program 1 times [2024-10-14 05:10:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944274527] [2024-10-14 05:10:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944274527] [2024-10-14 05:10:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944274527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:31,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:31,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364673573] [2024-10-14 05:10:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:31,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:31,221 INFO L87 Difference]: Start difference. First operand 809 states and 1298 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:32,319 INFO L93 Difference]: Finished difference Result 1939 states and 3168 transitions. [2024-10-14 05:10:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:32,325 INFO L225 Difference]: With dead ends: 1939 [2024-10-14 05:10:32,325 INFO L226 Difference]: Without dead ends: 1146 [2024-10-14 05:10:32,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:32,329 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 962 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:32,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 685 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:10:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-10-14 05:10:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 809. [2024-10-14 05:10:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 729 states have (on average 1.607681755829904) internal successors, (1172), 732 states have internal predecessors, (1172), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 05:10:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1295 transitions. [2024-10-14 05:10:32,393 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1295 transitions. Word has length 131 [2024-10-14 05:10:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:32,393 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1295 transitions. [2024-10-14 05:10:32,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1295 transitions. [2024-10-14 05:10:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:32,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:32,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:10:32,395 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1628733689, now seen corresponding path program 1 times [2024-10-14 05:10:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069708993] [2024-10-14 05:10:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069708993] [2024-10-14 05:10:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069708993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:32,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852347145] [2024-10-14 05:10:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:32,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:32,652 INFO L87 Difference]: Start difference. First operand 809 states and 1295 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:35,448 INFO L93 Difference]: Finished difference Result 2641 states and 4292 transitions. [2024-10-14 05:10:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:35,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:35,458 INFO L225 Difference]: With dead ends: 2641 [2024-10-14 05:10:35,458 INFO L226 Difference]: Without dead ends: 1848 [2024-10-14 05:10:35,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:35,462 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1156 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:35,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 1589 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:10:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-10-14 05:10:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1332. [2024-10-14 05:10:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1202 states have (on average 1.5998336106489184) internal successors, (1923), 1207 states have internal predecessors, (1923), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-14 05:10:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2126 transitions. [2024-10-14 05:10:35,587 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2126 transitions. Word has length 131 [2024-10-14 05:10:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:35,588 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2126 transitions. [2024-10-14 05:10:35,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2126 transitions. [2024-10-14 05:10:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:35,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:35,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:35,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:10:35,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:35,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 524373129, now seen corresponding path program 1 times [2024-10-14 05:10:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:35,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893966677] [2024-10-14 05:10:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893966677] [2024-10-14 05:10:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893966677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:35,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843712735] [2024-10-14 05:10:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:35,794 INFO L87 Difference]: Start difference. First operand 1332 states and 2126 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:37,330 INFO L93 Difference]: Finished difference Result 3151 states and 5111 transitions. [2024-10-14 05:10:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:37,341 INFO L225 Difference]: With dead ends: 3151 [2024-10-14 05:10:37,342 INFO L226 Difference]: Without dead ends: 1835 [2024-10-14 05:10:37,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:37,346 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 842 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:37,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 815 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:10:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-10-14 05:10:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1332. [2024-10-14 05:10:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1202 states have (on average 1.5956738768718801) internal successors, (1918), 1207 states have internal predecessors, (1918), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-14 05:10:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2121 transitions. [2024-10-14 05:10:37,468 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2121 transitions. Word has length 131 [2024-10-14 05:10:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:37,468 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2121 transitions. [2024-10-14 05:10:37,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2121 transitions. [2024-10-14 05:10:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:37,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:37,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:37,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:10:37,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash -98908473, now seen corresponding path program 1 times [2024-10-14 05:10:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114486474] [2024-10-14 05:10:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114486474] [2024-10-14 05:10:37,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114486474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:37,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:37,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334657954] [2024-10-14 05:10:37,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:37,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:37,709 INFO L87 Difference]: Start difference. First operand 1332 states and 2121 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:40,127 INFO L93 Difference]: Finished difference Result 4510 states and 7275 transitions. [2024-10-14 05:10:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:40,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:40,144 INFO L225 Difference]: With dead ends: 4510 [2024-10-14 05:10:40,144 INFO L226 Difference]: Without dead ends: 3194 [2024-10-14 05:10:40,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:40,150 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1222 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:40,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1042 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 05:10:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2024-10-14 05:10:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2378. [2024-10-14 05:10:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2148 states have (on average 1.5875232774674115) internal successors, (3410), 2157 states have internal predecessors, (3410), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-14 05:10:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3779 transitions. [2024-10-14 05:10:40,354 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3779 transitions. Word has length 131 [2024-10-14 05:10:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:40,355 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 3779 transitions. [2024-10-14 05:10:40,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3779 transitions. [2024-10-14 05:10:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:40,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:40,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:40,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:10:40,358 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:40,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 19533001, now seen corresponding path program 1 times [2024-10-14 05:10:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008853504] [2024-10-14 05:10:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008853504] [2024-10-14 05:10:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008853504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750660946] [2024-10-14 05:10:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:40,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:40,581 INFO L87 Difference]: Start difference. First operand 2378 states and 3779 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:43,427 INFO L93 Difference]: Finished difference Result 8254 states and 13295 transitions. [2024-10-14 05:10:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:43,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:43,455 INFO L225 Difference]: With dead ends: 8254 [2024-10-14 05:10:43,455 INFO L226 Difference]: Without dead ends: 5892 [2024-10-14 05:10:43,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:43,463 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1153 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:43,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 1589 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:10:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2024-10-14 05:10:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 4475. [2024-10-14 05:10:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 4045 states have (on average 1.5822002472187886) internal successors, (6400), 4062 states have internal predecessors, (6400), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-14 05:10:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 7119 transitions. [2024-10-14 05:10:43,849 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 7119 transitions. Word has length 131 [2024-10-14 05:10:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:43,850 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 7119 transitions. [2024-10-14 05:10:43,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 7119 transitions. [2024-10-14 05:10:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:43,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:43,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:10:43,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1408827015, now seen corresponding path program 1 times [2024-10-14 05:10:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394632437] [2024-10-14 05:10:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394632437] [2024-10-14 05:10:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394632437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:44,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:44,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988012184] [2024-10-14 05:10:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:44,068 INFO L87 Difference]: Start difference. First operand 4475 states and 7119 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:47,386 INFO L93 Difference]: Finished difference Result 17403 states and 28095 transitions. [2024-10-14 05:10:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:47,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:47,438 INFO L225 Difference]: With dead ends: 17403 [2024-10-14 05:10:47,438 INFO L226 Difference]: Without dead ends: 12944 [2024-10-14 05:10:47,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:47,456 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1441 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:47,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1578 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:10:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2024-10-14 05:10:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 8589. [2024-10-14 05:10:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8589 states, 7775 states have (on average 1.5809646302250804) internal successors, (12292), 7808 states have internal predecessors, (12292), 583 states have call successors, (583), 198 states have call predecessors, (583), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-10-14 05:10:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 13733 transitions. [2024-10-14 05:10:48,174 INFO L78 Accepts]: Start accepts. Automaton has 8589 states and 13733 transitions. Word has length 131 [2024-10-14 05:10:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:48,174 INFO L471 AbstractCegarLoop]: Abstraction has 8589 states and 13733 transitions. [2024-10-14 05:10:48,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8589 states and 13733 transitions. [2024-10-14 05:10:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:48,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:48,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:10:48,185 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:48,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash -457881659, now seen corresponding path program 1 times [2024-10-14 05:10:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:48,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486712036] [2024-10-14 05:10:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486712036] [2024-10-14 05:10:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486712036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526903887] [2024-10-14 05:10:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:48,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:48,385 INFO L87 Difference]: Start difference. First operand 8589 states and 13733 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:52,585 INFO L93 Difference]: Finished difference Result 33371 states and 54087 transitions. [2024-10-14 05:10:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:52,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:10:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:52,679 INFO L225 Difference]: With dead ends: 33371 [2024-10-14 05:10:52,679 INFO L226 Difference]: Without dead ends: 24798 [2024-10-14 05:10:52,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:52,711 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 1212 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:52,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 1582 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:10:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2024-10-14 05:10:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16894. [2024-10-14 05:10:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16894 states, 15328 states have (on average 1.580767223382046) internal successors, (24230), 15393 states have internal predecessors, (24230), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-10-14 05:10:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16894 states to 16894 states and 27245 transitions. [2024-10-14 05:10:54,299 INFO L78 Accepts]: Start accepts. Automaton has 16894 states and 27245 transitions. Word has length 131 [2024-10-14 05:10:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:54,300 INFO L471 AbstractCegarLoop]: Abstraction has 16894 states and 27245 transitions. [2024-10-14 05:10:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 16894 states and 27245 transitions. [2024-10-14 05:10:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:10:54,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:54,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:54,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:10:54,314 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:54,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1765024057, now seen corresponding path program 1 times [2024-10-14 05:10:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666592354] [2024-10-14 05:10:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:10:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:10:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:10:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:10:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666592354] [2024-10-14 05:10:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666592354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014810704] [2024-10-14 05:10:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:54,552 INFO L87 Difference]: Start difference. First operand 16894 states and 27245 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:00,060 INFO L93 Difference]: Finished difference Result 65034 states and 106237 transitions. [2024-10-14 05:11:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:11:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:00,277 INFO L225 Difference]: With dead ends: 65034 [2024-10-14 05:11:00,278 INFO L226 Difference]: Without dead ends: 48156 [2024-10-14 05:11:00,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:00,343 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 1370 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:00,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1582 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:11:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48156 states. [2024-10-14 05:11:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48156 to 33503. [2024-10-14 05:11:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33503 states, 30465 states have (on average 1.58109305760709) internal successors, (48168), 30594 states have internal predecessors, (48168), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-10-14 05:11:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33503 states to 33503 states and 54753 transitions. [2024-10-14 05:11:03,528 INFO L78 Accepts]: Start accepts. Automaton has 33503 states and 54753 transitions. Word has length 131 [2024-10-14 05:11:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:03,528 INFO L471 AbstractCegarLoop]: Abstraction has 33503 states and 54753 transitions. [2024-10-14 05:11:03,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 33503 states and 54753 transitions. [2024-10-14 05:11:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:11:03,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:03,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:03,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:11:03,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash 132472709, now seen corresponding path program 1 times [2024-10-14 05:11:03,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107931052] [2024-10-14 05:11:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:11:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:11:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:11:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:11:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107931052] [2024-10-14 05:11:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107931052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573192053] [2024-10-14 05:11:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:04,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:04,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:04,037 INFO L87 Difference]: Start difference. First operand 33503 states and 54753 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:13,150 INFO L93 Difference]: Finished difference Result 127401 states and 210819 transitions. [2024-10-14 05:11:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 05:11:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:13,682 INFO L225 Difference]: With dead ends: 127401 [2024-10-14 05:11:13,682 INFO L226 Difference]: Without dead ends: 93914 [2024-10-14 05:11:13,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:13,813 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 1192 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 3053 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:13,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 1582 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3053 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:11:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93914 states. [2024-10-14 05:11:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93914 to 66720. [2024-10-14 05:11:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66720 states, 60802 states have (on average 1.581691391730535) internal successors, (96170), 61059 states have internal predecessors, (96170), 4119 states have call successors, (4119), 1542 states have call predecessors, (4119), 1798 states have return successors, (10936), 4374 states have call predecessors, (10936), 4119 states have call successors, (10936) [2024-10-14 05:11:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66720 states to 66720 states and 111225 transitions. [2024-10-14 05:11:20,227 INFO L78 Accepts]: Start accepts. Automaton has 66720 states and 111225 transitions. Word has length 131 [2024-10-14 05:11:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:20,229 INFO L471 AbstractCegarLoop]: Abstraction has 66720 states and 111225 transitions. [2024-10-14 05:11:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 66720 states and 111225 transitions. [2024-10-14 05:11:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:11:20,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:20,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:20,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:11:20,277 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:20,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1163513607, now seen corresponding path program 1 times [2024-10-14 05:11:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513344905] [2024-10-14 05:11:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:20,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 05:11:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 05:11:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 05:11:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:11:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513344905] [2024-10-14 05:11:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513344905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634300719] [2024-10-14 05:11:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:20,702 INFO L87 Difference]: Start difference. First operand 66720 states and 111225 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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)