./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.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71189e3cc465fa9296e61b90c4b4428a637cf1ec8723797967b75b70226f0c15 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:41:19,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:41:20,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:41:20,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:41:20,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:41:20,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:41:20,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:41:20,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:41:20,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:41:20,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:41:20,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:41:20,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:41:20,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:41:20,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:41:20,060 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:41:20,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:41:20,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:41:20,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:41:20,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:41:20,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:41:20,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:41:20,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:41:20,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:41:20,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:41:20,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:41:20,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:41:20,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:41:20,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:41:20,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:41:20,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:41:20,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:41:20,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:41:20,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:20,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:41:20,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:41:20,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:41:20,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:41:20,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:41:20,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:41:20,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:41:20,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:41:20,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:41:20,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71189e3cc465fa9296e61b90c4b4428a637cf1ec8723797967b75b70226f0c15 [2024-10-12 21:41:20,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:41:20,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:41:20,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:41:20,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:41:20,325 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:41:20,327 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.08.cil-1.c [2024-10-12 21:41:21,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:41:21,870 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:41:21,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-1.c [2024-10-12 21:41:21,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dfc8d84/244866e0f1fc41b684db787e63b93be7/FLAGad8b43560 [2024-10-12 21:41:22,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dfc8d84/244866e0f1fc41b684db787e63b93be7 [2024-10-12 21:41:22,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:41:22,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:41:22,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:22,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:41:22,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:41:22,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d0ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22, skipping insertion in model container [2024-10-12 21:41:22,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:41:22,434 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.08.cil-1.c[913,926] [2024-10-12 21:41:22,465 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.08.cil-1.c[5977,5990] [2024-10-12 21:41:22,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:22,531 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:41:22,552 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.08.cil-1.c[913,926] [2024-10-12 21:41:22,572 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.08.cil-1.c[5977,5990] [2024-10-12 21:41:22,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:22,679 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:41:22,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22 WrapperNode [2024-10-12 21:41:22,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:22,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:22,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:41:22,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:41:22,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,778 INFO L138 Inliner]: procedures = 64, calls = 72, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 843 [2024-10-12 21:41:22,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:22,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:41:22,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:41:22,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:41:22,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:41:22,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:41:22,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:41:22,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:41:22,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:41:22,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (1/1) ... [2024-10-12 21:41:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:22,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:22,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:41:22,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:41:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:41:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:41:22,942 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:41:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:41:22,943 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:41:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:41:22,944 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:41:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:41:22,944 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:41:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:41:22,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:41:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:41:22,945 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:41:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:41:22,945 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:41:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:41:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:41:22,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:41:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:41:22,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:41:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:41:22,946 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:41:23,059 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:41:23,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:41:23,750 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-12 21:41:23,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:41:23,853 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:41:23,853 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-12 21:41:23,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:23 BoogieIcfgContainer [2024-10-12 21:41:23,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:41:23,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:41:23,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:41:23,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:41:23,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:41:22" (1/3) ... [2024-10-12 21:41:23,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72db0ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:23, skipping insertion in model container [2024-10-12 21:41:23,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:22" (2/3) ... [2024-10-12 21:41:23,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72db0ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:23, skipping insertion in model container [2024-10-12 21:41:23,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:23" (3/3) ... [2024-10-12 21:41:23,872 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-1.c [2024-10-12 21:41:23,898 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:41:23,902 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:41:24,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:41:24,035 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;@47b225e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:41:24,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:41:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 319 states, 279 states have (on average 1.7096774193548387) internal successors, (477), 284 states have internal predecessors, (477), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-12 21:41:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:24,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:24,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:24,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:24,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash 684512501, now seen corresponding path program 1 times [2024-10-12 21:41:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43607203] [2024-10-12 21:41:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43607203] [2024-10-12 21:41:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43607203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864621492] [2024-10-12 21:41:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:24,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:24,306 INFO L87 Difference]: Start difference. First operand has 319 states, 279 states have (on average 1.7096774193548387) internal successors, (477), 284 states have internal predecessors, (477), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:41:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:24,838 INFO L93 Difference]: Finished difference Result 628 states and 1044 transitions. [2024-10-12 21:41:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-12 21:41:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:24,852 INFO L225 Difference]: With dead ends: 628 [2024-10-12 21:41:24,852 INFO L226 Difference]: Without dead ends: 322 [2024-10-12 21:41:24,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:24,861 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 286 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:24,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 687 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-12 21:41:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2024-10-12 21:41:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 276 states have (on average 1.5905797101449275) internal successors, (439), 279 states have internal predecessors, (439), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:41:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 493 transitions. [2024-10-12 21:41:24,925 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 493 transitions. Word has length 37 [2024-10-12 21:41:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:24,926 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 493 transitions. [2024-10-12 21:41:24,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:41:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 493 transitions. [2024-10-12 21:41:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:24,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:24,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:24,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:41:24,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1366471497, now seen corresponding path program 1 times [2024-10-12 21:41:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051489230] [2024-10-12 21:41:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051489230] [2024-10-12 21:41:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051489230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139164615] [2024-10-12 21:41:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:25,022 INFO L87 Difference]: Start difference. First operand 314 states and 493 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:25,345 INFO L93 Difference]: Finished difference Result 433 states and 665 transitions. [2024-10-12 21:41:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-12 21:41:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:25,348 INFO L225 Difference]: With dead ends: 433 [2024-10-12 21:41:25,348 INFO L226 Difference]: Without dead ends: 377 [2024-10-12 21:41:25,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:25,350 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 652 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:25,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 557 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-12 21:41:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 371. [2024-10-12 21:41:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 326 states have (on average 1.5582822085889572) internal successors, (508), 330 states have internal predecessors, (508), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-10-12 21:41:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 576 transitions. [2024-10-12 21:41:25,367 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 576 transitions. Word has length 37 [2024-10-12 21:41:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:25,367 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 576 transitions. [2024-10-12 21:41:25,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 576 transitions. [2024-10-12 21:41:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:41:25,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:25,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:41:25,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 926183912, now seen corresponding path program 1 times [2024-10-12 21:41:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941308917] [2024-10-12 21:41:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:41:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:25,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941308917] [2024-10-12 21:41:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941308917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:25,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:25,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:25,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730899195] [2024-10-12 21:41:25,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:25,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:25,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:25,414 INFO L87 Difference]: Start difference. First operand 371 states and 576 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:25,731 INFO L93 Difference]: Finished difference Result 605 states and 920 transitions. [2024-10-12 21:41:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-12 21:41:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:25,734 INFO L225 Difference]: With dead ends: 605 [2024-10-12 21:41:25,734 INFO L226 Difference]: Without dead ends: 494 [2024-10-12 21:41:25,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:25,736 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 670 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:25,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 560 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-12 21:41:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 471. [2024-10-12 21:41:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 413 states have (on average 1.5157384987893463) internal successors, (626), 418 states have internal predecessors, (626), 40 states have call successors, (40), 15 states have call predecessors, (40), 16 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2024-10-12 21:41:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 716 transitions. [2024-10-12 21:41:25,758 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 716 transitions. Word has length 38 [2024-10-12 21:41:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 716 transitions. [2024-10-12 21:41:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 716 transitions. [2024-10-12 21:41:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:41:25,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:25,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:25,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:41:25,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:25,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2063654889, now seen corresponding path program 1 times [2024-10-12 21:41:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598013603] [2024-10-12 21:41:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:41:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598013603] [2024-10-12 21:41:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598013603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:25,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:25,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122939871] [2024-10-12 21:41:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:25,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:25,802 INFO L87 Difference]: Start difference. First operand 471 states and 716 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:26,210 INFO L93 Difference]: Finished difference Result 891 states and 1297 transitions. [2024-10-12 21:41:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-12 21:41:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:26,217 INFO L225 Difference]: With dead ends: 891 [2024-10-12 21:41:26,217 INFO L226 Difference]: Without dead ends: 680 [2024-10-12 21:41:26,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:26,219 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 269 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:26,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 782 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-12 21:41:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 576. [2024-10-12 21:41:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 506 states have (on average 1.492094861660079) internal successors, (755), 513 states have internal predecessors, (755), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (56), 42 states have call predecessors, (56), 44 states have call successors, (56) [2024-10-12 21:41:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 857 transitions. [2024-10-12 21:41:26,258 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 857 transitions. Word has length 39 [2024-10-12 21:41:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:26,259 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 857 transitions. [2024-10-12 21:41:26,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 857 transitions. [2024-10-12 21:41:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:41:26,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:26,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:26,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:41:26,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:26,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -629290764, now seen corresponding path program 1 times [2024-10-12 21:41:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622341394] [2024-10-12 21:41:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:41:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:41:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622341394] [2024-10-12 21:41:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622341394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104541463] [2024-10-12 21:41:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:26,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:26,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:26,335 INFO L87 Difference]: Start difference. First operand 576 states and 857 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:26,840 INFO L93 Difference]: Finished difference Result 881 states and 1279 transitions. [2024-10-12 21:41:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-12 21:41:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:26,844 INFO L225 Difference]: With dead ends: 881 [2024-10-12 21:41:26,845 INFO L226 Difference]: Without dead ends: 670 [2024-10-12 21:41:26,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:26,848 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 254 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:26,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 827 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-12 21:41:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 636. [2024-10-12 21:41:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 557 states have (on average 1.4649910233393177) internal successors, (816), 565 states have internal predecessors, (816), 51 states have call successors, (51), 24 states have call predecessors, (51), 26 states have return successors, (65), 47 states have call predecessors, (65), 49 states have call successors, (65) [2024-10-12 21:41:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 932 transitions. [2024-10-12 21:41:26,893 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 932 transitions. Word has length 54 [2024-10-12 21:41:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:26,894 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 932 transitions. [2024-10-12 21:41:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 932 transitions. [2024-10-12 21:41:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:41:26,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:26,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:41:26,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -88862144, now seen corresponding path program 1 times [2024-10-12 21:41:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375166116] [2024-10-12 21:41:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:41:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:41:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:41:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375166116] [2024-10-12 21:41:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375166116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:26,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:26,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937672047] [2024-10-12 21:41:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:26,971 INFO L87 Difference]: Start difference. First operand 636 states and 932 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:27,291 INFO L93 Difference]: Finished difference Result 1125 states and 1592 transitions. [2024-10-12 21:41:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 21:41:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:27,295 INFO L225 Difference]: With dead ends: 1125 [2024-10-12 21:41:27,295 INFO L226 Difference]: Without dead ends: 790 [2024-10-12 21:41:27,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:27,296 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 656 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:27,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 572 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-12 21:41:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2024-10-12 21:41:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 649 states have (on average 1.431432973805855) internal successors, (929), 658 states have internal predecessors, (929), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-10-12 21:41:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1063 transitions. [2024-10-12 21:41:27,321 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1063 transitions. Word has length 59 [2024-10-12 21:41:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1063 transitions. [2024-10-12 21:41:27,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1063 transitions. [2024-10-12 21:41:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:27,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:27,323 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:27,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:41:27,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:27,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -248733713, now seen corresponding path program 1 times [2024-10-12 21:41:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:27,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776004704] [2024-10-12 21:41:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776004704] [2024-10-12 21:41:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776004704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714576842] [2024-10-12 21:41:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:27,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:27,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:41:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:27,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:27,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714576842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32548848] [2024-10-12 21:41:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:27,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:27,549 INFO L87 Difference]: Start difference. First operand 741 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:27,684 INFO L93 Difference]: Finished difference Result 1144 states and 1623 transitions. [2024-10-12 21:41:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:27,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:27,687 INFO L225 Difference]: With dead ends: 1144 [2024-10-12 21:41:27,688 INFO L226 Difference]: Without dead ends: 749 [2024-10-12 21:41:27,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:27,689 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:27,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-12 21:41:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2024-10-12 21:41:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 657 states have (on average 1.417047184170472) internal successors, (931), 666 states have internal predecessors, (931), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-10-12 21:41:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1065 transitions. [2024-10-12 21:41:27,715 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1065 transitions. Word has length 60 [2024-10-12 21:41:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:27,715 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1065 transitions. [2024-10-12 21:41:27,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1065 transitions. [2024-10-12 21:41:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:27,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:27,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:27,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:41:27,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:27,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:27,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1092739215, now seen corresponding path program 1 times [2024-10-12 21:41:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:27,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133156742] [2024-10-12 21:41:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133156742] [2024-10-12 21:41:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133156742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633005306] [2024-10-12 21:41:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:27,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:28,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:28,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:41:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:28,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:28,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:28,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633005306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708296186] [2024-10-12 21:41:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:28,090 INFO L87 Difference]: Start difference. First operand 749 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:28,183 INFO L93 Difference]: Finished difference Result 1168 states and 1636 transitions. [2024-10-12 21:41:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:28,186 INFO L225 Difference]: With dead ends: 1168 [2024-10-12 21:41:28,186 INFO L226 Difference]: Without dead ends: 765 [2024-10-12 21:41:28,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:28,189 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:28,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-12 21:41:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2024-10-12 21:41:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 673 states have (on average 1.3997028231797919) internal successors, (942), 682 states have internal predecessors, (942), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (75), 54 states have call predecessors, (75), 56 states have call successors, (75) [2024-10-12 21:41:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1075 transitions. [2024-10-12 21:41:28,223 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1075 transitions. Word has length 60 [2024-10-12 21:41:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:28,223 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1075 transitions. [2024-10-12 21:41:28,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1075 transitions. [2024-10-12 21:41:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:28,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:28,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:28,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:41:28,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 21:41:28,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:28,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash 704900401, now seen corresponding path program 1 times [2024-10-12 21:41:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93812012] [2024-10-12 21:41:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:28,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93812012] [2024-10-12 21:41:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93812012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:28,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923031351] [2024-10-12 21:41:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:28,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:28,560 INFO L87 Difference]: Start difference. First operand 765 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:28,953 INFO L93 Difference]: Finished difference Result 850 states and 1178 transitions. [2024-10-12 21:41:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-12 21:41:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:28,957 INFO L225 Difference]: With dead ends: 850 [2024-10-12 21:41:28,957 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 21:41:28,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:28,958 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1109 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:28,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 570 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 21:41:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 764. [2024-10-12 21:41:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 673 states have (on average 1.3967310549777117) internal successors, (940), 681 states have internal predecessors, (940), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (75), 54 states have call predecessors, (75), 56 states have call successors, (75) [2024-10-12 21:41:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1072 transitions. [2024-10-12 21:41:28,982 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1072 transitions. Word has length 60 [2024-10-12 21:41:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1072 transitions. [2024-10-12 21:41:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1072 transitions. [2024-10-12 21:41:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:41:28,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:28,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:28,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:41:28,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 375967649, now seen corresponding path program 1 times [2024-10-12 21:41:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972309588] [2024-10-12 21:41:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972309588] [2024-10-12 21:41:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972309588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344390035] [2024-10-12 21:41:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:29,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:29,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:41:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:29,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:41:29,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:29,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:41:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344390035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:41:29,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:41:29,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:41:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797008025] [2024-10-12 21:41:29,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:41:29,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:41:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:41:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:29,460 INFO L87 Difference]: Start difference. First operand 764 states and 1072 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:41:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:30,119 INFO L93 Difference]: Finished difference Result 1567 states and 2107 transitions. [2024-10-12 21:41:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:41:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-12 21:41:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:30,124 INFO L225 Difference]: With dead ends: 1567 [2024-10-12 21:41:30,124 INFO L226 Difference]: Without dead ends: 1564 [2024-10-12 21:41:30,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:41:30,125 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 816 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:30,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1655 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:41:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-10-12 21:41:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1067. [2024-10-12 21:41:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 940 states have (on average 1.3680851063829786) internal successors, (1286), 954 states have internal predecessors, (1286), 76 states have call successors, (76), 42 states have call predecessors, (76), 49 states have return successors, (105), 71 states have call predecessors, (105), 75 states have call successors, (105) [2024-10-12 21:41:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1467 transitions. [2024-10-12 21:41:30,193 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1467 transitions. Word has length 61 [2024-10-12 21:41:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1467 transitions. [2024-10-12 21:41:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:41:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1467 transitions. [2024-10-12 21:41:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:41:30,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:30,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:30,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:41:30,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:30,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1733838974, now seen corresponding path program 2 times [2024-10-12 21:41:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471411061] [2024-10-12 21:41:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:41:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 21:41:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471411061] [2024-10-12 21:41:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471411061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16453359] [2024-10-12 21:41:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:30,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:30,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:30,432 INFO L87 Difference]: Start difference. First operand 1067 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:41:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:30,747 INFO L93 Difference]: Finished difference Result 1695 states and 2284 transitions. [2024-10-12 21:41:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-12 21:41:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:30,751 INFO L225 Difference]: With dead ends: 1695 [2024-10-12 21:41:30,751 INFO L226 Difference]: Without dead ends: 1036 [2024-10-12 21:41:30,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:30,753 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 670 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:30,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 589 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-10-12 21:41:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 959. [2024-10-12 21:41:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 845 states have (on average 1.370414201183432) internal successors, (1158), 859 states have internal predecessors, (1158), 69 states have call successors, (69), 37 states have call predecessors, (69), 43 states have return successors, (94), 63 states have call predecessors, (94), 68 states have call successors, (94) [2024-10-12 21:41:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1321 transitions. [2024-10-12 21:41:30,784 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1321 transitions. Word has length 78 [2024-10-12 21:41:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:30,784 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1321 transitions. [2024-10-12 21:41:30,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:41:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1321 transitions. [2024-10-12 21:41:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:30,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:30,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:41:30,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:30,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1238688027, now seen corresponding path program 1 times [2024-10-12 21:41:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188226011] [2024-10-12 21:41:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:41:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:41:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:41:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:41:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188226011] [2024-10-12 21:41:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188226011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:30,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332740853] [2024-10-12 21:41:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:30,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:30,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:30,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:41:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:30,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:30,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:41:30,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332740853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:30,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:41:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586805793] [2024-10-12 21:41:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:30,999 INFO L87 Difference]: Start difference. First operand 959 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:41:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:31,113 INFO L93 Difference]: Finished difference Result 1242 states and 1677 transitions. [2024-10-12 21:41:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-12 21:41:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:31,115 INFO L225 Difference]: With dead ends: 1242 [2024-10-12 21:41:31,115 INFO L226 Difference]: Without dead ends: 255 [2024-10-12 21:41:31,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:31,116 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 55 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:31,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 920 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-12 21:41:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-12 21:41:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.6150442477876106) internal successors, (365), 227 states have internal predecessors, (365), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 21:41:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 409 transitions. [2024-10-12 21:41:31,124 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 409 transitions. Word has length 92 [2024-10-12 21:41:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:31,124 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 409 transitions. [2024-10-12 21:41:31,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:41:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 409 transitions. [2024-10-12 21:41:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:31,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:31,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:31,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:41:31,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:31,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 462683613, now seen corresponding path program 1 times [2024-10-12 21:41:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289926957] [2024-10-12 21:41:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289926957] [2024-10-12 21:41:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289926957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363351716] [2024-10-12 21:41:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:31,457 INFO L87 Difference]: Start difference. First operand 255 states and 409 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:32,305 INFO L93 Difference]: Finished difference Result 593 states and 968 transitions. [2024-10-12 21:41:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:32,307 INFO L225 Difference]: With dead ends: 593 [2024-10-12 21:41:32,307 INFO L226 Difference]: Without dead ends: 345 [2024-10-12 21:41:32,308 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-12 21:41:32,309 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 691 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:32,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 458 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-12 21:41:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 255. [2024-10-12 21:41:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.6106194690265487) internal successors, (364), 227 states have internal predecessors, (364), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 21:41:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 408 transitions. [2024-10-12 21:41:32,321 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 408 transitions. Word has length 121 [2024-10-12 21:41:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:32,321 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 408 transitions. [2024-10-12 21:41:32,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 408 transitions. [2024-10-12 21:41:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:32,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:32,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:32,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:41:32,322 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:32,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1264461349, now seen corresponding path program 1 times [2024-10-12 21:41:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837680457] [2024-10-12 21:41:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837680457] [2024-10-12 21:41:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837680457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:41:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120168636] [2024-10-12 21:41:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:41:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:41:32,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:32,452 INFO L87 Difference]: Start difference. First operand 255 states and 408 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:33,964 INFO L93 Difference]: Finished difference Result 926 states and 1518 transitions. [2024-10-12 21:41:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:41:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:33,967 INFO L225 Difference]: With dead ends: 926 [2024-10-12 21:41:33,967 INFO L226 Difference]: Without dead ends: 686 [2024-10-12 21:41:33,968 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-12 21:41:33,968 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1047 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:33,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 771 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:41:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-12 21:41:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 507. [2024-10-12 21:41:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 454 states have (on average 1.6211453744493391) internal successors, (736), 456 states have internal predecessors, (736), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-12 21:41:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2024-10-12 21:41:33,994 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 121 [2024-10-12 21:41:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2024-10-12 21:41:33,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2024-10-12 21:41:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:33,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:33,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:41:33,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:33,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -719172837, now seen corresponding path program 1 times [2024-10-12 21:41:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414005830] [2024-10-12 21:41:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:34,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414005830] [2024-10-12 21:41:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414005830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:34,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:34,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:34,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369091321] [2024-10-12 21:41:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:34,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:34,150 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:36,094 INFO L93 Difference]: Finished difference Result 1531 states and 2508 transitions. [2024-10-12 21:41:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:41:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:36,099 INFO L225 Difference]: With dead ends: 1531 [2024-10-12 21:41:36,099 INFO L226 Difference]: Without dead ends: 1039 [2024-10-12 21:41:36,100 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-12 21:41:36,100 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1143 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:36,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1024 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:41:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-12 21:41:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 740. [2024-10-12 21:41:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 663 states have (on average 1.6138763197586727) internal successors, (1070), 666 states have internal predecessors, (1070), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 21:41:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1187 transitions. [2024-10-12 21:41:36,136 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1187 transitions. Word has length 121 [2024-10-12 21:41:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:36,136 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1187 transitions. [2024-10-12 21:41:36,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1187 transitions. [2024-10-12 21:41:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:36,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:36,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:36,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:41:36,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:36,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1542400413, now seen corresponding path program 1 times [2024-10-12 21:41:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:36,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613857910] [2024-10-12 21:41:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613857910] [2024-10-12 21:41:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613857910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456407672] [2024-10-12 21:41:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:36,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:36,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:36,301 INFO L87 Difference]: Start difference. First operand 740 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:37,366 INFO L93 Difference]: Finished difference Result 1774 states and 2904 transitions. [2024-10-12 21:41:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:37,375 INFO L225 Difference]: With dead ends: 1774 [2024-10-12 21:41:37,375 INFO L226 Difference]: Without dead ends: 1049 [2024-10-12 21:41:37,376 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-12 21:41:37,377 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 774 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:37,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 744 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:41:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-10-12 21:41:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 740. [2024-10-12 21:41:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 663 states have (on average 1.6093514328808447) internal successors, (1067), 666 states have internal predecessors, (1067), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 21:41:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1184 transitions. [2024-10-12 21:41:37,469 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1184 transitions. Word has length 121 [2024-10-12 21:41:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:37,469 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1184 transitions. [2024-10-12 21:41:37,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1184 transitions. [2024-10-12 21:41:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:37,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:37,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:37,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:41:37,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 235258015, now seen corresponding path program 1 times [2024-10-12 21:41:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026697072] [2024-10-12 21:41:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026697072] [2024-10-12 21:41:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026697072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:37,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375373026] [2024-10-12 21:41:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:37,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:37,639 INFO L87 Difference]: Start difference. First operand 740 states and 1184 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:38,620 INFO L93 Difference]: Finished difference Result 1770 states and 2887 transitions. [2024-10-12 21:41:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:38,624 INFO L225 Difference]: With dead ends: 1770 [2024-10-12 21:41:38,624 INFO L226 Difference]: Without dead ends: 1045 [2024-10-12 21:41:38,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:41:38,626 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 881 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:38,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 625 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-10-12 21:41:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 740. [2024-10-12 21:41:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 663 states have (on average 1.6048265460030167) internal successors, (1064), 666 states have internal predecessors, (1064), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 21:41:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1181 transitions. [2024-10-12 21:41:38,663 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1181 transitions. Word has length 121 [2024-10-12 21:41:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:38,664 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1181 transitions. [2024-10-12 21:41:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1181 transitions. [2024-10-12 21:41:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:38,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:38,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:41:38,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2132754781, now seen corresponding path program 1 times [2024-10-12 21:41:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458860371] [2024-10-12 21:41:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458860371] [2024-10-12 21:41:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458860371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:38,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009642104] [2024-10-12 21:41:38,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:38,856 INFO L87 Difference]: Start difference. First operand 740 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:39,782 INFO L93 Difference]: Finished difference Result 1766 states and 2870 transitions. [2024-10-12 21:41:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:39,786 INFO L225 Difference]: With dead ends: 1766 [2024-10-12 21:41:39,787 INFO L226 Difference]: Without dead ends: 1041 [2024-10-12 21:41:39,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:41:39,788 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 879 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:39,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 625 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-10-12 21:41:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 740. [2024-10-12 21:41:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 663 states have (on average 1.6003016591251886) internal successors, (1061), 666 states have internal predecessors, (1061), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 21:41:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1178 transitions. [2024-10-12 21:41:39,827 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1178 transitions. Word has length 121 [2024-10-12 21:41:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:39,828 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1178 transitions. [2024-10-12 21:41:39,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1178 transitions. [2024-10-12 21:41:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:39,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:39,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:39,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:41:39,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:39,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1131171617, now seen corresponding path program 1 times [2024-10-12 21:41:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:39,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409268207] [2024-10-12 21:41:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409268207] [2024-10-12 21:41:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409268207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696688164] [2024-10-12 21:41:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:39,984 INFO L87 Difference]: Start difference. First operand 740 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:41,993 INFO L93 Difference]: Finished difference Result 2404 states and 3884 transitions. [2024-10-12 21:41:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:41:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:41,999 INFO L225 Difference]: With dead ends: 2404 [2024-10-12 21:41:41,999 INFO L226 Difference]: Without dead ends: 1679 [2024-10-12 21:41:42,001 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-12 21:41:42,001 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1062 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:42,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1454 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:41:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-10-12 21:41:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1219. [2024-10-12 21:41:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1094 states have (on average 1.5923217550274222) internal successors, (1742), 1099 states have internal predecessors, (1742), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 21:41:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1935 transitions. [2024-10-12 21:41:42,066 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1935 transitions. Word has length 121 [2024-10-12 21:41:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:42,066 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1935 transitions. [2024-10-12 21:41:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1935 transitions. [2024-10-12 21:41:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:42,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:42,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:42,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:41:42,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:42,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1257392413, now seen corresponding path program 1 times [2024-10-12 21:41:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353016638] [2024-10-12 21:41:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353016638] [2024-10-12 21:41:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353016638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153762259] [2024-10-12 21:41:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:42,192 INFO L87 Difference]: Start difference. First operand 1219 states and 1935 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:43,301 INFO L93 Difference]: Finished difference Result 2870 states and 4629 transitions. [2024-10-12 21:41:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:43,307 INFO L225 Difference]: With dead ends: 2870 [2024-10-12 21:41:43,307 INFO L226 Difference]: Without dead ends: 1666 [2024-10-12 21:41:43,309 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-12 21:41:43,310 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 769 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:43,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 744 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:41:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-10-12 21:41:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1219. [2024-10-12 21:41:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1094 states have (on average 1.5877513711151736) internal successors, (1737), 1099 states have internal predecessors, (1737), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 21:41:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1930 transitions. [2024-10-12 21:41:43,377 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1930 transitions. Word has length 121 [2024-10-12 21:41:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:43,377 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1930 transitions. [2024-10-12 21:41:43,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1930 transitions. [2024-10-12 21:41:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:43,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:43,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:43,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:41:43,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:43,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1436503777, now seen corresponding path program 1 times [2024-10-12 21:41:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:43,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225576134] [2024-10-12 21:41:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225576134] [2024-10-12 21:41:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225576134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382039792] [2024-10-12 21:41:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:43,584 INFO L87 Difference]: Start difference. First operand 1219 states and 1930 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:45,695 INFO L93 Difference]: Finished difference Result 4105 states and 6581 transitions. [2024-10-12 21:41:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:41:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:45,704 INFO L225 Difference]: With dead ends: 4105 [2024-10-12 21:41:45,704 INFO L226 Difference]: Without dead ends: 2901 [2024-10-12 21:41:45,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:41:45,736 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 1050 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:45,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 1454 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:41:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-10-12 21:41:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2177. [2024-10-12 21:41:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1956 states have (on average 1.579243353783231) internal successors, (3089), 1965 states have internal predecessors, (3089), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 21:41:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3440 transitions. [2024-10-12 21:41:45,863 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3440 transitions. Word has length 121 [2024-10-12 21:41:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:45,863 INFO L471 AbstractCegarLoop]: Abstraction has 2177 states and 3440 transitions. [2024-10-12 21:41:45,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3440 transitions. [2024-10-12 21:41:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:45,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:45,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:45,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:41:45,865 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:45,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1801732317, now seen corresponding path program 1 times [2024-10-12 21:41:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248391274] [2024-10-12 21:41:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248391274] [2024-10-12 21:41:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248391274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200649232] [2024-10-12 21:41:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:46,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:46,006 INFO L87 Difference]: Start difference. First operand 2177 states and 3440 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:48,304 INFO L93 Difference]: Finished difference Result 8345 states and 13367 transitions. [2024-10-12 21:41:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:48,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:48,327 INFO L225 Difference]: With dead ends: 8345 [2024-10-12 21:41:48,327 INFO L226 Difference]: Without dead ends: 6183 [2024-10-12 21:41:48,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:48,331 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1415 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:48,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 933 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:41:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2024-10-12 21:41:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 4082. [2024-10-12 21:41:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3677 states have (on average 1.5749252107696492) internal successors, (5791), 3694 states have internal predecessors, (5791), 286 states have call successors, (286), 102 states have call predecessors, (286), 118 states have return successors, (383), 301 states have call predecessors, (383), 286 states have call successors, (383) [2024-10-12 21:41:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 6460 transitions. [2024-10-12 21:41:48,614 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 6460 transitions. Word has length 121 [2024-10-12 21:41:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:48,615 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 6460 transitions. [2024-10-12 21:41:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 6460 transitions. [2024-10-12 21:41:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:48,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:48,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:48,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:41:48,617 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:48,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1141849761, now seen corresponding path program 1 times [2024-10-12 21:41:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360697747] [2024-10-12 21:41:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360697747] [2024-10-12 21:41:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360697747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966953011] [2024-10-12 21:41:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:48,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:48,756 INFO L87 Difference]: Start difference. First operand 4082 states and 6460 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:49,909 INFO L93 Difference]: Finished difference Result 9416 states and 15114 transitions. [2024-10-12 21:41:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:49,926 INFO L225 Difference]: With dead ends: 9416 [2024-10-12 21:41:49,927 INFO L226 Difference]: Without dead ends: 5349 [2024-10-12 21:41:49,933 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-12 21:41:49,934 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 880 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:49,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 624 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2024-10-12 21:41:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4082. [2024-10-12 21:41:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3677 states have (on average 1.5703018765297798) internal successors, (5774), 3694 states have internal predecessors, (5774), 286 states have call successors, (286), 102 states have call predecessors, (286), 118 states have return successors, (383), 301 states have call predecessors, (383), 286 states have call successors, (383) [2024-10-12 21:41:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 6443 transitions. [2024-10-12 21:41:50,200 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 6443 transitions. Word has length 121 [2024-10-12 21:41:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:50,203 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 6443 transitions. [2024-10-12 21:41:50,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 6443 transitions. [2024-10-12 21:41:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:50,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:50,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:50,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:41:50,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:50,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2025358751, now seen corresponding path program 1 times [2024-10-12 21:41:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:50,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022473040] [2024-10-12 21:41:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022473040] [2024-10-12 21:41:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022473040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133706279] [2024-10-12 21:41:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:50,335 INFO L87 Difference]: Start difference. First operand 4082 states and 6443 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:52,875 INFO L93 Difference]: Finished difference Result 15364 states and 24581 transitions. [2024-10-12 21:41:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:52,911 INFO L225 Difference]: With dead ends: 15364 [2024-10-12 21:41:52,912 INFO L226 Difference]: Without dead ends: 11297 [2024-10-12 21:41:52,919 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-12 21:41:52,919 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1232 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:52,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1447 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:41:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11297 states. [2024-10-12 21:41:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11297 to 7925. [2024-10-12 21:41:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7925 states, 7160 states have (on average 1.5681564245810056) internal successors, (11228), 7193 states have internal predecessors, (11228), 534 states have call successors, (534), 198 states have call predecessors, (534), 230 states have return successors, (809), 565 states have call predecessors, (809), 534 states have call successors, (809) [2024-10-12 21:41:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7925 states to 7925 states and 12571 transitions. [2024-10-12 21:41:53,411 INFO L78 Accepts]: Start accepts. Automaton has 7925 states and 12571 transitions. Word has length 121 [2024-10-12 21:41:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:53,412 INFO L471 AbstractCegarLoop]: Abstraction has 7925 states and 12571 transitions. [2024-10-12 21:41:53,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7925 states and 12571 transitions. [2024-10-12 21:41:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:53,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:53,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:41:53,416 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:53,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2053859041, now seen corresponding path program 1 times [2024-10-12 21:41:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220183758] [2024-10-12 21:41:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220183758] [2024-10-12 21:41:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220183758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:53,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297944202] [2024-10-12 21:41:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:53,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:53,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:53,610 INFO L87 Difference]: Start difference. First operand 7925 states and 12571 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:57,054 INFO L93 Difference]: Finished difference Result 29589 states and 47559 transitions. [2024-10-12 21:41:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:41:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:57,107 INFO L225 Difference]: With dead ends: 29589 [2024-10-12 21:41:57,107 INFO L226 Difference]: Without dead ends: 21679 [2024-10-12 21:41:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:57,130 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1080 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:57,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1447 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:41:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2024-10-12 21:41:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 15606. [2024-10-12 21:41:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15606 states, 14137 states have (on average 1.5673763882011742) internal successors, (22158), 14202 states have internal predecessors, (22158), 1014 states have call successors, (1014), 390 states have call predecessors, (1014), 454 states have return successors, (1807), 1077 states have call predecessors, (1807), 1014 states have call successors, (1807) [2024-10-12 21:41:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15606 states to 15606 states and 24979 transitions. [2024-10-12 21:41:58,276 INFO L78 Accepts]: Start accepts. Automaton has 15606 states and 24979 transitions. Word has length 121 [2024-10-12 21:41:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:58,276 INFO L471 AbstractCegarLoop]: Abstraction has 15606 states and 24979 transitions. [2024-10-12 21:41:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15606 states and 24979 transitions. [2024-10-12 21:41:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:41:58,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:58,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:41:58,289 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:58,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash 300526241, now seen corresponding path program 1 times [2024-10-12 21:41:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379648961] [2024-10-12 21:41:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:41:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:41:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:41:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:58,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:58,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379648961] [2024-10-12 21:41:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379648961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:58,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953750003] [2024-10-12 21:41:58,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:58,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:58,453 INFO L87 Difference]: Start difference. First operand 15606 states and 24979 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:01,173 INFO L93 Difference]: Finished difference Result 35450 states and 57611 transitions. [2024-10-12 21:42:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:42:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:01,301 INFO L225 Difference]: With dead ends: 35450 [2024-10-12 21:42:01,302 INFO L226 Difference]: Without dead ends: 19859 [2024-10-12 21:42:01,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:01,325 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 880 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:01,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 624 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:42:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19859 states. [2024-10-12 21:42:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19859 to 15606. [2024-10-12 21:42:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15606 states, 14137 states have (on average 1.5627785244394143) internal successors, (22093), 14202 states have internal predecessors, (22093), 1014 states have call successors, (1014), 390 states have call predecessors, (1014), 454 states have return successors, (1807), 1077 states have call predecessors, (1807), 1014 states have call successors, (1807) [2024-10-12 21:42:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15606 states to 15606 states and 24914 transitions. [2024-10-12 21:42:02,413 INFO L78 Accepts]: Start accepts. Automaton has 15606 states and 24914 transitions. Word has length 121 [2024-10-12 21:42:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 15606 states and 24914 transitions. [2024-10-12 21:42:02,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15606 states and 24914 transitions. [2024-10-12 21:42:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:42:02,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:02,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:02,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:42:02,423 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:02,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2117377825, now seen corresponding path program 1 times [2024-10-12 21:42:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908998654] [2024-10-12 21:42:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:42:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:42:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:42:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908998654] [2024-10-12 21:42:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908998654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:02,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304815304] [2024-10-12 21:42:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:02,541 INFO L87 Difference]: Start difference. First operand 15606 states and 24914 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:08,849 INFO L93 Difference]: Finished difference Result 56722 states and 91717 transitions. [2024-10-12 21:42:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:08,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:42:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:08,953 INFO L225 Difference]: With dead ends: 56722 [2024-10-12 21:42:08,954 INFO L226 Difference]: Without dead ends: 41131 [2024-10-12 21:42:08,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:08,994 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1054 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:08,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1447 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:42:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41131 states. [2024-10-12 21:42:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41131 to 31032. [2024-10-12 21:42:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31032 states, 28187 states have (on average 1.5616064143044666) internal successors, (44017), 28316 states have internal predecessors, (44017), 1942 states have call successors, (1942), 774 states have call predecessors, (1942), 902 states have return successors, (4257), 2069 states have call predecessors, (4257), 1942 states have call successors, (4257) [2024-10-12 21:42:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31032 states to 31032 states and 50216 transitions. [2024-10-12 21:42:11,665 INFO L78 Accepts]: Start accepts. Automaton has 31032 states and 50216 transitions. Word has length 121 [2024-10-12 21:42:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:11,666 INFO L471 AbstractCegarLoop]: Abstraction has 31032 states and 50216 transitions. [2024-10-12 21:42:11,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31032 states and 50216 transitions. [2024-10-12 21:42:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:42:11,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:11,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:42:11,687 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:11,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1406855905, now seen corresponding path program 1 times [2024-10-12 21:42:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082545415] [2024-10-12 21:42:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:42:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:42:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:42:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082545415] [2024-10-12 21:42:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082545415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017735827] [2024-10-12 21:42:11,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:11,997 INFO L87 Difference]: Start difference. First operand 31032 states and 50216 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:20,813 INFO L93 Difference]: Finished difference Result 110930 states and 181997 transitions. [2024-10-12 21:42:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-12 21:42:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:21,006 INFO L225 Difference]: With dead ends: 110930 [2024-10-12 21:42:21,006 INFO L226 Difference]: Without dead ends: 79913 [2024-10-12 21:42:21,066 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-12 21:42:21,067 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1082 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:21,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1447 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:42:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79913 states. [2024-10-12 21:42:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79913 to 61881. [2024-10-12 21:42:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61881 states, 56348 states have (on average 1.56149286576276) internal successors, (87987), 56605 states have internal predecessors, (87987), 3734 states have call successors, (3734), 1542 states have call predecessors, (3734), 1798 states have return successors, (10551), 3989 states have call predecessors, (10551), 3734 states have call successors, (10551) [2024-10-12 21:42:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61881 states to 61881 states and 102272 transitions. [2024-10-12 21:42:26,247 INFO L78 Accepts]: Start accepts. Automaton has 61881 states and 102272 transitions. Word has length 121 [2024-10-12 21:42:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:26,248 INFO L471 AbstractCegarLoop]: Abstraction has 61881 states and 102272 transitions. [2024-10-12 21:42:26,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 61881 states and 102272 transitions. [2024-10-12 21:42:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 21:42:26,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:26,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 21:42:26,281 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 412162207, now seen corresponding path program 1 times [2024-10-12 21:42:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047183352] [2024-10-12 21:42:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:26,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:42:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:42:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:42:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047183352] [2024-10-12 21:42:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047183352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620462292] [2024-10-12 21:42:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:26,411 INFO L87 Difference]: Start difference. First operand 61881 states and 102272 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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)