./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_3.cil+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:47:16,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:47:17,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:47:17,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:47:17,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:47:17,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:47:17,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:47:17,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:47:17,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:47:17,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:47:17,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:47:17,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:47:17,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:47:17,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:47:17,042 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:47:17,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:47:17,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:47:17,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:47:17,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:47:17,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:47:17,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:47:17,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:47:17,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:47:17,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:47:17,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:47:17,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:47:17,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:47:17,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:47:17,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:47:17,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:47:17,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:47:17,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:47:17,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:17,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:47:17,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:47:17,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:47:17,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:47:17,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:47:17,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:47:17,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:47:17,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:47:17,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:47:17,053 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 -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2024-10-12 21:47:17,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:47:17,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:47:17,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:47:17,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:47:17,358 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:47:17,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-10-12 21:47:18,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:47:19,182 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:47:19,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-10-12 21:47:19,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394deacc0/71db665dfc9948d18a02815d17f27fb4/FLAG1565019ba [2024-10-12 21:47:19,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394deacc0/71db665dfc9948d18a02815d17f27fb4 [2024-10-12 21:47:19,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:47:19,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:47:19,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:19,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:47:19,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:47:19,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:19,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb395ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19, skipping insertion in model container [2024-10-12 21:47:19,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:19,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:47:19,504 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_3.cil+token_ring.11.cil-2.c[911,924] [2024-10-12 21:47:19,604 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_3.cil+token_ring.11.cil-2.c[8416,8429] [2024-10-12 21:47:19,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:19,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:47:19,752 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_3.cil+token_ring.11.cil-2.c[911,924] [2024-10-12 21:47:19,776 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_3.cil+token_ring.11.cil-2.c[8416,8429] [2024-10-12 21:47:19,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:19,887 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:47:19,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19 WrapperNode [2024-10-12 21:47:19,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:19,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:19,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:47:19,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:47:19,899 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:47:19" (1/1) ... [2024-10-12 21:47:19,916 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:47:19" (1/1) ... [2024-10-12 21:47:19,961 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1046 [2024-10-12 21:47:19,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:19,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:47:19,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:47:19,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:47:19,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:19,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:19,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,023 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:47:20,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:47:20,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:47:20,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:47:20,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:47:20,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (1/1) ... [2024-10-12 21:47:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:20,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:20,134 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:47:20,138 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:47:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:47:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:47:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:47:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:47:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:47:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:47:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:47:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:47:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:47:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:47:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:47:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:47:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:47:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:47:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:47:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:47:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:47:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:47:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:47:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:47:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:47:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:47:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:47:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:47:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:47:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:47:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:47:20,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:47:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:47:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:47:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:47:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:47:20,341 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:47:20,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:47:21,311 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:47:21,311 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-12 21:47:21,534 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-12 21:47:21,534 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:47:21,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:47:21,624 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-12 21:47:21,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:21 BoogieIcfgContainer [2024-10-12 21:47:21,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:47:21,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:47:21,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:47:21,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:47:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:47:19" (1/3) ... [2024-10-12 21:47:21,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b683f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:21, skipping insertion in model container [2024-10-12 21:47:21,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:19" (2/3) ... [2024-10-12 21:47:21,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b683f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:21, skipping insertion in model container [2024-10-12 21:47:21,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:21" (3/3) ... [2024-10-12 21:47:21,635 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-10-12 21:47:21,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:47:21,650 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:47:21,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:47:21,738 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;@3fcf158e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:47:21,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:47:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 371 states have (on average 1.7115902964959568) internal successors, (635), 377 states have internal predecessors, (635), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-12 21:47:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:21,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:21,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:21,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash -704538801, now seen corresponding path program 1 times [2024-10-12 21:47:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391595287] [2024-10-12 21:47:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:22,420 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:47:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391595287] [2024-10-12 21:47:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391595287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555555648] [2024-10-12 21:47:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:22,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:22,465 INFO L87 Difference]: Start difference. First operand has 429 states, 371 states have (on average 1.7115902964959568) internal successors, (635), 377 states have internal predecessors, (635), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:24,150 INFO L93 Difference]: Finished difference Result 972 states and 1613 transitions. [2024-10-12 21:47:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:47:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:47:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:24,173 INFO L225 Difference]: With dead ends: 972 [2024-10-12 21:47:24,174 INFO L226 Difference]: Without dead ends: 562 [2024-10-12 21:47:24,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:24,186 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 827 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:24,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1725 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-10-12 21:47:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 525. [2024-10-12 21:47:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 447 states have (on average 1.5838926174496644) internal successors, (708), 453 states have internal predecessors, (708), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2024-10-12 21:47:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 819 transitions. [2024-10-12 21:47:24,285 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 819 transitions. Word has length 57 [2024-10-12 21:47:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:24,287 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 819 transitions. [2024-10-12 21:47:24,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 819 transitions. [2024-10-12 21:47:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:24,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:24,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:47:24,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1646435727, now seen corresponding path program 1 times [2024-10-12 21:47:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630922767] [2024-10-12 21:47:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:24,550 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:47:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630922767] [2024-10-12 21:47:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630922767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992809368] [2024-10-12 21:47:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:24,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:24,554 INFO L87 Difference]: Start difference. First operand 525 states and 819 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:26,181 INFO L93 Difference]: Finished difference Result 886 states and 1349 transitions. [2024-10-12 21:47:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:47:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:47:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:26,192 INFO L225 Difference]: With dead ends: 886 [2024-10-12 21:47:26,193 INFO L226 Difference]: Without dead ends: 698 [2024-10-12 21:47:26,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:47:26,196 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1302 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:26,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2019 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-12 21:47:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 626. [2024-10-12 21:47:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 526 states have (on average 1.564638783269962) internal successors, (823), 534 states have internal predecessors, (823), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 21:47:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 968 transitions. [2024-10-12 21:47:26,267 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 968 transitions. Word has length 57 [2024-10-12 21:47:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:26,267 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 968 transitions. [2024-10-12 21:47:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 968 transitions. [2024-10-12 21:47:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:26,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:26,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:26,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:47:26,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1755045231, now seen corresponding path program 1 times [2024-10-12 21:47:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:26,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097548034] [2024-10-12 21:47:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:26,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:26,460 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:47:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097548034] [2024-10-12 21:47:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097548034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99443970] [2024-10-12 21:47:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:26,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:26,463 INFO L87 Difference]: Start difference. First operand 626 states and 968 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:28,649 INFO L93 Difference]: Finished difference Result 2024 states and 3018 transitions. [2024-10-12 21:47:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2024-10-12 21:47:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:28,664 INFO L225 Difference]: With dead ends: 2024 [2024-10-12 21:47:28,664 INFO L226 Difference]: Without dead ends: 1723 [2024-10-12 21:47:28,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:28,668 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 3865 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3883 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:28,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3883 Valid, 1929 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:47:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-10-12 21:47:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1590. [2024-10-12 21:47:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1285 states have (on average 1.4614785992217898) internal successors, (1878), 1308 states have internal predecessors, (1878), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2024-10-12 21:47:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2266 transitions. [2024-10-12 21:47:28,829 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2266 transitions. Word has length 57 [2024-10-12 21:47:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:28,830 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2266 transitions. [2024-10-12 21:47:28,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2266 transitions. [2024-10-12 21:47:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:28,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:28,835 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] [2024-10-12 21:47:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:47:28,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1009743390, now seen corresponding path program 1 times [2024-10-12 21:47:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972194099] [2024-10-12 21:47:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:29,044 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:47:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972194099] [2024-10-12 21:47:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972194099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:29,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092392813] [2024-10-12 21:47:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:29,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:29,049 INFO L87 Difference]: Start difference. First operand 1590 states and 2266 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:30,474 INFO L93 Difference]: Finished difference Result 2971 states and 4190 transitions. [2024-10-12 21:47:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:47:30,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 21:47:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:30,486 INFO L225 Difference]: With dead ends: 2971 [2024-10-12 21:47:30,487 INFO L226 Difference]: Without dead ends: 1712 [2024-10-12 21:47:30,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:47:30,497 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 878 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:30,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2096 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-10-12 21:47:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1622. [2024-10-12 21:47:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1309 states have (on average 1.4484339190221542) internal successors, (1896), 1332 states have internal predecessors, (1896), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2024-10-12 21:47:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2292 transitions. [2024-10-12 21:47:30,636 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2292 transitions. Word has length 58 [2024-10-12 21:47:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:30,636 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2292 transitions. [2024-10-12 21:47:30,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2292 transitions. [2024-10-12 21:47:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:30,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:30,640 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] [2024-10-12 21:47:30,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:47:30,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:30,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1082129948, now seen corresponding path program 1 times [2024-10-12 21:47:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584387457] [2024-10-12 21:47:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:30,832 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:47:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584387457] [2024-10-12 21:47:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584387457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745805930] [2024-10-12 21:47:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:30,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:30,836 INFO L87 Difference]: Start difference. First operand 1622 states and 2292 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:33,197 INFO L93 Difference]: Finished difference Result 4881 states and 6853 transitions. [2024-10-12 21:47:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-12 21:47:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:33,210 INFO L225 Difference]: With dead ends: 4881 [2024-10-12 21:47:33,210 INFO L226 Difference]: Without dead ends: 1992 [2024-10-12 21:47:33,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:33,223 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 4028 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:33,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 1969 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:47:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-10-12 21:47:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1836. [2024-10-12 21:47:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1451 states have (on average 1.3955892487939352) internal successors, (2025), 1476 states have internal predecessors, (2025), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2024-10-12 21:47:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2507 transitions. [2024-10-12 21:47:33,414 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2507 transitions. Word has length 58 [2024-10-12 21:47:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2507 transitions. [2024-10-12 21:47:33,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2507 transitions. [2024-10-12 21:47:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:33,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:33,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:47:33,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:33,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash -833537195, now seen corresponding path program 1 times [2024-10-12 21:47:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410327677] [2024-10-12 21:47:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410327677] [2024-10-12 21:47:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410327677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871936394] [2024-10-12 21:47:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:33,608 INFO L87 Difference]: Start difference. First operand 1836 states and 2507 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:35,079 INFO L93 Difference]: Finished difference Result 3505 states and 4745 transitions. [2024-10-12 21:47:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:47:35,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-12 21:47:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:35,092 INFO L225 Difference]: With dead ends: 3505 [2024-10-12 21:47:35,092 INFO L226 Difference]: Without dead ends: 2000 [2024-10-12 21:47:35,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:35,101 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 869 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:35,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2066 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-10-12 21:47:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1884. [2024-10-12 21:47:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1487 states have (on average 1.3819771351714862) internal successors, (2055), 1512 states have internal predecessors, (2055), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2024-10-12 21:47:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2549 transitions. [2024-10-12 21:47:35,247 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2549 transitions. Word has length 80 [2024-10-12 21:47:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:35,249 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2549 transitions. [2024-10-12 21:47:35,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2549 transitions. [2024-10-12 21:47:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:35,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:35,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:35,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:47:35,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1094735507, now seen corresponding path program 1 times [2024-10-12 21:47:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:35,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738314067] [2024-10-12 21:47:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:35,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738314067] [2024-10-12 21:47:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738314067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902478748] [2024-10-12 21:47:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:35,496 INFO L87 Difference]: Start difference. First operand 1884 states and 2549 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:37,145 INFO L93 Difference]: Finished difference Result 3283 states and 4385 transitions. [2024-10-12 21:47:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:47:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-12 21:47:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:37,160 INFO L225 Difference]: With dead ends: 3283 [2024-10-12 21:47:37,160 INFO L226 Difference]: Without dead ends: 1951 [2024-10-12 21:47:37,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:47:37,168 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1622 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:37,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 1498 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:47:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-10-12 21:47:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1676. [2024-10-12 21:47:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1332 states have (on average 1.3888888888888888) internal successors, (1850), 1352 states have internal predecessors, (1850), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2024-10-12 21:47:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2276 transitions. [2024-10-12 21:47:37,296 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2276 transitions. Word has length 80 [2024-10-12 21:47:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:37,297 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2276 transitions. [2024-10-12 21:47:37,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2276 transitions. [2024-10-12 21:47:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:37,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:37,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:37,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:47:37,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:37,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1518382229, now seen corresponding path program 1 times [2024-10-12 21:47:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642866119] [2024-10-12 21:47:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:47:37,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642866119] [2024-10-12 21:47:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642866119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:37,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:37,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:47:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457265579] [2024-10-12 21:47:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:37,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:47:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:37,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:47:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:47:37,447 INFO L87 Difference]: Start difference. First operand 1676 states and 2276 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:47:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:38,641 INFO L93 Difference]: Finished difference Result 4576 states and 6136 transitions. [2024-10-12 21:47:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:47:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-10-12 21:47:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:38,669 INFO L225 Difference]: With dead ends: 4576 [2024-10-12 21:47:38,670 INFO L226 Difference]: Without dead ends: 3232 [2024-10-12 21:47:38,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:47:38,677 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1242 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:38,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1508 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:47:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2024-10-12 21:47:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3022. [2024-10-12 21:47:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2358 states have (on average 1.3379983036471585) internal successors, (3155), 2407 states have internal predecessors, (3155), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2024-10-12 21:47:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4025 transitions. [2024-10-12 21:47:38,940 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4025 transitions. Word has length 80 [2024-10-12 21:47:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:38,941 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4025 transitions. [2024-10-12 21:47:38,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:47:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4025 transitions. [2024-10-12 21:47:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:38,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:38,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:47:38,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1595283027, now seen corresponding path program 1 times [2024-10-12 21:47:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954947973] [2024-10-12 21:47:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954947973] [2024-10-12 21:47:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954947973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:47:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24792898] [2024-10-12 21:47:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:39,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:47:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:47:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:47:39,031 INFO L87 Difference]: Start difference. First operand 3022 states and 4025 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:40,121 INFO L93 Difference]: Finished difference Result 4479 states and 5882 transitions. [2024-10-12 21:47:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:47:40,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-12 21:47:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:40,134 INFO L225 Difference]: With dead ends: 4479 [2024-10-12 21:47:40,135 INFO L226 Difference]: Without dead ends: 1789 [2024-10-12 21:47:40,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:40,147 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 697 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:40,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1347 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:47:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-10-12 21:47:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1676. [2024-10-12 21:47:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1332 states have (on average 1.3611111111111112) internal successors, (1813), 1352 states have internal predecessors, (1813), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2024-10-12 21:47:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2239 transitions. [2024-10-12 21:47:40,319 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2239 transitions. Word has length 80 [2024-10-12 21:47:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:40,320 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2239 transitions. [2024-10-12 21:47:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2239 transitions. [2024-10-12 21:47:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:47:40,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:40,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:40,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:47:40,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1489177597, now seen corresponding path program 1 times [2024-10-12 21:47:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481307949] [2024-10-12 21:47:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:47:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481307949] [2024-10-12 21:47:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481307949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647717811] [2024-10-12 21:47:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:40,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:40,523 INFO L87 Difference]: Start difference. First operand 1676 states and 2239 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:47:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:42,552 INFO L93 Difference]: Finished difference Result 3897 states and 5125 transitions. [2024-10-12 21:47:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 21:47:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-10-12 21:47:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:42,579 INFO L225 Difference]: With dead ends: 3897 [2024-10-12 21:47:42,579 INFO L226 Difference]: Without dead ends: 2412 [2024-10-12 21:47:42,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-12 21:47:42,586 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 2285 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:42,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 1826 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:47:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-10-12 21:47:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2248. [2024-10-12 21:47:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1750 states have (on average 1.3177142857142856) internal successors, (2306), 1778 states have internal predecessors, (2306), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2024-10-12 21:47:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 2940 transitions. [2024-10-12 21:47:42,785 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 2940 transitions. Word has length 81 [2024-10-12 21:47:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:42,788 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 2940 transitions. [2024-10-12 21:47:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:47:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2940 transitions. [2024-10-12 21:47:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 21:47:42,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:42,792 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:42,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:47:42,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:42,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash -205280706, now seen corresponding path program 1 times [2024-10-12 21:47:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032327288] [2024-10-12 21:47:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:47:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:47:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:47:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 21:47:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:47:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 21:47:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 21:47:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 21:47:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032327288] [2024-10-12 21:47:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032327288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:47:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978511968] [2024-10-12 21:47:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:47:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:43,041 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:47:43,042 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:47:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:43,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:47:43,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:47:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 21:47:43,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:47:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978511968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:47:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:47:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430484024] [2024-10-12 21:47:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:47:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:47:43,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:43,350 INFO L87 Difference]: Start difference. First operand 2248 states and 2940 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:47:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:43,742 INFO L93 Difference]: Finished difference Result 5844 states and 7439 transitions. [2024-10-12 21:47:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:47:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-12 21:47:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:43,763 INFO L225 Difference]: With dead ends: 5844 [2024-10-12 21:47:43,763 INFO L226 Difference]: Without dead ends: 3998 [2024-10-12 21:47:43,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:43,771 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 57 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:43,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1205 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:47:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2024-10-12 21:47:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3958. [2024-10-12 21:47:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3047 states have (on average 1.279947489333771) internal successors, (3900), 3098 states have internal predecessors, (3900), 473 states have call successors, (473), 329 states have call predecessors, (473), 436 states have return successors, (636), 532 states have call predecessors, (636), 471 states have call successors, (636) [2024-10-12 21:47:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 5009 transitions. [2024-10-12 21:47:44,219 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 5009 transitions. Word has length 145 [2024-10-12 21:47:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 5009 transitions. [2024-10-12 21:47:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:47:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 5009 transitions. [2024-10-12 21:47:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:47:44,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:44,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:44,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:47:44,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 21:47:44,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -339032444, now seen corresponding path program 1 times [2024-10-12 21:47:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525724772] [2024-10-12 21:47:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:47:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:47:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:47:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:47:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,711 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:47:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525724772] [2024-10-12 21:47:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525724772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:47:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794277254] [2024-10-12 21:47:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:44,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:47:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:47:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:47:44,713 INFO L87 Difference]: Start difference. First operand 3958 states and 5009 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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:47:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:47,643 INFO L93 Difference]: Finished difference Result 4391 states and 5731 transitions. [2024-10-12 21:47:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:47:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2024-10-12 21:47:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:47,676 INFO L225 Difference]: With dead ends: 4391 [2024-10-12 21:47:47,676 INFO L226 Difference]: Without dead ends: 4078 [2024-10-12 21:47:47,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:47,680 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1006 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:47,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 813 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:47:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2024-10-12 21:47:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3958. [2024-10-12 21:47:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3047 states have (on average 1.2796192976698393) internal successors, (3899), 3098 states have internal predecessors, (3899), 473 states have call successors, (473), 329 states have call predecessors, (473), 436 states have return successors, (636), 532 states have call predecessors, (636), 471 states have call successors, (636) [2024-10-12 21:47:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 5008 transitions. [2024-10-12 21:47:48,589 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 5008 transitions. Word has length 151 [2024-10-12 21:47:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 5008 transitions. [2024-10-12 21:47:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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:47:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 5008 transitions. [2024-10-12 21:47:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:47:48,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:48,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:47:48,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1448837378, now seen corresponding path program 1 times [2024-10-12 21:47:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020366675] [2024-10-12 21:47:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:47:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:47:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:47:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:47:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:48,858 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:47:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020366675] [2024-10-12 21:47:48,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020366675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:48,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:48,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:47:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520180322] [2024-10-12 21:47:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:48,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:47:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:48,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:47:48,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:47:48,864 INFO L87 Difference]: Start difference. First operand 3958 states and 5008 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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:47:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:52,607 INFO L93 Difference]: Finished difference Result 4827 states and 6460 transitions. [2024-10-12 21:47:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:47:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2024-10-12 21:47:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:52,648 INFO L225 Difference]: With dead ends: 4827 [2024-10-12 21:47:52,648 INFO L226 Difference]: Without dead ends: 4521 [2024-10-12 21:47:52,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:52,659 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1588 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:52,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1187 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:47:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2024-10-12 21:47:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 4282. [2024-10-12 21:47:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4282 states, 3344 states have (on average 1.312200956937799) internal successors, (4388), 3396 states have internal predecessors, (4388), 493 states have call successors, (493), 335 states have call predecessors, (493), 443 states have return successors, (659), 552 states have call predecessors, (659), 491 states have call successors, (659) [2024-10-12 21:47:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 5540 transitions. [2024-10-12 21:47:53,574 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 5540 transitions. Word has length 151 [2024-10-12 21:47:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:53,575 INFO L471 AbstractCegarLoop]: Abstraction has 4282 states and 5540 transitions. [2024-10-12 21:47:53,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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:47:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 5540 transitions. [2024-10-12 21:47:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:47:53,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:53,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:53,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:47:53,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:53,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash 903964804, now seen corresponding path program 1 times [2024-10-12 21:47:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145831079] [2024-10-12 21:47:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:47:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:47:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:47:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:47:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,928 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:47:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145831079] [2024-10-12 21:47:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145831079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:47:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800675588] [2024-10-12 21:47:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:47:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:47:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:47:53,933 INFO L87 Difference]: Start difference. First operand 4282 states and 5540 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:47:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:58,637 INFO L93 Difference]: Finished difference Result 5612 states and 7762 transitions. [2024-10-12 21:47:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:47:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:47:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:58,659 INFO L225 Difference]: With dead ends: 5612 [2024-10-12 21:47:58,659 INFO L226 Difference]: Without dead ends: 4982 [2024-10-12 21:47:58,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:47:58,663 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 1629 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:58,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 2115 Invalid, 3831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 21:47:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2024-10-12 21:47:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4581. [2024-10-12 21:47:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 3616 states have (on average 1.334900442477876) internal successors, (4827), 3669 states have internal predecessors, (4827), 513 states have call successors, (513), 341 states have call predecessors, (513), 450 states have return successors, (681), 573 states have call predecessors, (681), 511 states have call successors, (681) [2024-10-12 21:47:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6021 transitions. [2024-10-12 21:47:59,563 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6021 transitions. Word has length 151 [2024-10-12 21:47:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 4581 states and 6021 transitions. [2024-10-12 21:47:59,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:47:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6021 transitions. [2024-10-12 21:47:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:47:59,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:59,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:59,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:47:59,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1579124930, now seen corresponding path program 1 times [2024-10-12 21:47:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540151033] [2024-10-12 21:47:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:47:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:47:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:47:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:47:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540151033] [2024-10-12 21:47:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540151033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:47:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330294328] [2024-10-12 21:47:59,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:59,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:47:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:59,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:47:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:47:59,900 INFO L87 Difference]: Start difference. First operand 4581 states and 6021 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:03,871 INFO L93 Difference]: Finished difference Result 6761 states and 9657 transitions. [2024-10-12 21:48:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:48:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:03,894 INFO L225 Difference]: With dead ends: 6761 [2024-10-12 21:48:03,895 INFO L226 Difference]: Without dead ends: 5832 [2024-10-12 21:48:03,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:03,904 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1623 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:03,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 2113 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:48:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2024-10-12 21:48:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 5183. [2024-10-12 21:48:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4164 states have (on average 1.3717579250720462) internal successors, (5712), 4219 states have internal predecessors, (5712), 553 states have call successors, (553), 353 states have call predecessors, (553), 464 states have return successors, (729), 615 states have call predecessors, (729), 551 states have call successors, (729) [2024-10-12 21:48:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 6994 transitions. [2024-10-12 21:48:04,983 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 6994 transitions. Word has length 151 [2024-10-12 21:48:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 6994 transitions. [2024-10-12 21:48:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 6994 transitions. [2024-10-12 21:48:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:48:04,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:04,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:48:04,987 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 994353280, now seen corresponding path program 1 times [2024-10-12 21:48:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029076320] [2024-10-12 21:48:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:48:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:48:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:48:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:48:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,252 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:48:05,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:05,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029076320] [2024-10-12 21:48:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029076320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992103062] [2024-10-12 21:48:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:05,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:05,254 INFO L87 Difference]: Start difference. First operand 5183 states and 6994 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:09,622 INFO L93 Difference]: Finished difference Result 8969 states and 13278 transitions. [2024-10-12 21:48:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:48:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:09,644 INFO L225 Difference]: With dead ends: 8969 [2024-10-12 21:48:09,644 INFO L226 Difference]: Without dead ends: 7438 [2024-10-12 21:48:09,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:09,652 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1622 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3698 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:09,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2113 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3698 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:48:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2024-10-12 21:48:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 6388. [2024-10-12 21:48:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6388 states, 5261 states have (on average 1.422163086865615) internal successors, (7482), 5320 states have internal predecessors, (7482), 633 states have call successors, (633), 377 states have call predecessors, (633), 492 states have return successors, (831), 699 states have call predecessors, (831), 631 states have call successors, (831) [2024-10-12 21:48:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 8946 transitions. [2024-10-12 21:48:10,636 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 8946 transitions. Word has length 151 [2024-10-12 21:48:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 6388 states and 8946 transitions. [2024-10-12 21:48:10,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 8946 transitions. [2024-10-12 21:48:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:48:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:10,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:10,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:48:10,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 559847682, now seen corresponding path program 1 times [2024-10-12 21:48:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395385812] [2024-10-12 21:48:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:48:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:48:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:48:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:48:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,927 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:48:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395385812] [2024-10-12 21:48:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395385812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569152815] [2024-10-12 21:48:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:10,930 INFO L87 Difference]: Start difference. First operand 6388 states and 8946 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:15,294 INFO L93 Difference]: Finished difference Result 13384 states and 20536 transitions. [2024-10-12 21:48:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:15,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:48:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:15,329 INFO L225 Difference]: With dead ends: 13384 [2024-10-12 21:48:15,329 INFO L226 Difference]: Without dead ends: 10648 [2024-10-12 21:48:15,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:15,344 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1621 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:15,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 2113 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:48:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10648 states. [2024-10-12 21:48:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10648 to 8805. [2024-10-12 21:48:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8805 states, 7462 states have (on average 1.4784240150093808) internal successors, (11032), 7529 states have internal predecessors, (11032), 793 states have call successors, (793), 425 states have call predecessors, (793), 548 states have return successors, (1053), 867 states have call predecessors, (1053), 791 states have call successors, (1053) [2024-10-12 21:48:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8805 states to 8805 states and 12878 transitions. [2024-10-12 21:48:16,327 INFO L78 Accepts]: Start accepts. Automaton has 8805 states and 12878 transitions. Word has length 151 [2024-10-12 21:48:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:16,327 INFO L471 AbstractCegarLoop]: Abstraction has 8805 states and 12878 transitions. [2024-10-12 21:48:16,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8805 states and 12878 transitions. [2024-10-12 21:48:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:48:16,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:16,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:16,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:48:16,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 130189376, now seen corresponding path program 1 times [2024-10-12 21:48:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989638994] [2024-10-12 21:48:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:48:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:48:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:48:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:48:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,572 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:48:16,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989638994] [2024-10-12 21:48:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989638994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614231974] [2024-10-12 21:48:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:16,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:16,574 INFO L87 Difference]: Start difference. First operand 8805 states and 12878 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:20,816 INFO L93 Difference]: Finished difference Result 22215 states and 35114 transitions. [2024-10-12 21:48:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:48:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:20,873 INFO L225 Difference]: With dead ends: 22215 [2024-10-12 21:48:20,873 INFO L226 Difference]: Without dead ends: 17062 [2024-10-12 21:48:20,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:20,893 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1620 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:20,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 2113 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3672 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:48:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2024-10-12 21:48:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 13654. [2024-10-12 21:48:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13654 states, 11879 states have (on average 1.5282431181075848) internal successors, (18154), 11962 states have internal predecessors, (18154), 1113 states have call successors, (1113), 521 states have call predecessors, (1113), 660 states have return successors, (1551), 1203 states have call predecessors, (1551), 1111 states have call successors, (1551) [2024-10-12 21:48:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13654 states to 13654 states and 20818 transitions. [2024-10-12 21:48:22,192 INFO L78 Accepts]: Start accepts. Automaton has 13654 states and 20818 transitions. Word has length 151 [2024-10-12 21:48:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:22,192 INFO L471 AbstractCegarLoop]: Abstraction has 13654 states and 20818 transitions. [2024-10-12 21:48:22,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13654 states and 20818 transitions. [2024-10-12 21:48:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:48:22,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:22,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:22,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:48:22,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:22,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -576407230, now seen corresponding path program 1 times [2024-10-12 21:48:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993898235] [2024-10-12 21:48:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:48:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:48:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:48:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:48:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:22,543 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:48:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993898235] [2024-10-12 21:48:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993898235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724560837] [2024-10-12 21:48:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:22,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:22,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:22,547 INFO L87 Difference]: Start difference. First operand 13654 states and 20818 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:27,734 INFO L93 Difference]: Finished difference Result 39878 states and 64464 transitions. [2024-10-12 21:48:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-12 21:48:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:27,838 INFO L225 Difference]: With dead ends: 39878 [2024-10-12 21:48:27,838 INFO L226 Difference]: Without dead ends: 29876 [2024-10-12 21:48:27,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:27,877 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1619 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 3760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:27,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 2113 Invalid, 3760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:48:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29876 states. [2024-10-12 21:48:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29876 to 23383. [2024-10-12 21:48:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23383 states, 20744 states have (on average 1.5640185113767837) internal successors, (32444), 20859 states have internal predecessors, (32444), 1753 states have call successors, (1753), 713 states have call predecessors, (1753), 884 states have return successors, (2709), 1875 states have call predecessors, (2709), 1751 states have call successors, (2709) [2024-10-12 21:48:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23383 states to 23383 states and 36906 transitions. [2024-10-12 21:48:29,830 INFO L78 Accepts]: Start accepts. Automaton has 23383 states and 36906 transitions. Word has length 151 [2024-10-12 21:48:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:29,830 INFO L471 AbstractCegarLoop]: Abstraction has 23383 states and 36906 transitions. [2024-10-12 21:48:29,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:48:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 23383 states and 36906 transitions. [2024-10-12 21:48:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 21:48:29,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:29,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:29,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:48:29,847 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 370630656, now seen corresponding path program 1 times [2024-10-12 21:48:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303358344] [2024-10-12 21:48:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:48:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:48:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:48:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:48:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:30,075 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:48:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303358344] [2024-10-12 21:48:30,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303358344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:30,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:30,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:30,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769429170] [2024-10-12 21:48:30,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:30,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:30,078 INFO L87 Difference]: Start difference. First operand 23383 states and 36906 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)