./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.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 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:58:43,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:58:43,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:58:43,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:58:43,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:58:43,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:58:43,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:58:43,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:58:43,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:58:43,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:58:43,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:58:43,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:58:43,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:58:43,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:58:43,422 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:58:43,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:58:43,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:58:43,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:58:43,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:58:43,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:58:43,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:58:43,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:58:43,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:58:43,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:58:43,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:58:43,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:58:43,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:58:43,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:58:43,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:58:43,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:58:43,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:58:43,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:58:43,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:58:43,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:58:43,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:58:43,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:58:43,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:58:43,428 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 -> 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 [2024-11-11 22:58:43,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:58:43,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:58:43,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:58:43,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:58:43,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:58:43,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-11 22:58:44,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:58:45,119 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:58:45,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-11 22:58:45,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e703daf0/79f4a201c19d4f3f8ca45d212f01ee4e/FLAG2b0519762 [2024-11-11 22:58:45,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e703daf0/79f4a201c19d4f3f8ca45d212f01ee4e [2024-11-11 22:58:45,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:58:45,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:58:45,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:58:45,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:58:45,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:58:45,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d7b436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45, skipping insertion in model container [2024-11-11 22:58:45,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:58:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2024-11-11 22:58:45,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2024-11-11 22:58:45,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:58:45,837 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:58:45,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2024-11-11 22:58:45,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2024-11-11 22:58:45,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:58:45,909 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:58:45,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45 WrapperNode [2024-11-11 22:58:45,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:58:45,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:58:45,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:58:45,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:58:45,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,952 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 566 [2024-11-11 22:58:45,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:58:45,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:58:45,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:58:45,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:58:45,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:58:45,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:45,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:58:46,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:58:46,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:58:46,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:58:46,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (1/1) ... [2024-11-11 22:58:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:58:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:58:46,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:58:46,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:58:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:58:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:58:46,119 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:58:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:58:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:58:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:58:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:58:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:58:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:58:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:58:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:58:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:58:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:58:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:58:46,123 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:58:46,123 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:58:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:58:46,124 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:58:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:58:46,124 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:58:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:58:46,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:58:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:58:46,124 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:58:46,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:58:46,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:58:46,600 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-11 22:58:46,600 INFO L735 $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-11-11 22:58:46,663 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-11 22:58:46,664 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:58:46,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:58:46,677 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-11 22:58:46,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:58:46 BoogieIcfgContainer [2024-11-11 22:58:46,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:58:46,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:58:46,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:58:46,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:58:46,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:58:45" (1/3) ... [2024-11-11 22:58:46,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d74450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:58:46, skipping insertion in model container [2024-11-11 22:58:46,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:58:45" (2/3) ... [2024-11-11 22:58:46,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d74450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:58:46, skipping insertion in model container [2024-11-11 22:58:46,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:58:46" (3/3) ... [2024-11-11 22:58:46,683 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-11 22:58:46,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:58:46,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:58:46,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:58:46,745 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;@2bdce1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:58:46,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:58:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 234 states have internal predecessors, (356), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 22:58:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:58:46,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:46,762 INFO L218 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] [2024-11-11 22:58:46,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1984848267, now seen corresponding path program 1 times [2024-11-11 22:58:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513844768] [2024-11-11 22:58:46,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:47,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513844768] [2024-11-11 22:58:47,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513844768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:58:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399406146] [2024-11-11 22:58:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:47,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:58:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:58:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:58:47,327 INFO L87 Difference]: Start difference. First operand has 278 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 234 states have internal predecessors, (356), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:58:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:48,396 INFO L93 Difference]: Finished difference Result 688 states and 1049 transitions. [2024-11-11 22:58:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:48,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-11 22:58:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:48,414 INFO L225 Difference]: With dead ends: 688 [2024-11-11 22:58:48,414 INFO L226 Difference]: Without dead ends: 419 [2024-11-11 22:58:48,419 INFO L434 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-11-11 22:58:48,425 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 565 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:48,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1180 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:58:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-11 22:58:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 380. [2024-11-11 22:58:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 310 states have (on average 1.4548387096774194) internal successors, (451), 316 states have internal predecessors, (451), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-11 22:58:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 546 transitions. [2024-11-11 22:58:48,525 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 546 transitions. Word has length 65 [2024-11-11 22:58:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 546 transitions. [2024-11-11 22:58:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:58:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 546 transitions. [2024-11-11 22:58:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:58:48,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:48,533 INFO L218 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] [2024-11-11 22:58:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:58:48,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -305959627, now seen corresponding path program 1 times [2024-11-11 22:58:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606557572] [2024-11-11 22:58:48,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606557572] [2024-11-11 22:58:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606557572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:58:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044393915] [2024-11-11 22:58:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:58:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:58:48,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:58:48,698 INFO L87 Difference]: Start difference. First operand 380 states and 546 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:58:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:49,641 INFO L93 Difference]: Finished difference Result 777 states and 1112 transitions. [2024-11-11 22:58:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:58:49,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-11 22:58:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:49,649 INFO L225 Difference]: With dead ends: 777 [2024-11-11 22:58:49,649 INFO L226 Difference]: Without dead ends: 568 [2024-11-11 22:58:49,650 INFO L434 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-11-11 22:58:49,651 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 927 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:49,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1298 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:58:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-11 22:58:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 492. [2024-11-11 22:58:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 400 states have (on average 1.4425) internal successors, (577), 408 states have internal predecessors, (577), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2024-11-11 22:58:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 706 transitions. [2024-11-11 22:58:49,686 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 706 transitions. Word has length 65 [2024-11-11 22:58:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:49,686 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 706 transitions. [2024-11-11 22:58:49,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:58:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 706 transitions. [2024-11-11 22:58:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:58:49,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:49,688 INFO L218 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] [2024-11-11 22:58:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:58:49,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1960421559, now seen corresponding path program 1 times [2024-11-11 22:58:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374734009] [2024-11-11 22:58:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374734009] [2024-11-11 22:58:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374734009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:49,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663631913] [2024-11-11 22:58:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:49,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:49,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:49,816 INFO L87 Difference]: Start difference. First operand 492 states and 706 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:50,525 INFO L93 Difference]: Finished difference Result 1164 states and 1648 transitions. [2024-11-11 22:58:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:58:50,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-11 22:58:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:50,530 INFO L225 Difference]: With dead ends: 1164 [2024-11-11 22:58:50,530 INFO L226 Difference]: Without dead ends: 849 [2024-11-11 22:58:50,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:58:50,532 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 864 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:50,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1157 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:58:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-11 22:58:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 773. [2024-11-11 22:58:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 626 states have (on average 1.4121405750798721) internal successors, (884), 638 states have internal predecessors, (884), 89 states have call successors, (89), 49 states have call predecessors, (89), 56 states have return successors, (108), 89 states have call predecessors, (108), 87 states have call successors, (108) [2024-11-11 22:58:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1081 transitions. [2024-11-11 22:58:50,578 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1081 transitions. Word has length 65 [2024-11-11 22:58:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:50,578 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1081 transitions. [2024-11-11 22:58:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1081 transitions. [2024-11-11 22:58:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:58:50,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:50,580 INFO L218 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] [2024-11-11 22:58:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:58:50,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1913522978, now seen corresponding path program 1 times [2024-11-11 22:58:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107463592] [2024-11-11 22:58:50,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:58:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 22:58:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:58:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107463592] [2024-11-11 22:58:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107463592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:50,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:50,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:58:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786148537] [2024-11-11 22:58:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:58:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:58:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:50,698 INFO L87 Difference]: Start difference. First operand 773 states and 1081 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:58:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:51,785 INFO L93 Difference]: Finished difference Result 1441 states and 2008 transitions. [2024-11-11 22:58:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:58:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-11 22:58:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:51,797 INFO L225 Difference]: With dead ends: 1441 [2024-11-11 22:58:51,798 INFO L226 Difference]: Without dead ends: 845 [2024-11-11 22:58:51,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:58:51,808 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 304 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:51,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1580 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:58:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-11 22:58:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 788. [2024-11-11 22:58:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 638 states have (on average 1.3996865203761755) internal successors, (893), 650 states have internal predecessors, (893), 89 states have call successors, (89), 49 states have call predecessors, (89), 59 states have return successors, (111), 92 states have call predecessors, (111), 87 states have call successors, (111) [2024-11-11 22:58:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1093 transitions. [2024-11-11 22:58:51,903 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1093 transitions. Word has length 66 [2024-11-11 22:58:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1093 transitions. [2024-11-11 22:58:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:58:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1093 transitions. [2024-11-11 22:58:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:58:51,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:51,905 INFO L218 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] [2024-11-11 22:58:51,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:58:51,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1352085020, now seen corresponding path program 1 times [2024-11-11 22:58:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277473778] [2024-11-11 22:58:51,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:58:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 22:58:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:58:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277473778] [2024-11-11 22:58:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277473778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:58:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931263423] [2024-11-11 22:58:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:58:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:52,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:58:52,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:52,089 INFO L87 Difference]: Start difference. First operand 788 states and 1093 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:53,910 INFO L93 Difference]: Finished difference Result 2993 states and 4214 transitions. [2024-11-11 22:58:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 22:58:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-11 22:58:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:53,917 INFO L225 Difference]: With dead ends: 2993 [2024-11-11 22:58:53,917 INFO L226 Difference]: Without dead ends: 1151 [2024-11-11 22:58:53,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 22:58:53,924 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 1576 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:53,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 1787 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:58:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-11 22:58:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 996. [2024-11-11 22:58:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 790 states have (on average 1.3632911392405063) internal successors, (1077), 806 states have internal predecessors, (1077), 119 states have call successors, (119), 70 states have call predecessors, (119), 85 states have return successors, (160), 123 states have call predecessors, (160), 117 states have call successors, (160) [2024-11-11 22:58:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1356 transitions. [2024-11-11 22:58:53,980 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1356 transitions. Word has length 66 [2024-11-11 22:58:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:53,980 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1356 transitions. [2024-11-11 22:58:53,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1356 transitions. [2024-11-11 22:58:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:58:53,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:53,982 INFO L218 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] [2024-11-11 22:58:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:58:53,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 372285316, now seen corresponding path program 1 times [2024-11-11 22:58:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954074276] [2024-11-11 22:58:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:58:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 22:58:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:58:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954074276] [2024-11-11 22:58:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954074276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:54,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:58:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372782265] [2024-11-11 22:58:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:54,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:58:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:58:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:54,273 INFO L87 Difference]: Start difference. First operand 996 states and 1356 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:54,980 INFO L93 Difference]: Finished difference Result 2181 states and 2981 transitions. [2024-11-11 22:58:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 22:58:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-11 22:58:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:54,982 INFO L225 Difference]: With dead ends: 2181 [2024-11-11 22:58:54,982 INFO L226 Difference]: Without dead ends: 157 [2024-11-11 22:58:54,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-11 22:58:54,987 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1089 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:54,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1116 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:58:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-11 22:58:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-11 22:58:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.481203007518797) internal successors, (197), 134 states have internal predecessors, (197), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-11 22:58:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-11-11 22:58:55,010 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 67 [2024-11-11 22:58:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:55,010 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-11-11 22:58:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:58:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-11-11 22:58:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:55,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:55,011 INFO L218 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] [2024-11-11 22:58:55,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:58:55,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -946418630, now seen corresponding path program 1 times [2024-11-11 22:58:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273774297] [2024-11-11 22:58:55,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:58:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:58:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:58:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:55,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273774297] [2024-11-11 22:58:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273774297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:55,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:55,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:58:55,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907384253] [2024-11-11 22:58:55,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:55,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:58:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:55,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:58:55,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:58:55,080 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:55,415 INFO L93 Difference]: Finished difference Result 348 states and 523 transitions. [2024-11-11 22:58:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:58:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 79 [2024-11-11 22:58:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:55,417 INFO L225 Difference]: With dead ends: 348 [2024-11-11 22:58:55,417 INFO L226 Difference]: Without dead ends: 200 [2024-11-11 22:58:55,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:58:55,419 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 361 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:55,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 316 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:58:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-11 22:58:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2024-11-11 22:58:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 134 states have internal predecessors, (196), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-11 22:58:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2024-11-11 22:58:55,427 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 79 [2024-11-11 22:58:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:55,428 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2024-11-11 22:58:55,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2024-11-11 22:58:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:55,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:55,429 INFO L218 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] [2024-11-11 22:58:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:58:55,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -453792456, now seen corresponding path program 1 times [2024-11-11 22:58:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765760263] [2024-11-11 22:58:55,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:58:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:58:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:58:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:55,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765760263] [2024-11-11 22:58:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765760263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:55,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:58:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415890876] [2024-11-11 22:58:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:55,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:58:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:58:55,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:58:55,504 INFO L87 Difference]: Start difference. First operand 157 states and 230 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:56,294 INFO L93 Difference]: Finished difference Result 533 states and 805 transitions. [2024-11-11 22:58:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:58:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:58:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:56,296 INFO L225 Difference]: With dead ends: 533 [2024-11-11 22:58:56,296 INFO L226 Difference]: Without dead ends: 388 [2024-11-11 22:58:56,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:56,297 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 530 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:56,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 534 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:58:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-11 22:58:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 303. [2024-11-11 22:58:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.4884615384615385) internal successors, (387), 262 states have internal predecessors, (387), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-11 22:58:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 448 transitions. [2024-11-11 22:58:56,334 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 448 transitions. Word has length 79 [2024-11-11 22:58:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:56,335 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 448 transitions. [2024-11-11 22:58:56,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 448 transitions. [2024-11-11 22:58:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:56,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:56,335 INFO L218 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] [2024-11-11 22:58:56,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:58:56,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:56,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash -216744260, now seen corresponding path program 1 times [2024-11-11 22:58:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176007965] [2024-11-11 22:58:56,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:58:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:58:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:58:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176007965] [2024-11-11 22:58:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176007965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:56,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784704262] [2024-11-11 22:58:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:56,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:56,499 INFO L87 Difference]: Start difference. First operand 303 states and 448 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:57,767 INFO L93 Difference]: Finished difference Result 869 states and 1306 transitions. [2024-11-11 22:58:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:58:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:57,771 INFO L225 Difference]: With dead ends: 869 [2024-11-11 22:58:57,771 INFO L226 Difference]: Without dead ends: 578 [2024-11-11 22:58:57,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:57,774 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 527 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:57,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 996 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:58:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-11 22:58:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 440. [2024-11-11 22:58:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 378 states have (on average 1.4814814814814814) internal successors, (560), 381 states have internal predecessors, (560), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-11 22:58:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 647 transitions. [2024-11-11 22:58:57,799 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 647 transitions. Word has length 79 [2024-11-11 22:58:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:57,799 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 647 transitions. [2024-11-11 22:58:57,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 647 transitions. [2024-11-11 22:58:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:57,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:57,801 INFO L218 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] [2024-11-11 22:58:57,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:58:57,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:57,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -271137158, now seen corresponding path program 1 times [2024-11-11 22:58:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966850657] [2024-11-11 22:58:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:58:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:58:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:58:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966850657] [2024-11-11 22:58:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966850657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:57,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928763692] [2024-11-11 22:58:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:57,929 INFO L87 Difference]: Start difference. First operand 440 states and 647 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:58,863 INFO L93 Difference]: Finished difference Result 1363 states and 2041 transitions. [2024-11-11 22:58:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:58:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:58,867 INFO L225 Difference]: With dead ends: 1363 [2024-11-11 22:58:58,868 INFO L226 Difference]: Without dead ends: 935 [2024-11-11 22:58:58,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:58,869 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 525 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:58,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 994 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:58:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-11 22:58:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 715. [2024-11-11 22:58:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 615 states have (on average 1.4747967479674797) internal successors, (907), 620 states have internal predecessors, (907), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-11 22:58:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1050 transitions. [2024-11-11 22:58:58,904 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1050 transitions. Word has length 79 [2024-11-11 22:58:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:58,905 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1050 transitions. [2024-11-11 22:58:58,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1050 transitions. [2024-11-11 22:58:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:58,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:58,906 INFO L218 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] [2024-11-11 22:58:58,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:58:58,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -688533764, now seen corresponding path program 1 times [2024-11-11 22:58:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457621040] [2024-11-11 22:58:58,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:58:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:58:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:58:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457621040] [2024-11-11 22:58:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457621040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:58,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:58,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212992472] [2024-11-11 22:58:58,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:58,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:58,990 INFO L87 Difference]: Start difference. First operand 715 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:59,896 INFO L93 Difference]: Finished difference Result 2318 states and 3460 transitions. [2024-11-11 22:58:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:58:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:59,904 INFO L225 Difference]: With dead ends: 2318 [2024-11-11 22:58:59,904 INFO L226 Difference]: Without dead ends: 1615 [2024-11-11 22:58:59,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:59,906 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 521 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:59,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 994 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:58:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-11 22:58:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1266. [2024-11-11 22:58:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1090 states have (on average 1.4688073394495413) internal successors, (1601), 1099 states have internal predecessors, (1601), 113 states have call successors, (113), 54 states have call predecessors, (113), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-11 22:58:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1862 transitions. [2024-11-11 22:58:59,990 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1862 transitions. Word has length 79 [2024-11-11 22:58:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:59,990 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1862 transitions. [2024-11-11 22:58:59,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1862 transitions. [2024-11-11 22:58:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:58:59,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:59,991 INFO L218 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] [2024-11-11 22:58:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:58:59,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -9261510, now seen corresponding path program 1 times [2024-11-11 22:58:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126402076] [2024-11-11 22:58:59,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126402076] [2024-11-11 22:59:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126402076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:00,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:00,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921309985] [2024-11-11 22:59:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:00,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:00,081 INFO L87 Difference]: Start difference. First operand 1266 states and 1862 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:00,795 INFO L93 Difference]: Finished difference Result 2866 states and 4291 transitions. [2024-11-11 22:59:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:59:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:00,813 INFO L225 Difference]: With dead ends: 2866 [2024-11-11 22:59:00,813 INFO L226 Difference]: Without dead ends: 1612 [2024-11-11 22:59:00,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:00,816 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 414 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:00,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 495 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-11 22:59:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1266. [2024-11-11 22:59:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1090 states have (on average 1.4605504587155964) internal successors, (1592), 1099 states have internal predecessors, (1592), 113 states have call successors, (113), 54 states have call predecessors, (113), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-11 22:59:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1853 transitions. [2024-11-11 22:59:00,948 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1853 transitions. Word has length 79 [2024-11-11 22:59:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1853 transitions. [2024-11-11 22:59:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1853 transitions. [2024-11-11 22:59:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:00,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:00,952 INFO L218 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] [2024-11-11 22:59:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:59:00,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:00,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1952313148, now seen corresponding path program 1 times [2024-11-11 22:59:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622171970] [2024-11-11 22:59:00,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622171970] [2024-11-11 22:59:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622171970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:01,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419446413] [2024-11-11 22:59:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:01,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:01,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:01,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:01,057 INFO L87 Difference]: Start difference. First operand 1266 states and 1853 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:02,131 INFO L93 Difference]: Finished difference Result 4528 states and 6708 transitions. [2024-11-11 22:59:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:02,154 INFO L225 Difference]: With dead ends: 4528 [2024-11-11 22:59:02,154 INFO L226 Difference]: Without dead ends: 3274 [2024-11-11 22:59:02,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:02,159 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 610 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 980 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:59:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-11-11 22:59:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2317. [2024-11-11 22:59:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1997 states have (on average 1.4556835252879319) internal successors, (2907), 2014 states have internal predecessors, (2907), 201 states have call successors, (201), 102 states have call predecessors, (201), 118 states have return successors, (298), 216 states have call predecessors, (298), 201 states have call successors, (298) [2024-11-11 22:59:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3406 transitions. [2024-11-11 22:59:02,291 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3406 transitions. Word has length 79 [2024-11-11 22:59:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:02,291 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3406 transitions. [2024-11-11 22:59:02,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3406 transitions. [2024-11-11 22:59:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:02,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:02,293 INFO L218 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] [2024-11-11 22:59:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:59:02,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2140830214, now seen corresponding path program 1 times [2024-11-11 22:59:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168245921] [2024-11-11 22:59:02,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168245921] [2024-11-11 22:59:02,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168245921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:02,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:02,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893184502] [2024-11-11 22:59:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:02,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:02,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:02,414 INFO L87 Difference]: Start difference. First operand 2317 states and 3406 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:03,512 INFO L93 Difference]: Finished difference Result 8017 states and 11911 transitions. [2024-11-11 22:59:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:03,535 INFO L225 Difference]: With dead ends: 8017 [2024-11-11 22:59:03,535 INFO L226 Difference]: Without dead ends: 5712 [2024-11-11 22:59:03,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:03,540 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 526 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:03,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 984 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2024-11-11 22:59:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 4464. [2024-11-11 22:59:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 3864 states have (on average 1.4583333333333333) internal successors, (5635), 3897 states have internal predecessors, (5635), 369 states have call successors, (369), 198 states have call predecessors, (369), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-11 22:59:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 6648 transitions. [2024-11-11 22:59:03,914 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 6648 transitions. Word has length 79 [2024-11-11 22:59:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 4464 states and 6648 transitions. [2024-11-11 22:59:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 6648 transitions. [2024-11-11 22:59:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:03,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:03,919 INFO L218 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] [2024-11-11 22:59:03,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:59:03,919 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:03,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1707101128, now seen corresponding path program 1 times [2024-11-11 22:59:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020179723] [2024-11-11 22:59:03,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020179723] [2024-11-11 22:59:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020179723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:04,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:04,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98559572] [2024-11-11 22:59:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:04,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:04,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:04,013 INFO L87 Difference]: Start difference. First operand 4464 states and 6648 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:04,796 INFO L93 Difference]: Finished difference Result 9974 states and 14995 transitions. [2024-11-11 22:59:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:59:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:04,815 INFO L225 Difference]: With dead ends: 9974 [2024-11-11 22:59:04,815 INFO L226 Difference]: Without dead ends: 5523 [2024-11-11 22:59:04,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:04,825 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 183 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:04,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 687 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:59:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2024-11-11 22:59:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4563. [2024-11-11 22:59:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 3963 states have (on average 1.4468836739843554) internal successors, (5734), 3996 states have internal predecessors, (5734), 369 states have call successors, (369), 198 states have call predecessors, (369), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-11 22:59:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6747 transitions. [2024-11-11 22:59:05,153 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6747 transitions. Word has length 79 [2024-11-11 22:59:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:05,155 INFO L471 AbstractCegarLoop]: Abstraction has 4563 states and 6747 transitions. [2024-11-11 22:59:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6747 transitions. [2024-11-11 22:59:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:05,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:05,159 INFO L218 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] [2024-11-11 22:59:05,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:59:05,159 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1722619846, now seen corresponding path program 1 times [2024-11-11 22:59:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130879913] [2024-11-11 22:59:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130879913] [2024-11-11 22:59:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130879913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:59:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413726405] [2024-11-11 22:59:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:05,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:59:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:59:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:59:05,256 INFO L87 Difference]: Start difference. First operand 4563 states and 6747 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:06,918 INFO L93 Difference]: Finished difference Result 15384 states and 22808 transitions. [2024-11-11 22:59:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:06,952 INFO L225 Difference]: With dead ends: 15384 [2024-11-11 22:59:06,953 INFO L226 Difference]: Without dead ends: 10834 [2024-11-11 22:59:06,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:59:06,965 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 731 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:06,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 746 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:59:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10834 states. [2024-11-11 22:59:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10834 to 8879. [2024-11-11 22:59:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8879 states, 7717 states have (on average 1.4414928080860439) internal successors, (11124), 7782 states have internal predecessors, (11124), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-11 22:59:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 13045 transitions. [2024-11-11 22:59:07,570 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 13045 transitions. Word has length 79 [2024-11-11 22:59:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:07,572 INFO L471 AbstractCegarLoop]: Abstraction has 8879 states and 13045 transitions. [2024-11-11 22:59:07,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 13045 transitions. [2024-11-11 22:59:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:07,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:07,575 INFO L218 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] [2024-11-11 22:59:07,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:59:07,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:07,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash 678905275, now seen corresponding path program 1 times [2024-11-11 22:59:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642472380] [2024-11-11 22:59:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642472380] [2024-11-11 22:59:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642472380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:07,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:07,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579515339] [2024-11-11 22:59:07,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:07,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:07,717 INFO L87 Difference]: Start difference. First operand 8879 states and 13045 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:09,041 INFO L93 Difference]: Finished difference Result 19830 states and 29338 transitions. [2024-11-11 22:59:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:59:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:09,080 INFO L225 Difference]: With dead ends: 19830 [2024-11-11 22:59:09,081 INFO L226 Difference]: Without dead ends: 10964 [2024-11-11 22:59:09,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:59:09,104 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 196 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:09,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 687 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:59:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2024-11-11 22:59:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 8978. [2024-11-11 22:59:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8978 states, 7816 states have (on average 1.4316786079836232) internal successors, (11190), 7881 states have internal predecessors, (11190), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-11 22:59:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8978 states to 8978 states and 13111 transitions. [2024-11-11 22:59:09,856 INFO L78 Accepts]: Start accepts. Automaton has 8978 states and 13111 transitions. Word has length 79 [2024-11-11 22:59:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 8978 states and 13111 transitions. [2024-11-11 22:59:09,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8978 states and 13111 transitions. [2024-11-11 22:59:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:09,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:09,860 INFO L218 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] [2024-11-11 22:59:09,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:59:09,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -218488003, now seen corresponding path program 1 times [2024-11-11 22:59:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:09,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738926972] [2024-11-11 22:59:09,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:09,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738926972] [2024-11-11 22:59:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738926972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:09,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:09,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555218141] [2024-11-11 22:59:09,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:09,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:09,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:09,957 INFO L87 Difference]: Start difference. First operand 8978 states and 13111 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:11,052 INFO L93 Difference]: Finished difference Result 20325 states and 29800 transitions. [2024-11-11 22:59:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:59:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:11,090 INFO L225 Difference]: With dead ends: 20325 [2024-11-11 22:59:11,090 INFO L226 Difference]: Without dead ends: 11360 [2024-11-11 22:59:11,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:59:11,109 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 206 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:11,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 687 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:59:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11360 states. [2024-11-11 22:59:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11360 to 9176. [2024-11-11 22:59:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9176 states, 8014 states have (on average 1.4210132268530071) internal successors, (11388), 8079 states have internal predecessors, (11388), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-11 22:59:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 13309 transitions. [2024-11-11 22:59:11,795 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 13309 transitions. Word has length 79 [2024-11-11 22:59:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:11,796 INFO L471 AbstractCegarLoop]: Abstraction has 9176 states and 13309 transitions. [2024-11-11 22:59:11,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 13309 transitions. [2024-11-11 22:59:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:11,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:11,800 INFO L218 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] [2024-11-11 22:59:11,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:59:11,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:11,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 441043519, now seen corresponding path program 1 times [2024-11-11 22:59:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:11,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135917173] [2024-11-11 22:59:11,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135917173] [2024-11-11 22:59:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135917173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:59:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796054937] [2024-11-11 22:59:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:59:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:59:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:59:11,884 INFO L87 Difference]: Start difference. First operand 9176 states and 13309 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:14,317 INFO L93 Difference]: Finished difference Result 31433 states and 45311 transitions. [2024-11-11 22:59:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:14,438 INFO L225 Difference]: With dead ends: 31433 [2024-11-11 22:59:14,438 INFO L226 Difference]: Without dead ends: 22270 [2024-11-11 22:59:14,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:59:14,465 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 823 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:14,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 746 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:59:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2024-11-11 22:59:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 17850. [2024-11-11 22:59:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17850 states, 15613 states have (on average 1.4151027989495932) internal successors, (22094), 15742 states have internal predecessors, (22094), 1324 states have call successors, (1324), 784 states have call predecessors, (1324), 912 states have return successors, (2331), 1355 states have call predecessors, (2331), 1324 states have call successors, (2331) [2024-11-11 22:59:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 25749 transitions. [2024-11-11 22:59:15,918 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 25749 transitions. Word has length 79 [2024-11-11 22:59:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 17850 states and 25749 transitions. [2024-11-11 22:59:15,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 25749 transitions. [2024-11-11 22:59:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:15,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:15,923 INFO L218 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] [2024-11-11 22:59:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:59:15,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1492492608, now seen corresponding path program 1 times [2024-11-11 22:59:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868392678] [2024-11-11 22:59:15,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:16,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868392678] [2024-11-11 22:59:16,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868392678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241953675] [2024-11-11 22:59:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:16,035 INFO L87 Difference]: Start difference. First operand 17850 states and 25749 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:18,113 INFO L93 Difference]: Finished difference Result 40369 states and 58183 transitions. [2024-11-11 22:59:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:59:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:59:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:18,191 INFO L225 Difference]: With dead ends: 40369 [2024-11-11 22:59:18,191 INFO L226 Difference]: Without dead ends: 22532 [2024-11-11 22:59:18,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:59:18,219 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 208 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:18,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 682 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2024-11-11 22:59:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 18048. [2024-11-11 22:59:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18048 states, 15811 states have (on average 1.4057301878439061) internal successors, (22226), 15940 states have internal predecessors, (22226), 1324 states have call successors, (1324), 784 states have call predecessors, (1324), 912 states have return successors, (2331), 1355 states have call predecessors, (2331), 1324 states have call successors, (2331) [2024-11-11 22:59:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18048 states to 18048 states and 25881 transitions. [2024-11-11 22:59:19,679 INFO L78 Accepts]: Start accepts. Automaton has 18048 states and 25881 transitions. Word has length 79 [2024-11-11 22:59:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:19,679 INFO L471 AbstractCegarLoop]: Abstraction has 18048 states and 25881 transitions. [2024-11-11 22:59:19,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18048 states and 25881 transitions. [2024-11-11 22:59:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:19,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:19,684 INFO L218 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] [2024-11-11 22:59:19,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:59:19,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2100874814, now seen corresponding path program 1 times [2024-11-11 22:59:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96832680] [2024-11-11 22:59:19,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96832680] [2024-11-11 22:59:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96832680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053266542] [2024-11-11 22:59:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:19,842 INFO L87 Difference]: Start difference. First operand 18048 states and 25881 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:21,594 INFO L93 Difference]: Finished difference Result 21912 states and 31122 transitions. [2024-11-11 22:59:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:59:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:21,644 INFO L225 Difference]: With dead ends: 21912 [2024-11-11 22:59:21,644 INFO L226 Difference]: Without dead ends: 12438 [2024-11-11 22:59:21,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:59:21,659 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 882 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:21,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 659 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2024-11-11 22:59:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 9740. [2024-11-11 22:59:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9740 states, 8515 states have (on average 1.3874339401056959) internal successors, (11814), 8580 states have internal predecessors, (11814), 732 states have call successors, (732), 428 states have call predecessors, (732), 492 states have return successors, (1071), 747 states have call predecessors, (1071), 732 states have call successors, (1071) [2024-11-11 22:59:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 13617 transitions. [2024-11-11 22:59:22,277 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 13617 transitions. Word has length 79 [2024-11-11 22:59:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:22,278 INFO L471 AbstractCegarLoop]: Abstraction has 9740 states and 13617 transitions. [2024-11-11 22:59:22,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 13617 transitions. [2024-11-11 22:59:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:22,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:22,280 INFO L218 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] [2024-11-11 22:59:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:59:22,281 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2038835200, now seen corresponding path program 1 times [2024-11-11 22:59:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093416026] [2024-11-11 22:59:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:22,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093416026] [2024-11-11 22:59:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093416026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:22,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288047432] [2024-11-11 22:59:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:22,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:22,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:22,494 INFO L87 Difference]: Start difference. First operand 9740 states and 13617 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:23,681 INFO L93 Difference]: Finished difference Result 12500 states and 17430 transitions. [2024-11-11 22:59:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:59:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:23,707 INFO L225 Difference]: With dead ends: 12500 [2024-11-11 22:59:23,707 INFO L226 Difference]: Without dead ends: 6992 [2024-11-11 22:59:23,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:59:23,718 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 692 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:23,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 747 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2024-11-11 22:59:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 5398. [2024-11-11 22:59:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4713 states have (on average 1.3766178654784638) internal successors, (6488), 4746 states have internal predecessors, (6488), 414 states have call successors, (414), 238 states have call predecessors, (414), 270 states have return successors, (529), 421 states have call predecessors, (529), 414 states have call successors, (529) [2024-11-11 22:59:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7431 transitions. [2024-11-11 22:59:24,058 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7431 transitions. Word has length 79 [2024-11-11 22:59:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 5398 states and 7431 transitions. [2024-11-11 22:59:24,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7431 transitions. [2024-11-11 22:59:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:24,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:24,062 INFO L218 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] [2024-11-11 22:59:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:59:24,062 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:24,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1898286590, now seen corresponding path program 1 times [2024-11-11 22:59:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:24,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216998286] [2024-11-11 22:59:24,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216998286] [2024-11-11 22:59:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216998286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:24,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178804968] [2024-11-11 22:59:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:24,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:24,171 INFO L87 Difference]: Start difference. First operand 5398 states and 7431 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:25,090 INFO L93 Difference]: Finished difference Result 7608 states and 10530 transitions. [2024-11-11 22:59:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:59:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:25,108 INFO L225 Difference]: With dead ends: 7608 [2024-11-11 22:59:25,108 INFO L226 Difference]: Without dead ends: 4301 [2024-11-11 22:59:25,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:59:25,114 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 864 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:25,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 659 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2024-11-11 22:59:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 3257. [2024-11-11 22:59:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3257 states, 2842 states have (on average 1.3754398311048557) internal successors, (3909), 2859 states have internal predecessors, (3909), 255 states have call successors, (255), 143 states have call predecessors, (255), 159 states have return successors, (294), 258 states have call predecessors, (294), 255 states have call successors, (294) [2024-11-11 22:59:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4458 transitions. [2024-11-11 22:59:25,448 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4458 transitions. Word has length 79 [2024-11-11 22:59:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 3257 states and 4458 transitions. [2024-11-11 22:59:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4458 transitions. [2024-11-11 22:59:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:25,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:25,450 INFO L218 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] [2024-11-11 22:59:25,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:59:25,451 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:25,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2032300096, now seen corresponding path program 1 times [2024-11-11 22:59:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132335890] [2024-11-11 22:59:25,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132335890] [2024-11-11 22:59:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132335890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:25,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306209614] [2024-11-11 22:59:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:25,571 INFO L87 Difference]: Start difference. First operand 3257 states and 4458 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:26,841 INFO L93 Difference]: Finished difference Result 6823 states and 9365 transitions. [2024-11-11 22:59:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:59:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:26,860 INFO L225 Difference]: With dead ends: 6823 [2024-11-11 22:59:26,860 INFO L226 Difference]: Without dead ends: 4573 [2024-11-11 22:59:26,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:59:26,866 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 899 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:26,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 654 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-11-11 22:59:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3237. [2024-11-11 22:59:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 2826 states have (on average 1.3690728945506017) internal successors, (3869), 2839 states have internal predecessors, (3869), 255 states have call successors, (255), 143 states have call predecessors, (255), 155 states have return successors, (276), 256 states have call predecessors, (276), 255 states have call successors, (276) [2024-11-11 22:59:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4400 transitions. [2024-11-11 22:59:27,213 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4400 transitions. Word has length 79 [2024-11-11 22:59:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 4400 transitions. [2024-11-11 22:59:27,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4400 transitions. [2024-11-11 22:59:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:27,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:27,215 INFO L218 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] [2024-11-11 22:59:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:59:27,216 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1813445378, now seen corresponding path program 1 times [2024-11-11 22:59:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987277628] [2024-11-11 22:59:27,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987277628] [2024-11-11 22:59:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987277628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:27,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271586912] [2024-11-11 22:59:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:27,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:27,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:27,342 INFO L87 Difference]: Start difference. First operand 3237 states and 4400 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:28,518 INFO L93 Difference]: Finished difference Result 10644 states and 14307 transitions. [2024-11-11 22:59:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:59:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:28,546 INFO L225 Difference]: With dead ends: 10644 [2024-11-11 22:59:28,546 INFO L226 Difference]: Without dead ends: 7421 [2024-11-11 22:59:28,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:59:28,557 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 918 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:28,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 659 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-11-11 22:59:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 5309. [2024-11-11 22:59:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 4628 states have (on average 1.349827139152982) internal successors, (6247), 4665 states have internal predecessors, (6247), 407 states have call successors, (407), 237 states have call predecessors, (407), 273 states have return successors, (478), 410 states have call predecessors, (478), 407 states have call successors, (478) [2024-11-11 22:59:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 7132 transitions. [2024-11-11 22:59:29,011 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 7132 transitions. Word has length 79 [2024-11-11 22:59:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 5309 states and 7132 transitions. [2024-11-11 22:59:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 7132 transitions. [2024-11-11 22:59:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:29,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:29,013 INFO L218 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] [2024-11-11 22:59:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:59:29,013 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1390743552, now seen corresponding path program 1 times [2024-11-11 22:59:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30142404] [2024-11-11 22:59:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30142404] [2024-11-11 22:59:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30142404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:29,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:29,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389872103] [2024-11-11 22:59:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:29,128 INFO L87 Difference]: Start difference. First operand 5309 states and 7132 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:30,251 INFO L93 Difference]: Finished difference Result 10343 states and 13856 transitions. [2024-11-11 22:59:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:59:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:59:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:30,270 INFO L225 Difference]: With dead ends: 10343 [2024-11-11 22:59:30,270 INFO L226 Difference]: Without dead ends: 7053 [2024-11-11 22:59:30,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:59:30,276 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 885 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:30,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 655 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2024-11-11 22:59:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 5229. [2024-11-11 22:59:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4564 states have (on average 1.3442156003505696) internal successors, (6135), 4585 states have internal predecessors, (6135), 407 states have call successors, (407), 237 states have call predecessors, (407), 257 states have return successors, (444), 408 states have call predecessors, (444), 407 states have call successors, (444) [2024-11-11 22:59:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 6986 transitions. [2024-11-11 22:59:30,613 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 6986 transitions. Word has length 79 [2024-11-11 22:59:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:30,614 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 6986 transitions. [2024-11-11 22:59:30,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 6986 transitions. [2024-11-11 22:59:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:59:30,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:30,615 INFO L218 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] [2024-11-11 22:59:30,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 22:59:30,615 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:30,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2086575294, now seen corresponding path program 1 times [2024-11-11 22:59:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:30,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563824317] [2024-11-11 22:59:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563824317] [2024-11-11 22:59:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563824317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:59:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91209616] [2024-11-11 22:59:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:59:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:59:30,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:59:30,666 INFO L87 Difference]: Start difference. First operand 5229 states and 6986 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 22:59:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:31,685 INFO L93 Difference]: Finished difference Result 14042 states and 18859 transitions. [2024-11-11 22:59:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:59:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 79 [2024-11-11 22:59:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:31,711 INFO L225 Difference]: With dead ends: 14042 [2024-11-11 22:59:31,712 INFO L226 Difference]: Without dead ends: 8827 [2024-11-11 22:59:31,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:59:31,724 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 617 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:31,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 409 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:59:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8827 states. [2024-11-11 22:59:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8827 to 6921. [2024-11-11 22:59:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6921 states, 6048 states have (on average 1.3338293650793651) internal successors, (8067), 6097 states have internal predecessors, (8067), 531 states have call successors, (531), 317 states have call predecessors, (531), 341 states have return successors, (572), 508 states have call predecessors, (572), 531 states have call successors, (572) [2024-11-11 22:59:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 9170 transitions. [2024-11-11 22:59:32,194 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 9170 transitions. Word has length 79 [2024-11-11 22:59:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 6921 states and 9170 transitions. [2024-11-11 22:59:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 22:59:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 9170 transitions. [2024-11-11 22:59:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 22:59:32,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:32,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:32,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 22:59:32,199 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:32,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 602038727, now seen corresponding path program 1 times [2024-11-11 22:59:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491217596] [2024-11-11 22:59:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:59:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:59:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 22:59:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:59:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491217596] [2024-11-11 22:59:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491217596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364584961] [2024-11-11 22:59:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:32,381 INFO L87 Difference]: Start difference. First operand 6921 states and 9170 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:34,252 INFO L93 Difference]: Finished difference Result 24464 states and 32606 transitions. [2024-11-11 22:59:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 129 [2024-11-11 22:59:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:34,302 INFO L225 Difference]: With dead ends: 24464 [2024-11-11 22:59:34,302 INFO L226 Difference]: Without dead ends: 17559 [2024-11-11 22:59:34,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:59:34,319 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 758 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:34,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 596 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17559 states. [2024-11-11 22:59:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17559 to 14145. [2024-11-11 22:59:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14145 states, 12357 states have (on average 1.3149631787650724) internal successors, (16249), 12487 states have internal predecessors, (16249), 1044 states have call successors, (1044), 633 states have call predecessors, (1044), 743 states have return successors, (1396), 1028 states have call predecessors, (1396), 1044 states have call successors, (1396) [2024-11-11 22:59:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 18689 transitions. [2024-11-11 22:59:35,305 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 18689 transitions. Word has length 129 [2024-11-11 22:59:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 14145 states and 18689 transitions. [2024-11-11 22:59:35,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 18689 transitions. [2024-11-11 22:59:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 22:59:35,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:35,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:35,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 22:59:35,312 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:35,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash -490596475, now seen corresponding path program 1 times [2024-11-11 22:59:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:35,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448899326] [2024-11-11 22:59:35,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:59:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:59:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 22:59:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 22:59:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448899326] [2024-11-11 22:59:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448899326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:35,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:59:35,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634536291] [2024-11-11 22:59:35,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:35,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:59:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:35,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:59:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:59:35,402 INFO L87 Difference]: Start difference. First operand 14145 states and 18689 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:59:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:36,719 INFO L93 Difference]: Finished difference Result 27782 states and 36685 transitions. [2024-11-11 22:59:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:59:36,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 129 [2024-11-11 22:59:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:36,763 INFO L225 Difference]: With dead ends: 27782 [2024-11-11 22:59:36,764 INFO L226 Difference]: Without dead ends: 13653 [2024-11-11 22:59:36,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:36,782 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 471 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:36,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 307 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:59:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13653 states. [2024-11-11 22:59:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13653 to 10907. [2024-11-11 22:59:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10907 states, 9548 states have (on average 1.311897779639715) internal successors, (12526), 9653 states have internal predecessors, (12526), 785 states have call successors, (785), 475 states have call predecessors, (785), 573 states have return successors, (1044), 780 states have call predecessors, (1044), 785 states have call successors, (1044) [2024-11-11 22:59:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 14355 transitions. [2024-11-11 22:59:37,597 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 14355 transitions. Word has length 129 [2024-11-11 22:59:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 10907 states and 14355 transitions. [2024-11-11 22:59:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:59:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 14355 transitions. [2024-11-11 22:59:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 22:59:37,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:37,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:37,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 22:59:37,605 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1387524436, now seen corresponding path program 1 times [2024-11-11 22:59:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263648525] [2024-11-11 22:59:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:59:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:59:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 22:59:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:59:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263648525] [2024-11-11 22:59:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263648525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:37,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446474287] [2024-11-11 22:59:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:37,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:37,755 INFO L87 Difference]: Start difference. First operand 10907 states and 14355 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:40,396 INFO L93 Difference]: Finished difference Result 38442 states and 50662 transitions. [2024-11-11 22:59:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 131 [2024-11-11 22:59:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:40,485 INFO L225 Difference]: With dead ends: 38442 [2024-11-11 22:59:40,485 INFO L226 Difference]: Without dead ends: 27551 [2024-11-11 22:59:40,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:59:40,505 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1057 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:40,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 406 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:59:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27551 states. [2024-11-11 22:59:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27551 to 22687. [2024-11-11 22:59:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22687 states, 19793 states have (on average 1.2935381195372102) internal successors, (25603), 20130 states have internal predecessors, (25603), 1511 states have call successors, (1511), 945 states have call predecessors, (1511), 1382 states have return successors, (2549), 1613 states have call predecessors, (2549), 1511 states have call successors, (2549) [2024-11-11 22:59:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22687 states to 22687 states and 29663 transitions. [2024-11-11 22:59:42,364 INFO L78 Accepts]: Start accepts. Automaton has 22687 states and 29663 transitions. Word has length 131 [2024-11-11 22:59:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:42,365 INFO L471 AbstractCegarLoop]: Abstraction has 22687 states and 29663 transitions. [2024-11-11 22:59:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 22687 states and 29663 transitions. [2024-11-11 22:59:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 22:59:42,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:42,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:42,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 22:59:42,374 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:42,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash 335693767, now seen corresponding path program 1 times [2024-11-11 22:59:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509335601] [2024-11-11 22:59:42,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:59:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:59:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 22:59:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:59:42,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509335601] [2024-11-11 22:59:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509335601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:42,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277999261] [2024-11-11 22:59:42,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:42,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:42,583 INFO L87 Difference]: Start difference. First operand 22687 states and 29663 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:47,809 INFO L93 Difference]: Finished difference Result 78028 states and 102332 transitions. [2024-11-11 22:59:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 133 [2024-11-11 22:59:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:48,008 INFO L225 Difference]: With dead ends: 78028 [2024-11-11 22:59:48,009 INFO L226 Difference]: Without dead ends: 55357 [2024-11-11 22:59:48,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:59:48,061 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 800 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:48,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 622 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55357 states. [2024-11-11 22:59:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55357 to 45063. [2024-11-11 22:59:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45063 states, 39038 states have (on average 1.285926533121574) internal successors, (50200), 39904 states have internal predecessors, (50200), 2934 states have call successors, (2934), 1875 states have call predecessors, (2934), 3090 states have return successors, (5727), 3287 states have call predecessors, (5727), 2934 states have call successors, (5727) [2024-11-11 22:59:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45063 states to 45063 states and 58861 transitions. [2024-11-11 22:59:52,751 INFO L78 Accepts]: Start accepts. Automaton has 45063 states and 58861 transitions. Word has length 133 [2024-11-11 22:59:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 45063 states and 58861 transitions. [2024-11-11 22:59:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:59:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 45063 states and 58861 transitions. [2024-11-11 22:59:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 22:59:52,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:52,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:52,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 22:59:52,768 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:52,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1714715131, now seen corresponding path program 1 times [2024-11-11 22:59:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133089496] [2024-11-11 22:59:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:59:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:59:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:59:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:59:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:59:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:59:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 22:59:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 22:59:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133089496] [2024-11-11 22:59:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133089496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:59:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367508572] [2024-11-11 22:59:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:52,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:59:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:59:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:59:52,830 INFO L87 Difference]: Start difference. First operand 45063 states and 58861 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:59:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:57,805 INFO L93 Difference]: Finished difference Result 87439 states and 114624 transitions. [2024-11-11 22:59:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:59:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 133 [2024-11-11 22:59:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:57,949 INFO L225 Difference]: With dead ends: 87439 [2024-11-11 22:59:57,949 INFO L226 Difference]: Without dead ends: 42392 [2024-11-11 22:59:58,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:58,009 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 468 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 305 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:59:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42392 states. [2024-11-11 23:00:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42392 to 34652. [2024-11-11 23:00:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34652 states, 30015 states have (on average 1.289488589038814) internal successors, (38704), 30712 states have internal predecessors, (38704), 2220 states have call successors, (2220), 1410 states have call predecessors, (2220), 2416 states have return successors, (4503), 2531 states have call predecessors, (4503), 2220 states have call successors, (4503) [2024-11-11 23:00:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 45427 transitions. [2024-11-11 23:00:02,063 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 45427 transitions. Word has length 133 [2024-11-11 23:00:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:00:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 34652 states and 45427 transitions. [2024-11-11 23:00:02,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 23:00:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 45427 transitions. [2024-11-11 23:00:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 23:00:02,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:00:02,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:00:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 23:00:02,076 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:00:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:00:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1201892844, now seen corresponding path program 1 times [2024-11-11 23:00:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:00:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165739231] [2024-11-11 23:00:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:00:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:00:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 23:00:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 23:00:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 23:00:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 23:00:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 23:00:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 23:00:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 23:00:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 23:00:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 23:00:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:00:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165739231] [2024-11-11 23:00:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165739231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:00:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:00:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:00:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711332549] [2024-11-11 23:00:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:00:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:00:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:00:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:00:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:00:02,178 INFO L87 Difference]: Start difference. First operand 34652 states and 45427 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8)