./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.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:00:39,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:00:39,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:00:39,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:00:39,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:00:39,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:00:39,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:00:39,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:00:39,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:00:39,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:00:39,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:00:39,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:00:39,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:00:39,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:00:39,172 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:00:39,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:00:39,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:00:39,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:00:39,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:00:39,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:00:39,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:00:39,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:00:39,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:00:39,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:00:39,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:00:39,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:00:39,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:00:39,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:00:39,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:00:39,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:00:39,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:00:39,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:00:39,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:39,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:00:39,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:00:39,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:00:39,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:00:39,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:00:39,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:00:39,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:00:39,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:00:39,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:00:39,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 [2024-10-11 05:00:39,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:00:39,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:00:39,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:00:39,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:00:39,453 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:00:39,454 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.06.cil-2.c [2024-10-11 05:00:41,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:00:41,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:00:41,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-10-11 05:00:41,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a9d6b3a3/511c508b3c6749a5b4f7a03c57957063/FLAGfae379ea9 [2024-10-11 05:00:41,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a9d6b3a3/511c508b3c6749a5b4f7a03c57957063 [2024-10-11 05:00:41,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:00:41,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:00:41,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:41,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:00:41,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:00:41,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695e1f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41, skipping insertion in model container [2024-10-11 05:00:41,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:00:41,636 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.06.cil-2.c[913,926] [2024-10-11 05:00:41,679 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.06.cil-2.c[5977,5990] [2024-10-11 05:00:41,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:41,735 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:00:41,747 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.06.cil-2.c[913,926] [2024-10-11 05:00:41,772 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.06.cil-2.c[5977,5990] [2024-10-11 05:00:41,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:41,825 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:00:41,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41 WrapperNode [2024-10-11 05:00:41,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:41,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:41,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:00:41,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:00:41,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,889 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 723 [2024-10-11 05:00:41,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:41,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:00:41,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:00:41,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:00:41,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:00:41,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:00:41,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:00:41,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:00:41,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:00:41,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (1/1) ... [2024-10-11 05:00:41,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:41,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:00:41,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:00:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:00:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:00:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:00:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-11 05:00:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-11 05:00:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:00:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:00:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:00:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:00:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:00:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:00:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:00:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:00:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:00:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:00:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:00:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:00:42,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:00:42,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:00:42,758 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-11 05:00:42,758 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:00:42,826 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:00:42,826 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 05:00:42,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:42 BoogieIcfgContainer [2024-10-11 05:00:42,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:00:42,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:00:42,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:00:42,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:00:42,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:00:41" (1/3) ... [2024-10-11 05:00:42,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3a476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:42, skipping insertion in model container [2024-10-11 05:00:42,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:41" (2/3) ... [2024-10-11 05:00:42,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3a476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:42, skipping insertion in model container [2024-10-11 05:00:42,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:42" (3/3) ... [2024-10-11 05:00:42,833 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-10-11 05:00:42,850 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:00:42,850 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:00:42,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:00:42,922 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;@50971097, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:00:42,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:00:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 235 states have (on average 1.6978723404255318) internal successors, (399), 240 states have internal predecessors, (399), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:00:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:00:42,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:42,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:42,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1695367655, now seen corresponding path program 1 times [2024-10-11 05:00:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567980391] [2024-10-11 05:00:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567980391] [2024-10-11 05:00:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567980391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615460472] [2024-10-11 05:00:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:43,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:43,284 INFO L87 Difference]: Start difference. First operand has 273 states, 235 states have (on average 1.6978723404255318) internal successors, (399), 240 states have internal predecessors, (399), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:43,844 INFO L93 Difference]: Finished difference Result 593 states and 978 transitions. [2024-10-11 05:00:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-11 05:00:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:43,868 INFO L225 Difference]: With dead ends: 593 [2024-10-11 05:00:43,868 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 05:00:43,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:43,877 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 544 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:43,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 499 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 05:00:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2024-10-11 05:00:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 282 states have (on average 1.5460992907801419) internal successors, (436), 286 states have internal predecessors, (436), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2024-10-11 05:00:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 500 transitions. [2024-10-11 05:00:43,935 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 500 transitions. Word has length 37 [2024-10-11 05:00:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 500 transitions. [2024-10-11 05:00:43,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 500 transitions. [2024-10-11 05:00:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 05:00:43,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:43,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:00:43,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1778259796, now seen corresponding path program 1 times [2024-10-11 05:00:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463556489] [2024-10-11 05:00:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 05:00:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463556489] [2024-10-11 05:00:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463556489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686760499] [2024-10-11 05:00:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:44,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:44,018 INFO L87 Difference]: Start difference. First operand 325 states and 500 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:44,607 INFO L93 Difference]: Finished difference Result 559 states and 844 transitions. [2024-10-11 05:00:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 05:00:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:44,618 INFO L225 Difference]: With dead ends: 559 [2024-10-11 05:00:44,618 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 05:00:44,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:44,620 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 557 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:44,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 493 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 05:00:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2024-10-11 05:00:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 369 states have (on average 1.5013550135501355) internal successors, (554), 374 states have internal predecessors, (554), 38 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-11 05:00:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 640 transitions. [2024-10-11 05:00:44,676 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 640 transitions. Word has length 38 [2024-10-11 05:00:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 640 transitions. [2024-10-11 05:00:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 640 transitions. [2024-10-11 05:00:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 05:00:44,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:44,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:44,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:00:44,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1372382596, now seen corresponding path program 1 times [2024-10-11 05:00:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784295961] [2024-10-11 05:00:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:00:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784295961] [2024-10-11 05:00:44,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784295961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:44,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264641795] [2024-10-11 05:00:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:44,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:44,853 INFO L87 Difference]: Start difference. First operand 425 states and 640 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:45,203 INFO L93 Difference]: Finished difference Result 845 states and 1221 transitions. [2024-10-11 05:00:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 05:00:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:45,208 INFO L225 Difference]: With dead ends: 845 [2024-10-11 05:00:45,208 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 05:00:45,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:45,211 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 232 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:45,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 681 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 05:00:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 530. [2024-10-11 05:00:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 462 states have (on average 1.4783549783549783) internal successors, (683), 469 states have internal predecessors, (683), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-10-11 05:00:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 781 transitions. [2024-10-11 05:00:45,254 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 781 transitions. Word has length 39 [2024-10-11 05:00:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 781 transitions. [2024-10-11 05:00:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 781 transitions. [2024-10-11 05:00:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 05:00:45,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:45,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:00:45,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:45,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1200848462, now seen corresponding path program 1 times [2024-10-11 05:00:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333638712] [2024-10-11 05:00:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 05:00:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:00:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333638712] [2024-10-11 05:00:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333638712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461607677] [2024-10-11 05:00:45,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:45,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:45,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:45,389 INFO L87 Difference]: Start difference. First operand 530 states and 781 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:45,779 INFO L93 Difference]: Finished difference Result 1046 states and 1498 transitions. [2024-10-11 05:00:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-11 05:00:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:45,783 INFO L225 Difference]: With dead ends: 1046 [2024-10-11 05:00:45,783 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 05:00:45,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:45,785 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 217 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:45,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 728 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 05:00:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 696. [2024-10-11 05:00:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 604 states have (on average 1.4221854304635762) internal successors, (859), 613 states have internal predecessors, (859), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (78), 54 states have call predecessors, (78), 56 states have call successors, (78) [2024-10-11 05:00:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 995 transitions. [2024-10-11 05:00:45,812 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 995 transitions. Word has length 54 [2024-10-11 05:00:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:45,813 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 995 transitions. [2024-10-11 05:00:45,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 995 transitions. [2024-10-11 05:00:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:00:45,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:45,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:45,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:00:45,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash 456550865, now seen corresponding path program 1 times [2024-10-11 05:00:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:45,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650246251] [2024-10-11 05:00:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:00:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:00:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:00:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650246251] [2024-10-11 05:00:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650246251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370256859] [2024-10-11 05:00:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:45,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:45,882 INFO L87 Difference]: Start difference. First operand 696 states and 995 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:46,321 INFO L93 Difference]: Finished difference Result 1275 states and 1774 transitions. [2024-10-11 05:00:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:46,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-11 05:00:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:46,328 INFO L225 Difference]: With dead ends: 1275 [2024-10-11 05:00:46,328 INFO L226 Difference]: Without dead ends: 873 [2024-10-11 05:00:46,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:46,330 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 543 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:46,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 505 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:00:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-11 05:00:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824. [2024-10-11 05:00:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 716 states have (on average 1.388268156424581) internal successors, (994), 727 states have internal predecessors, (994), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-10-11 05:00:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1152 transitions. [2024-10-11 05:00:46,374 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1152 transitions. Word has length 59 [2024-10-11 05:00:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:46,374 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1152 transitions. [2024-10-11 05:00:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1152 transitions. [2024-10-11 05:00:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:46,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:46,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:00:46,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1103850820, now seen corresponding path program 1 times [2024-10-11 05:00:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297287711] [2024-10-11 05:00:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297287711] [2024-10-11 05:00:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297287711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49950777] [2024-10-11 05:00:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:46,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:46,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:00:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:46,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:46,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:46,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49950777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:46,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891255796] [2024-10-11 05:00:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:46,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:46,718 INFO L87 Difference]: Start difference. First operand 824 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:46,836 INFO L93 Difference]: Finished difference Result 1312 states and 1826 transitions. [2024-10-11 05:00:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:46,845 INFO L225 Difference]: With dead ends: 1312 [2024-10-11 05:00:46,845 INFO L226 Difference]: Without dead ends: 829 [2024-10-11 05:00:46,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:46,851 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:46,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1141 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-11 05:00:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-10-11 05:00:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 721 states have (on average 1.374479889042996) internal successors, (991), 732 states have internal predecessors, (991), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-10-11 05:00:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1149 transitions. [2024-10-11 05:00:46,902 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1149 transitions. Word has length 60 [2024-10-11 05:00:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:46,903 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1149 transitions. [2024-10-11 05:00:46,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1149 transitions. [2024-10-11 05:00:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:46,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:46,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:46,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:00:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:47,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1947856322, now seen corresponding path program 1 times [2024-10-11 05:00:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587094521] [2024-10-11 05:00:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587094521] [2024-10-11 05:00:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587094521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595049681] [2024-10-11 05:00:47,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:47,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:47,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:00:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:47,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:47,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595049681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:47,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131510872] [2024-10-11 05:00:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:47,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:47,317 INFO L87 Difference]: Start difference. First operand 829 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:47,442 INFO L93 Difference]: Finished difference Result 1255 states and 1728 transitions. [2024-10-11 05:00:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:47,445 INFO L225 Difference]: With dead ends: 1255 [2024-10-11 05:00:47,445 INFO L226 Difference]: Without dead ends: 726 [2024-10-11 05:00:47,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:47,447 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:47,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1141 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-11 05:00:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 719. [2024-10-11 05:00:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 629 states have (on average 1.3799682034976153) internal successors, (868), 638 states have internal predecessors, (868), 56 states have call successors, (56), 29 states have call predecessors, (56), 32 states have return successors, (73), 52 states have call predecessors, (73), 54 states have call successors, (73) [2024-10-11 05:00:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 997 transitions. [2024-10-11 05:00:47,479 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 997 transitions. Word has length 60 [2024-10-11 05:00:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 997 transitions. [2024-10-11 05:00:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 997 transitions. [2024-10-11 05:00:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:47,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:47,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:47,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:00:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:47,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -150216706, now seen corresponding path program 1 times [2024-10-11 05:00:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254392749] [2024-10-11 05:00:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254392749] [2024-10-11 05:00:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254392749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:00:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253126793] [2024-10-11 05:00:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:47,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:00:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:00:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:47,798 INFO L87 Difference]: Start difference. First operand 719 states and 997 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:48,340 INFO L93 Difference]: Finished difference Result 804 states and 1100 transitions. [2024-10-11 05:00:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:00:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-11 05:00:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:48,345 INFO L225 Difference]: With dead ends: 804 [2024-10-11 05:00:48,345 INFO L226 Difference]: Without dead ends: 801 [2024-10-11 05:00:48,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:48,348 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 923 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:48,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 502 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-11 05:00:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 718. [2024-10-11 05:00:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 629 states have (on average 1.3767885532591415) internal successors, (866), 637 states have internal predecessors, (866), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (73), 52 states have call predecessors, (73), 54 states have call successors, (73) [2024-10-11 05:00:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 994 transitions. [2024-10-11 05:00:48,387 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 994 transitions. Word has length 60 [2024-10-11 05:00:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:48,387 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 994 transitions. [2024-10-11 05:00:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 994 transitions. [2024-10-11 05:00:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 05:00:48,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:48,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:00:48,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -362710222, now seen corresponding path program 1 times [2024-10-11 05:00:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27050434] [2024-10-11 05:00:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:48,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27050434] [2024-10-11 05:00:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27050434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817793865] [2024-10-11 05:00:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:48,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:48,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:00:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:00:48,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:48,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:00:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817793865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:00:48,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:00:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-11 05:00:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121401937] [2024-10-11 05:00:48,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:00:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:00:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:00:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:48,835 INFO L87 Difference]: Start difference. First operand 718 states and 994 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:49,440 INFO L93 Difference]: Finished difference Result 1521 states and 2029 transitions. [2024-10-11 05:00:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:00:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-11 05:00:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:49,446 INFO L225 Difference]: With dead ends: 1521 [2024-10-11 05:00:49,447 INFO L226 Difference]: Without dead ends: 1518 [2024-10-11 05:00:49,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:00:49,448 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 732 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:49,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1431 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-11 05:00:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1021. [2024-10-11 05:00:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 896 states have (on average 1.3526785714285714) internal successors, (1212), 910 states have internal predecessors, (1212), 74 states have call successors, (74), 42 states have call predecessors, (74), 49 states have return successors, (103), 69 states have call predecessors, (103), 73 states have call successors, (103) [2024-10-11 05:00:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1389 transitions. [2024-10-11 05:00:49,514 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1389 transitions. Word has length 61 [2024-10-11 05:00:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1389 transitions. [2024-10-11 05:00:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1389 transitions. [2024-10-11 05:00:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:00:49,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:49,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:49,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:00:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:49,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:49,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 447226569, now seen corresponding path program 2 times [2024-10-11 05:00:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069817968] [2024-10-11 05:00:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:00:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:00:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069817968] [2024-10-11 05:00:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069817968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:49,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296926094] [2024-10-11 05:00:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:49,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:49,795 INFO L87 Difference]: Start difference. First operand 1021 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:50,111 INFO L93 Difference]: Finished difference Result 1649 states and 2206 transitions. [2024-10-11 05:00:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-11 05:00:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:50,115 INFO L225 Difference]: With dead ends: 1649 [2024-10-11 05:00:50,115 INFO L226 Difference]: Without dead ends: 990 [2024-10-11 05:00:50,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:50,117 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 556 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:50,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 521 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-11 05:00:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 913. [2024-10-11 05:00:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 801 states have (on average 1.3533083645443196) internal successors, (1084), 815 states have internal predecessors, (1084), 67 states have call successors, (67), 37 states have call predecessors, (67), 43 states have return successors, (92), 61 states have call predecessors, (92), 66 states have call successors, (92) [2024-10-11 05:00:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1243 transitions. [2024-10-11 05:00:50,159 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1243 transitions. Word has length 78 [2024-10-11 05:00:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:50,160 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1243 transitions. [2024-10-11 05:00:50,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1243 transitions. [2024-10-11 05:00:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:50,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:50,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:00:50,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:50,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 48056276, now seen corresponding path program 1 times [2024-10-11 05:00:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:50,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122404739] [2024-10-11 05:00:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 05:00:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 05:00:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:00:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:00:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122404739] [2024-10-11 05:00:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122404739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40739797] [2024-10-11 05:00:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:50,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:50,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:00:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:00:50,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:00:50,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40739797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:50,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:00:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345264601] [2024-10-11 05:00:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:50,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:00:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:00:50,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:50,472 INFO L87 Difference]: Start difference. First operand 913 states and 1243 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:00:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:50,599 INFO L93 Difference]: Finished difference Result 1196 states and 1599 transitions. [2024-10-11 05:00:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:00:50,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-11 05:00:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:50,601 INFO L225 Difference]: With dead ends: 1196 [2024-10-11 05:00:50,601 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 05:00:50,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:50,603 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 55 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:50,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 776 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 05:00:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-11 05:00:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.598901098901099) internal successors, (291), 183 states have internal predecessors, (291), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:00:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 331 transitions. [2024-10-11 05:00:50,630 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 331 transitions. Word has length 92 [2024-10-11 05:00:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 331 transitions. [2024-10-11 05:00:50,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:00:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 331 transitions. [2024-10-11 05:00:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:50,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:50,631 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] [2024-10-11 05:00:50,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 05:00:50,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:00:50,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash -9347914, now seen corresponding path program 1 times [2024-10-11 05:00:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149313126] [2024-10-11 05:00:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149313126] [2024-10-11 05:00:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149313126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:00:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528978162] [2024-10-11 05:00:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:50,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:00:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:00:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:50,917 INFO L87 Difference]: Start difference. First operand 209 states and 331 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:51,694 INFO L93 Difference]: Finished difference Result 480 states and 774 transitions. [2024-10-11 05:00:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:00:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:51,697 INFO L225 Difference]: With dead ends: 480 [2024-10-11 05:00:51,697 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 05:00:51,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:51,698 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 552 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:51,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 376 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:00:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 05:00:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 209. [2024-10-11 05:00:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 183 states have internal predecessors, (290), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 05:00:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2024-10-11 05:00:51,738 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 101 [2024-10-11 05:00:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:51,738 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2024-10-11 05:00:51,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2024-10-11 05:00:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:51,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:51,740 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] [2024-10-11 05:00:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:00:51,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:51,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 19152376, now seen corresponding path program 1 times [2024-10-11 05:00:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450453737] [2024-10-11 05:00:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450453737] [2024-10-11 05:00:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450453737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:00:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761600379] [2024-10-11 05:00:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:00:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:00:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:51,903 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:53,195 INFO L93 Difference]: Finished difference Result 748 states and 1212 transitions. [2024-10-11 05:00:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:00:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:53,198 INFO L225 Difference]: With dead ends: 748 [2024-10-11 05:00:53,198 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:00:53,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:53,204 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 823 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:53,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 631 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:00:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:00:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 413. [2024-10-11 05:00:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 364 states have (on average 1.6043956043956045) internal successors, (584), 366 states have internal predecessors, (584), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-11 05:00:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 657 transitions. [2024-10-11 05:00:53,254 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 657 transitions. Word has length 101 [2024-10-11 05:00:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:53,254 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 657 transitions. [2024-10-11 05:00:53,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 657 transitions. [2024-10-11 05:00:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:53,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:53,257 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] [2024-10-11 05:00:53,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:00:53,257 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:53,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1939422410, now seen corresponding path program 1 times [2024-10-11 05:00:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:53,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933811245] [2024-10-11 05:00:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:53,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933811245] [2024-10-11 05:00:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933811245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411197756] [2024-10-11 05:00:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:53,545 INFO L87 Difference]: Start difference. First operand 413 states and 657 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:55,320 INFO L93 Difference]: Finished difference Result 1233 states and 1994 transitions. [2024-10-11 05:00:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:00:55,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:55,325 INFO L225 Difference]: With dead ends: 1233 [2024-10-11 05:00:55,325 INFO L226 Difference]: Without dead ends: 833 [2024-10-11 05:00:55,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:00:55,327 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 844 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:55,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1186 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:00:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-10-11 05:00:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 602. [2024-10-11 05:00:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5969868173258004) internal successors, (848), 534 states have internal predecessors, (848), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 05:00:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2024-10-11 05:00:55,360 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 101 [2024-10-11 05:00:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2024-10-11 05:00:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2024-10-11 05:00:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:55,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:55,361 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] [2024-10-11 05:00:55,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:00:55,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:55,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -62939592, now seen corresponding path program 1 times [2024-10-11 05:00:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:55,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370213035] [2024-10-11 05:00:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:55,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:55,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370213035] [2024-10-11 05:00:55,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370213035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158503167] [2024-10-11 05:00:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:55,495 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:56,333 INFO L93 Difference]: Finished difference Result 1428 states and 2308 transitions. [2024-10-11 05:00:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:56,340 INFO L225 Difference]: With dead ends: 1428 [2024-10-11 05:00:56,340 INFO L226 Difference]: Without dead ends: 839 [2024-10-11 05:00:56,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:56,342 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 613 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:56,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 602 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:00:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-11 05:00:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 602. [2024-10-11 05:00:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.591337099811676) internal successors, (845), 534 states have internal predecessors, (845), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 05:00:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 950 transitions. [2024-10-11 05:00:56,375 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 950 transitions. Word has length 101 [2024-10-11 05:00:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:56,375 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 950 transitions. [2024-10-11 05:00:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 950 transitions. [2024-10-11 05:00:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:56,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:56,376 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] [2024-10-11 05:00:56,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:00:56,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1261916602, now seen corresponding path program 1 times [2024-10-11 05:00:56,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:56,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915233417] [2024-10-11 05:00:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:56,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915233417] [2024-10-11 05:00:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915233417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:56,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859269410] [2024-10-11 05:00:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:56,492 INFO L87 Difference]: Start difference. First operand 602 states and 950 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:57,188 INFO L93 Difference]: Finished difference Result 1424 states and 2291 transitions. [2024-10-11 05:00:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:57,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:57,197 INFO L225 Difference]: With dead ends: 1424 [2024-10-11 05:00:57,197 INFO L226 Difference]: Without dead ends: 835 [2024-10-11 05:00:57,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:57,203 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 697 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:57,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 505 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-11 05:00:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 602. [2024-10-11 05:00:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5856873822975517) internal successors, (842), 534 states have internal predecessors, (842), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 05:00:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 947 transitions. [2024-10-11 05:00:57,289 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 947 transitions. Word has length 101 [2024-10-11 05:00:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:57,290 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 947 transitions. [2024-10-11 05:00:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 947 transitions. [2024-10-11 05:00:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:57,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:57,291 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] [2024-10-11 05:00:57,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:00:57,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1466292744, now seen corresponding path program 1 times [2024-10-11 05:00:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617866980] [2024-10-11 05:00:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:57,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617866980] [2024-10-11 05:00:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617866980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:57,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205163889] [2024-10-11 05:00:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:57,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:57,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:57,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:57,664 INFO L87 Difference]: Start difference. First operand 602 states and 947 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:58,753 INFO L93 Difference]: Finished difference Result 1420 states and 2274 transitions. [2024-10-11 05:00:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:00:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:58,762 INFO L225 Difference]: With dead ends: 1420 [2024-10-11 05:00:58,762 INFO L226 Difference]: Without dead ends: 831 [2024-10-11 05:00:58,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:58,764 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 609 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:58,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 602 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:00:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-11 05:00:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 602. [2024-10-11 05:00:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5800376647834276) internal successors, (839), 534 states have internal predecessors, (839), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 05:00:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 944 transitions. [2024-10-11 05:00:58,831 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 944 transitions. Word has length 101 [2024-10-11 05:00:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 944 transitions. [2024-10-11 05:00:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 944 transitions. [2024-10-11 05:00:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:00:58,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:58,833 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] [2024-10-11 05:00:58,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:00:58,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:58,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1770836474, now seen corresponding path program 1 times [2024-10-11 05:00:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904086389] [2024-10-11 05:00:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:00:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:00:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:00:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:00:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904086389] [2024-10-11 05:00:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904086389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61408738] [2024-10-11 05:00:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:58,986 INFO L87 Difference]: Start difference. First operand 602 states and 944 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:00,556 INFO L93 Difference]: Finished difference Result 1930 states and 3068 transitions. [2024-10-11 05:01:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:01:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:00,564 INFO L225 Difference]: With dead ends: 1930 [2024-10-11 05:01:00,564 INFO L226 Difference]: Without dead ends: 1341 [2024-10-11 05:01:00,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:01:00,567 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 817 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:00,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1184 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:01:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-10-11 05:01:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 993. [2024-10-11 05:01:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 878 states have (on average 1.571753986332574) internal successors, (1380), 883 states have internal predecessors, (1380), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 05:01:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1553 transitions. [2024-10-11 05:01:00,630 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1553 transitions. Word has length 101 [2024-10-11 05:01:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1553 transitions. [2024-10-11 05:01:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1553 transitions. [2024-10-11 05:01:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:00,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:00,631 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] [2024-10-11 05:01:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:01:00,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:00,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 628334008, now seen corresponding path program 1 times [2024-10-11 05:01:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279336772] [2024-10-11 05:01:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279336772] [2024-10-11 05:01:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279336772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396773012] [2024-10-11 05:01:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:00,765 INFO L87 Difference]: Start difference. First operand 993 states and 1553 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:02,871 INFO L93 Difference]: Finished difference Result 3621 states and 5739 transitions. [2024-10-11 05:01:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:02,884 INFO L225 Difference]: With dead ends: 3621 [2024-10-11 05:01:02,884 INFO L226 Difference]: Without dead ends: 2641 [2024-10-11 05:01:02,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:02,887 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 872 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:02,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1177 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:01:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2024-10-11 05:01:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1762. [2024-10-11 05:01:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1563 states have (on average 1.564939219449776) internal successors, (2446), 1572 states have internal predecessors, (2446), 136 states have call successors, (136), 54 states have call predecessors, (136), 62 states have return successors, (171), 143 states have call predecessors, (171), 136 states have call successors, (171) [2024-10-11 05:01:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2753 transitions. [2024-10-11 05:01:03,035 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2753 transitions. Word has length 101 [2024-10-11 05:01:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2753 transitions. [2024-10-11 05:01:03,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2753 transitions. [2024-10-11 05:01:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:03,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:03,038 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] [2024-10-11 05:01:03,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:01:03,038 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 868573754, now seen corresponding path program 1 times [2024-10-11 05:01:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787497231] [2024-10-11 05:01:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787497231] [2024-10-11 05:01:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787497231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134118699] [2024-10-11 05:01:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:03,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:03,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:03,169 INFO L87 Difference]: Start difference. First operand 1762 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:05,154 INFO L93 Difference]: Finished difference Result 6564 states and 10393 transitions. [2024-10-11 05:01:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:05,175 INFO L225 Difference]: With dead ends: 6564 [2024-10-11 05:01:05,175 INFO L226 Difference]: Without dead ends: 4815 [2024-10-11 05:01:05,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:05,180 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1051 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:05,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 820 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:01:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2024-10-11 05:01:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3259. [2024-10-11 05:01:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2896 states have (on average 1.5607734806629834) internal successors, (4520), 2913 states have internal predecessors, (4520), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-11 05:01:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5105 transitions. [2024-10-11 05:01:05,435 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5105 transitions. Word has length 101 [2024-10-11 05:01:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:05,436 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5105 transitions. [2024-10-11 05:01:05,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5105 transitions. [2024-10-11 05:01:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:05,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:05,440 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] [2024-10-11 05:01:05,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:01:05,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:05,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1707607416, now seen corresponding path program 1 times [2024-10-11 05:01:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:05,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3371681] [2024-10-11 05:01:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:05,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3371681] [2024-10-11 05:01:05,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3371681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052720006] [2024-10-11 05:01:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:05,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:05,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:05,570 INFO L87 Difference]: Start difference. First operand 3259 states and 5105 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:06,722 INFO L93 Difference]: Finished difference Result 7468 states and 11865 transitions. [2024-10-11 05:01:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:06,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:06,748 INFO L225 Difference]: With dead ends: 7468 [2024-10-11 05:01:06,749 INFO L226 Difference]: Without dead ends: 4222 [2024-10-11 05:01:06,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:01:06,761 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 613 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:06,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 601 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:01:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2024-10-11 05:01:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3259. [2024-10-11 05:01:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2896 states have (on average 1.554903314917127) internal successors, (4503), 2913 states have internal predecessors, (4503), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-11 05:01:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5088 transitions. [2024-10-11 05:01:07,017 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5088 transitions. Word has length 101 [2024-10-11 05:01:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:07,017 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5088 transitions. [2024-10-11 05:01:07,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5088 transitions. [2024-10-11 05:01:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:07,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:07,019 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] [2024-10-11 05:01:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:01:07,020 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1734673018, now seen corresponding path program 1 times [2024-10-11 05:01:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132943652] [2024-10-11 05:01:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132943652] [2024-10-11 05:01:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132943652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:07,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:07,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138940942] [2024-10-11 05:01:07,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:07,156 INFO L87 Difference]: Start difference. First operand 3259 states and 5088 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:09,250 INFO L93 Difference]: Finished difference Result 11799 states and 18643 transitions. [2024-10-11 05:01:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:09,280 INFO L225 Difference]: With dead ends: 11799 [2024-10-11 05:01:09,280 INFO L226 Difference]: Without dead ends: 8553 [2024-10-11 05:01:09,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:09,289 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 893 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1177 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:01:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2024-10-11 05:01:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 6326. [2024-10-11 05:01:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 5643 states have (on average 1.553251816409711) internal successors, (8765), 5676 states have internal predecessors, (8765), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-11 05:01:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 9944 transitions. [2024-10-11 05:01:09,862 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 9944 transitions. Word has length 101 [2024-10-11 05:01:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 6326 states and 9944 transitions. [2024-10-11 05:01:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 9944 transitions. [2024-10-11 05:01:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:09,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:09,870 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] [2024-10-11 05:01:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:01:09,871 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash -826189828, now seen corresponding path program 1 times [2024-10-11 05:01:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396497526] [2024-10-11 05:01:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396497526] [2024-10-11 05:01:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396497526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442704502] [2024-10-11 05:01:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:10,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:10,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:10,025 INFO L87 Difference]: Start difference. First operand 6326 states and 9944 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:11,410 INFO L93 Difference]: Finished difference Result 14300 states and 22764 transitions. [2024-10-11 05:01:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:11,451 INFO L225 Difference]: With dead ends: 14300 [2024-10-11 05:01:11,451 INFO L226 Difference]: Without dead ends: 7987 [2024-10-11 05:01:11,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:01:11,469 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 697 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:11,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 504 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:01:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2024-10-11 05:01:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6326. [2024-10-11 05:01:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 5643 states have (on average 1.547403863193337) internal successors, (8732), 5676 states have internal predecessors, (8732), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-11 05:01:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 9911 transitions. [2024-10-11 05:01:12,220 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 9911 transitions. Word has length 101 [2024-10-11 05:01:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:12,221 INFO L471 AbstractCegarLoop]: Abstraction has 6326 states and 9911 transitions. [2024-10-11 05:01:12,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 9911 transitions. [2024-10-11 05:01:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:12,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:12,227 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] [2024-10-11 05:01:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:01:12,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 61033018, now seen corresponding path program 1 times [2024-10-11 05:01:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022200575] [2024-10-11 05:01:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:12,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:12,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022200575] [2024-10-11 05:01:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022200575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:12,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170370156] [2024-10-11 05:01:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:12,354 INFO L87 Difference]: Start difference. First operand 6326 states and 9911 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:15,005 INFO L93 Difference]: Finished difference Result 22174 states and 35109 transitions. [2024-10-11 05:01:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:15,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:15,063 INFO L225 Difference]: With dead ends: 22174 [2024-10-11 05:01:15,063 INFO L226 Difference]: Without dead ends: 15861 [2024-10-11 05:01:15,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:15,082 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 812 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1177 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:01:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15861 states. [2024-10-11 05:01:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15861 to 12488. [2024-10-11 05:01:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12488 states, 11181 states have (on average 1.5454789374832305) internal successors, (17280), 11246 states have internal predecessors, (17280), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-11 05:01:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12488 states to 12488 states and 19777 transitions. [2024-10-11 05:01:16,661 INFO L78 Accepts]: Start accepts. Automaton has 12488 states and 19777 transitions. Word has length 101 [2024-10-11 05:01:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 12488 states and 19777 transitions. [2024-10-11 05:01:16,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 12488 states and 19777 transitions. [2024-10-11 05:01:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:16,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:16,670 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] [2024-10-11 05:01:16,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:01:16,670 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1850009540, now seen corresponding path program 1 times [2024-10-11 05:01:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609719986] [2024-10-11 05:01:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609719986] [2024-10-11 05:01:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609719986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:01:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800739543] [2024-10-11 05:01:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:01:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:01:16,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:16,804 INFO L87 Difference]: Start difference. First operand 12488 states and 19777 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:18,697 INFO L93 Difference]: Finished difference Result 27995 states and 44699 transitions. [2024-10-11 05:01:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:18,750 INFO L225 Difference]: With dead ends: 27995 [2024-10-11 05:01:18,750 INFO L226 Difference]: Without dead ends: 15521 [2024-10-11 05:01:18,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:01:18,784 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 272 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:18,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 678 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:01:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2024-10-11 05:01:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 12618. [2024-10-11 05:01:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 11311 states have (on average 1.5392096189549995) internal successors, (17410), 11376 states have internal predecessors, (17410), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-11 05:01:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 19907 transitions. [2024-10-11 05:01:19,938 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 19907 transitions. Word has length 101 [2024-10-11 05:01:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:19,938 INFO L471 AbstractCegarLoop]: Abstraction has 12618 states and 19907 transitions. [2024-10-11 05:01:19,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 19907 transitions. [2024-10-11 05:01:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 05:01:19,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:19,946 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] [2024-10-11 05:01:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:01:19,947 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 758777918, now seen corresponding path program 1 times [2024-10-11 05:01:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245648702] [2024-10-11 05:01:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:20,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245648702] [2024-10-11 05:01:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245648702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223476189] [2024-10-11 05:01:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:20,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:20,084 INFO L87 Difference]: Start difference. First operand 12618 states and 19907 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:25,933 INFO L93 Difference]: Finished difference Result 57637 states and 92903 transitions. [2024-10-11 05:01:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:01:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 05:01:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:26,147 INFO L225 Difference]: With dead ends: 57637 [2024-10-11 05:01:26,147 INFO L226 Difference]: Without dead ends: 45033 [2024-10-11 05:01:26,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:01:26,215 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 2180 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:26,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 1007 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:01:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45033 states. [2024-10-11 05:01:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45033 to 36903. [2024-10-11 05:01:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36903 states, 33036 states have (on average 1.5309662186705413) internal successors, (50577), 33328 states have internal predecessors, (50577), 2498 states have call successors, (2498), 1176 states have call predecessors, (2498), 1368 states have return successors, (5226), 2462 states have call predecessors, (5226), 2498 states have call successors, (5226) [2024-10-11 05:01:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36903 states to 36903 states and 58301 transitions. [2024-10-11 05:01:29,684 INFO L78 Accepts]: Start accepts. Automaton has 36903 states and 58301 transitions. Word has length 101 [2024-10-11 05:01:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:29,685 INFO L471 AbstractCegarLoop]: Abstraction has 36903 states and 58301 transitions. [2024-10-11 05:01:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 36903 states and 58301 transitions. [2024-10-11 05:01:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 05:01:29,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:29,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:29,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:01:29,883 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:29,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2053074634, now seen corresponding path program 1 times [2024-10-11 05:01:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:29,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778746277] [2024-10-11 05:01:29,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:29,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 05:01:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 05:01:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:01:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778746277] [2024-10-11 05:01:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778746277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999274422] [2024-10-11 05:01:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:29,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:29,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:29,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:01:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:30,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 05:01:30,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:30,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999274422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:30,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:30,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308671370] [2024-10-11 05:01:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:30,164 INFO L87 Difference]: Start difference. First operand 36903 states and 58301 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:36,307 INFO L93 Difference]: Finished difference Result 109896 states and 175258 transitions. [2024-10-11 05:01:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:36,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 163 [2024-10-11 05:01:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:36,643 INFO L225 Difference]: With dead ends: 109896 [2024-10-11 05:01:36,644 INFO L226 Difference]: Without dead ends: 73007 [2024-10-11 05:01:36,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:36,749 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 273 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:36,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 566 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73007 states. [2024-10-11 05:01:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73007 to 72809. [2024-10-11 05:01:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72809 states, 65276 states have (on average 1.5283411973772902) internal successors, (99764), 65859 states have internal predecessors, (99764), 4796 states have call successors, (4796), 2352 states have call predecessors, (4796), 2736 states have return successors, (10090), 4661 states have call predecessors, (10090), 4796 states have call successors, (10090) [2024-10-11 05:01:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72809 states to 72809 states and 114650 transitions. [2024-10-11 05:01:43,381 INFO L78 Accepts]: Start accepts. Automaton has 72809 states and 114650 transitions. Word has length 163 [2024-10-11 05:01:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:43,381 INFO L471 AbstractCegarLoop]: Abstraction has 72809 states and 114650 transitions. [2024-10-11 05:01:43,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72809 states and 114650 transitions. [2024-10-11 05:01:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 05:01:43,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:43,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:43,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 05:01:43,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 05:01:43,669 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:43,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1087237674, now seen corresponding path program 1 times [2024-10-11 05:01:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881838005] [2024-10-11 05:01:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:43,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:01:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:01:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:01:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:01:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 05:01:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 05:01:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:01:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881838005] [2024-10-11 05:01:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881838005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747644480] [2024-10-11 05:01:43,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:43,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:43,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:01:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:43,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 05:01:43,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747644480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092893533] [2024-10-11 05:01:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:43,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:43,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:43,943 INFO L87 Difference]: Start difference. First operand 72809 states and 114650 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)