./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.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 af1a65b4dba99a03062f9c0ef0e7df0ff9812521932f446bc475a13832d55c02 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:47:45,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:47:45,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:47:45,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:47:45,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:47:45,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:47:45,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:47:45,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:47:45,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:47:45,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:47:45,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:47:45,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:47:45,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:47:45,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:47:45,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:47:45,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:47:45,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:47:45,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:47:45,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:47:45,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:47:45,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:47:45,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:47:45,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:47:45,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:47:45,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:47:45,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:47:45,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:47:45,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:47:45,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:47:45,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:47:45,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:47:45,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:47:45,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:45,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:47:45,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:47:45,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:47:45,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:47:45,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:47:45,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:47:45,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:47:45,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:47:45,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:47:45,828 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 -> af1a65b4dba99a03062f9c0ef0e7df0ff9812521932f446bc475a13832d55c02 [2024-10-12 21:47:46,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:47:46,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:47:46,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:47:46,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:47:46,088 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:47:46,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c [2024-10-12 21:47:47,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:47:47,869 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:47:47,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c [2024-10-12 21:47:47,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a36334c/748e2bc7fc40421fa0677cf7cfc352b3/FLAGdb7726df5 [2024-10-12 21:47:48,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a36334c/748e2bc7fc40421fa0677cf7cfc352b3 [2024-10-12 21:47:48,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:47:48,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:47:48,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:48,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:47:48,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:47:48,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a27911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48, skipping insertion in model container [2024-10-12 21:47:48,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:47:48,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c[911,924] [2024-10-12 21:47:48,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c[8416,8429] [2024-10-12 21:47:48,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:48,692 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:47:48,712 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c[911,924] [2024-10-12 21:47:48,746 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c[8416,8429] [2024-10-12 21:47:48,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:48,831 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:47:48,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48 WrapperNode [2024-10-12 21:47:48,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:48,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:48,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:47:48,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:47:48,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,893 INFO L138 Inliner]: procedures = 81, calls = 101, calls flagged for inlining = 49, calls inlined = 49, statements flattened = 1170 [2024-10-12 21:47:48,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:48,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:47:48,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:47:48,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:47:48,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:47:48,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:48,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:49,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:47:49,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:47:49,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:47:49,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:47:49,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (1/1) ... [2024-10-12 21:47:49,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:49,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:49,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:47:49,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:47:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:47:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:47:49,089 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:47:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:47:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:47:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:47:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:47:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:47:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:47:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:47:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:47:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:47:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:47:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:47:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:47:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:47:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:47:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:47:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:47:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:47:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:47:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:47:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:47:49,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:47:49,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:47:49,971 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:47:49,972 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-12 21:47:50,187 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-12 21:47:50,187 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:47:50,253 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:47:50,253 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-12 21:47:50,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:50 BoogieIcfgContainer [2024-10-12 21:47:50,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:47:50,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:47:50,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:47:50,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:47:50,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:47:48" (1/3) ... [2024-10-12 21:47:50,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111b55c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:50, skipping insertion in model container [2024-10-12 21:47:50,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:48" (2/3) ... [2024-10-12 21:47:50,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111b55c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:50, skipping insertion in model container [2024-10-12 21:47:50,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:50" (3/3) ... [2024-10-12 21:47:50,263 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.15.cil.c [2024-10-12 21:47:50,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:47:50,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:47:50,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:47:50,351 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;@4af90c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:47:50,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:47:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 481 states, 418 states have (on average 1.7200956937799043) internal successors, (719), 426 states have internal predecessors, (719), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-12 21:47:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:50,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:50,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:50,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -496887913, now seen corresponding path program 1 times [2024-10-12 21:47:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205361329] [2024-10-12 21:47:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205361329] [2024-10-12 21:47:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205361329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:50,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564239444] [2024-10-12 21:47:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:50,979 INFO L87 Difference]: Start difference. First operand has 481 states, 418 states have (on average 1.7200956937799043) internal successors, (719), 426 states have internal predecessors, (719), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:52,634 INFO L93 Difference]: Finished difference Result 1073 states and 1793 transitions. [2024-10-12 21:47:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:47:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:47:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:52,661 INFO L225 Difference]: With dead ends: 1073 [2024-10-12 21:47:52,665 INFO L226 Difference]: Without dead ends: 613 [2024-10-12 21:47:52,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:52,683 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 908 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:52,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2264 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-12 21:47:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 576. [2024-10-12 21:47:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 494 states have (on average 1.5951417004048583) internal successors, (788), 501 states have internal predecessors, (788), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2024-10-12 21:47:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 905 transitions. [2024-10-12 21:47:52,799 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 905 transitions. Word has length 57 [2024-10-12 21:47:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:52,799 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 905 transitions. [2024-10-12 21:47:52,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 905 transitions. [2024-10-12 21:47:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:52,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:52,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:47:52,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1854086615, now seen corresponding path program 1 times [2024-10-12 21:47:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331954747] [2024-10-12 21:47:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331954747] [2024-10-12 21:47:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331954747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141364278] [2024-10-12 21:47:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:53,040 INFO L87 Difference]: Start difference. First operand 576 states and 905 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:55,394 INFO L93 Difference]: Finished difference Result 1511 states and 2267 transitions. [2024-10-12 21:47:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2024-10-12 21:47:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:55,407 INFO L225 Difference]: With dead ends: 1511 [2024-10-12 21:47:55,407 INFO L226 Difference]: Without dead ends: 1311 [2024-10-12 21:47:55,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:55,410 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 4280 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4300 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4300 Valid, 2144 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:47:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2024-10-12 21:47:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1192. [2024-10-12 21:47:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 980 states have (on average 1.5) internal successors, (1470), 995 states have internal predecessors, (1470), 129 states have call successors, (129), 75 states have call predecessors, (129), 81 states have return successors, (139), 123 states have call predecessors, (139), 125 states have call successors, (139) [2024-10-12 21:47:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1738 transitions. [2024-10-12 21:47:55,536 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1738 transitions. Word has length 57 [2024-10-12 21:47:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:55,537 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1738 transitions. [2024-10-12 21:47:55,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1738 transitions. [2024-10-12 21:47:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:55,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:55,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:47:55,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:55,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1330642772, now seen corresponding path program 1 times [2024-10-12 21:47:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762050669] [2024-10-12 21:47:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762050669] [2024-10-12 21:47:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762050669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:55,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890069026] [2024-10-12 21:47:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:55,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:55,726 INFO L87 Difference]: Start difference. First operand 1192 states and 1738 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:57,029 INFO L93 Difference]: Finished difference Result 2118 states and 3026 transitions. [2024-10-12 21:47:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:47:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 21:47:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:57,035 INFO L225 Difference]: With dead ends: 2118 [2024-10-12 21:47:57,036 INFO L226 Difference]: Without dead ends: 1308 [2024-10-12 21:47:57,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:47:57,039 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 667 mSDsluCounter, 2291 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:57,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2681 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-12 21:47:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1216. [2024-10-12 21:47:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 998 states have (on average 1.4879759519038076) internal successors, (1485), 1013 states have internal predecessors, (1485), 129 states have call successors, (129), 75 states have call predecessors, (129), 87 states have return successors, (145), 129 states have call predecessors, (145), 125 states have call successors, (145) [2024-10-12 21:47:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1759 transitions. [2024-10-12 21:47:57,100 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1759 transitions. Word has length 58 [2024-10-12 21:47:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:57,100 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1759 transitions. [2024-10-12 21:47:57,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:47:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1759 transitions. [2024-10-12 21:47:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:57,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:57,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:57,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:47:57,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1403029330, now seen corresponding path program 1 times [2024-10-12 21:47:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510665217] [2024-10-12 21:47:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510665217] [2024-10-12 21:47:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510665217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460088769] [2024-10-12 21:47:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:57,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:57,240 INFO L87 Difference]: Start difference. First operand 1216 states and 1759 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:59,158 INFO L93 Difference]: Finished difference Result 3348 states and 4740 transitions. [2024-10-12 21:47:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-12 21:47:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:59,169 INFO L225 Difference]: With dead ends: 3348 [2024-10-12 21:47:59,170 INFO L226 Difference]: Without dead ends: 1446 [2024-10-12 21:47:59,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:59,179 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 3901 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:59,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 2558 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-12 21:47:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1309. [2024-10-12 21:47:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1056 states have (on average 1.4460227272727273) internal successors, (1527), 1071 states have internal predecessors, (1527), 149 states have call successors, (149), 89 states have call predecessors, (149), 102 states have return successors, (166), 150 states have call predecessors, (166), 145 states have call successors, (166) [2024-10-12 21:47:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1842 transitions. [2024-10-12 21:47:59,310 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1842 transitions. Word has length 58 [2024-10-12 21:47:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 1309 states and 1842 transitions. [2024-10-12 21:47:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1842 transitions. [2024-10-12 21:47:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:59,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:59,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:47:59,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1829513589, now seen corresponding path program 1 times [2024-10-12 21:47:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:59,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566631881] [2024-10-12 21:47:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566631881] [2024-10-12 21:47:59,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566631881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:59,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:59,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596749892] [2024-10-12 21:47:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:59,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:59,502 INFO L87 Difference]: Start difference. First operand 1309 states and 1842 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:48:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:00,700 INFO L93 Difference]: Finished difference Result 2383 states and 3284 transitions. [2024-10-12 21:48:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:48:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-12 21:48:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:00,707 INFO L225 Difference]: With dead ends: 2383 [2024-10-12 21:48:00,707 INFO L226 Difference]: Without dead ends: 1456 [2024-10-12 21:48:00,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:48:00,712 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 986 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:00,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2347 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:48:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-10-12 21:48:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1341. [2024-10-12 21:48:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1080 states have (on average 1.4333333333333333) internal successors, (1548), 1095 states have internal predecessors, (1548), 149 states have call successors, (149), 89 states have call predecessors, (149), 110 states have return successors, (174), 158 states have call predecessors, (174), 145 states have call successors, (174) [2024-10-12 21:48:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1871 transitions. [2024-10-12 21:48:00,774 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1871 transitions. Word has length 80 [2024-10-12 21:48:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1871 transitions. [2024-10-12 21:48:00,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:48:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1871 transitions. [2024-10-12 21:48:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:00,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:00,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:48:00,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:00,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 98759113, now seen corresponding path program 1 times [2024-10-12 21:48:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692788260] [2024-10-12 21:48:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:48:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692788260] [2024-10-12 21:48:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692788260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:48:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983798083] [2024-10-12 21:48:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:48:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:48:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:00,943 INFO L87 Difference]: Start difference. First operand 1341 states and 1871 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:48:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:02,115 INFO L93 Difference]: Finished difference Result 3215 states and 4312 transitions. [2024-10-12 21:48:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:48:02,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-12 21:48:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:02,124 INFO L225 Difference]: With dead ends: 3215 [2024-10-12 21:48:02,125 INFO L226 Difference]: Without dead ends: 2257 [2024-10-12 21:48:02,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:48:02,129 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1481 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:02,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 2018 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:48:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-10-12 21:48:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1963. [2024-10-12 21:48:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1554 states have (on average 1.388030888030888) internal successors, (2157), 1582 states have internal predecessors, (2157), 225 states have call successors, (225), 142 states have call predecessors, (225), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2024-10-12 21:48:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2669 transitions. [2024-10-12 21:48:02,230 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2669 transitions. Word has length 80 [2024-10-12 21:48:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2669 transitions. [2024-10-12 21:48:02,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:48:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2669 transitions. [2024-10-12 21:48:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:02,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:02,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:48:02,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:02,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 522405835, now seen corresponding path program 1 times [2024-10-12 21:48:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796223511] [2024-10-12 21:48:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:48:02,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:02,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796223511] [2024-10-12 21:48:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796223511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:02,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395223196] [2024-10-12 21:48:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:02,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:02,361 INFO L87 Difference]: Start difference. First operand 1963 states and 2669 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:48:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:03,398 INFO L93 Difference]: Finished difference Result 5336 states and 7165 transitions. [2024-10-12 21:48:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:48:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-10-12 21:48:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:03,413 INFO L225 Difference]: With dead ends: 5336 [2024-10-12 21:48:03,413 INFO L226 Difference]: Without dead ends: 3758 [2024-10-12 21:48:03,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:48:03,419 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1766 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:03,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 1318 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:48:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-12 21:48:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3542. [2024-10-12 21:48:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 2752 states have (on average 1.3372093023255813) internal successors, (3680), 2816 states have internal predecessors, (3680), 418 states have call successors, (418), 276 states have call predecessors, (418), 370 states have return successors, (627), 454 states have call predecessors, (627), 414 states have call successors, (627) [2024-10-12 21:48:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4725 transitions. [2024-10-12 21:48:03,621 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4725 transitions. Word has length 80 [2024-10-12 21:48:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:03,623 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 4725 transitions. [2024-10-12 21:48:03,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:48:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4725 transitions. [2024-10-12 21:48:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:03,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:03,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:48:03,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:03,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash 599306633, now seen corresponding path program 1 times [2024-10-12 21:48:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133830610] [2024-10-12 21:48:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:48:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133830610] [2024-10-12 21:48:03,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133830610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:03,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:03,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:48:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819506923] [2024-10-12 21:48:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:48:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:48:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:48:03,704 INFO L87 Difference]: Start difference. First operand 3542 states and 4725 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:48:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:04,361 INFO L93 Difference]: Finished difference Result 5236 states and 6884 transitions. [2024-10-12 21:48:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:48:04,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-12 21:48:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:04,371 INFO L225 Difference]: With dead ends: 5236 [2024-10-12 21:48:04,371 INFO L226 Difference]: Without dead ends: 2079 [2024-10-12 21:48:04,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:04,378 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1103 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:04,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1244 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:48:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-10-12 21:48:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1963. [2024-10-12 21:48:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1554 states have (on average 1.3603603603603605) internal successors, (2114), 1582 states have internal predecessors, (2114), 225 states have call successors, (225), 142 states have call predecessors, (225), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2024-10-12 21:48:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2626 transitions. [2024-10-12 21:48:04,509 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2626 transitions. Word has length 80 [2024-10-12 21:48:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:04,510 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2626 transitions. [2024-10-12 21:48:04,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:48:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2626 transitions. [2024-10-12 21:48:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:48:04,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:04,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:04,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:48:04,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash 568230019, now seen corresponding path program 1 times [2024-10-12 21:48:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032503716] [2024-10-12 21:48:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:48:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032503716] [2024-10-12 21:48:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032503716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:48:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045991893] [2024-10-12 21:48:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:04,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:48:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:48:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:48:04,619 INFO L87 Difference]: Start difference. First operand 1963 states and 2626 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:48:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:06,134 INFO L93 Difference]: Finished difference Result 4564 states and 6003 transitions. [2024-10-12 21:48:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 21:48:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-10-12 21:48:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:06,145 INFO L225 Difference]: With dead ends: 4564 [2024-10-12 21:48:06,146 INFO L226 Difference]: Without dead ends: 2699 [2024-10-12 21:48:06,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-12 21:48:06,171 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 2068 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:06,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 2384 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:48:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2024-10-12 21:48:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2535. [2024-10-12 21:48:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 1970 states have (on average 1.3172588832487309) internal successors, (2595), 2006 states have internal predecessors, (2595), 303 states have call successors, (303), 190 states have call predecessors, (303), 260 states have return successors, (420), 341 states have call predecessors, (420), 299 states have call successors, (420) [2024-10-12 21:48:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3318 transitions. [2024-10-12 21:48:06,331 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3318 transitions. Word has length 81 [2024-10-12 21:48:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3318 transitions. [2024-10-12 21:48:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:48:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3318 transitions. [2024-10-12 21:48:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 21:48:06,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:06,336 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:48:06,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1314556026, now seen corresponding path program 1 times [2024-10-12 21:48:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2353624] [2024-10-12 21:48:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 21:48:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:48:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 21:48:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 21:48:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 21:48:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2353624] [2024-10-12 21:48:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2353624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848644671] [2024-10-12 21:48:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:06,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:06,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:48:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:48:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:06,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 21:48:06,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848644671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:06,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092703622] [2024-10-12 21:48:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:06,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:06,749 INFO L87 Difference]: Start difference. First operand 2535 states and 3318 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:48:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:07,097 INFO L93 Difference]: Finished difference Result 6502 states and 8275 transitions. [2024-10-12 21:48:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:07,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-12 21:48:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:07,113 INFO L225 Difference]: With dead ends: 6502 [2024-10-12 21:48:07,114 INFO L226 Difference]: Without dead ends: 4494 [2024-10-12 21:48:07,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:07,118 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 57 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:07,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1365 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:48:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-10-12 21:48:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4451. [2024-10-12 21:48:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 3419 states have (on average 1.2772740567417373) internal successors, (4367), 3484 states have internal predecessors, (4367), 537 states have call successors, (537), 372 states have call predecessors, (537), 493 states have return successors, (727), 597 states have call predecessors, (727), 533 states have call successors, (727) [2024-10-12 21:48:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 5631 transitions. [2024-10-12 21:48:07,464 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 5631 transitions. Word has length 145 [2024-10-12 21:48:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 4451 states and 5631 transitions. [2024-10-12 21:48:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:48:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 5631 transitions. [2024-10-12 21:48:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:48:07,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:07,469 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 21:48:07,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:48:07,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 21:48:07,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:07,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1366588858, now seen corresponding path program 1 times [2024-10-12 21:48:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914491777] [2024-10-12 21:48:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:48:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:48:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:48:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:48:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:48:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:48:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 21:48:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914491777] [2024-10-12 21:48:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914491777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510635705] [2024-10-12 21:48:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:07,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:07,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:07,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:48:07,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:48:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:08,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-12 21:48:08,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510635705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:08,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650109700] [2024-10-12 21:48:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:08,165 INFO L87 Difference]: Start difference. First operand 4451 states and 5631 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 21:48:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:08,714 INFO L93 Difference]: Finished difference Result 12583 states and 15633 transitions. [2024-10-12 21:48:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2024-10-12 21:48:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:08,751 INFO L225 Difference]: With dead ends: 12583 [2024-10-12 21:48:08,751 INFO L226 Difference]: Without dead ends: 8517 [2024-10-12 21:48:08,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:08,761 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 48 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:08,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1364 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:48:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2024-10-12 21:48:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 8509. [2024-10-12 21:48:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8509 states, 6490 states have (on average 1.250693374422188) internal successors, (8117), 6615 states have internal predecessors, (8117), 1037 states have call successors, (1037), 736 states have call predecessors, (1037), 980 states have return successors, (1420), 1160 states have call predecessors, (1420), 1033 states have call successors, (1420) [2024-10-12 21:48:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 10574 transitions. [2024-10-12 21:48:09,470 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 10574 transitions. Word has length 175 [2024-10-12 21:48:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 8509 states and 10574 transitions. [2024-10-12 21:48:09,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 21:48:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 10574 transitions. [2024-10-12 21:48:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:48:09,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:09,477 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 21:48:09,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:48:09,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 21:48:09,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:09,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash 972222072, now seen corresponding path program 1 times [2024-10-12 21:48:09,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:09,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537540015] [2024-10-12 21:48:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:48:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:48:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:48:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:48:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:48:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:48:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 21:48:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537540015] [2024-10-12 21:48:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537540015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459837385] [2024-10-12 21:48:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:09,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:48:09,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:48:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:10,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-12 21:48:10,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459837385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395284136] [2024-10-12 21:48:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:10,183 INFO L87 Difference]: Start difference. First operand 8509 states and 10574 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 21:48:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:10,695 INFO L93 Difference]: Finished difference Result 14519 states and 18294 transitions. [2024-10-12 21:48:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 175 [2024-10-12 21:48:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:10,707 INFO L225 Difference]: With dead ends: 14519 [2024-10-12 21:48:10,707 INFO L226 Difference]: Without dead ends: 375 [2024-10-12 21:48:10,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:10,732 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 635 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:10,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 677 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:48:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-12 21:48:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-12 21:48:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.640117994100295) internal successors, (556), 341 states have internal predecessors, (556), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:48:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 612 transitions. [2024-10-12 21:48:10,789 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 612 transitions. Word has length 175 [2024-10-12 21:48:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 612 transitions. [2024-10-12 21:48:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 21:48:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 612 transitions. [2024-10-12 21:48:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:10,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:10,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:10,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:48:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:10,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:10,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash -647349812, now seen corresponding path program 1 times [2024-10-12 21:48:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992847214] [2024-10-12 21:48:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992847214] [2024-10-12 21:48:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992847214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:48:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335145138] [2024-10-12 21:48:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:48:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:48:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:48:11,151 INFO L87 Difference]: Start difference. First operand 375 states and 612 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:12,507 INFO L93 Difference]: Finished difference Result 880 states and 1458 transitions. [2024-10-12 21:48:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:12,513 INFO L225 Difference]: With dead ends: 880 [2024-10-12 21:48:12,514 INFO L226 Difference]: Without dead ends: 515 [2024-10-12 21:48:12,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:12,515 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1053 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:12,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 680 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:48:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-12 21:48:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 375. [2024-10-12 21:48:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.6371681415929205) internal successors, (555), 341 states have internal predecessors, (555), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:48:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 611 transitions. [2024-10-12 21:48:12,534 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 611 transitions. Word has length 172 [2024-10-12 21:48:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 611 transitions. [2024-10-12 21:48:12,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 611 transitions. [2024-10-12 21:48:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:12,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:12,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:48:12,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2051218998, now seen corresponding path program 1 times [2024-10-12 21:48:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221338031] [2024-10-12 21:48:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221338031] [2024-10-12 21:48:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221338031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:12,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:12,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:48:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496950151] [2024-10-12 21:48:12,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:48:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:48:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:48:12,686 INFO L87 Difference]: Start difference. First operand 375 states and 611 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:14,156 INFO L93 Difference]: Finished difference Result 872 states and 1441 transitions. [2024-10-12 21:48:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:14,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:14,162 INFO L225 Difference]: With dead ends: 872 [2024-10-12 21:48:14,162 INFO L226 Difference]: Without dead ends: 515 [2024-10-12 21:48:14,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:14,163 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1044 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:14,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 678 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:48:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-12 21:48:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 375. [2024-10-12 21:48:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.6342182890855457) internal successors, (554), 341 states have internal predecessors, (554), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:48:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 610 transitions. [2024-10-12 21:48:14,182 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 610 transitions. Word has length 172 [2024-10-12 21:48:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:14,182 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 610 transitions. [2024-10-12 21:48:14,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 610 transitions. [2024-10-12 21:48:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:14,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:14,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:14,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:48:14,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:14,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -646027320, now seen corresponding path program 1 times [2024-10-12 21:48:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276416996] [2024-10-12 21:48:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276416996] [2024-10-12 21:48:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276416996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:48:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892765035] [2024-10-12 21:48:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:14,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:48:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:48:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:48:14,377 INFO L87 Difference]: Start difference. First operand 375 states and 610 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:17,005 INFO L93 Difference]: Finished difference Result 1386 states and 2306 transitions. [2024-10-12 21:48:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:48:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:17,012 INFO L225 Difference]: With dead ends: 1386 [2024-10-12 21:48:17,013 INFO L226 Difference]: Without dead ends: 1031 [2024-10-12 21:48:17,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:17,014 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1597 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:17,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 1147 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:48:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-12 21:48:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 750. [2024-10-12 21:48:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 685 states have (on average 1.6452554744525547) internal successors, (1127), 688 states have internal predecessors, (1127), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-12 21:48:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1230 transitions. [2024-10-12 21:48:17,073 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1230 transitions. Word has length 172 [2024-10-12 21:48:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:17,073 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1230 transitions. [2024-10-12 21:48:17,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1230 transitions. [2024-10-12 21:48:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:17,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:17,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:48:17,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 359077956, now seen corresponding path program 1 times [2024-10-12 21:48:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069241047] [2024-10-12 21:48:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069241047] [2024-10-12 21:48:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069241047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908242692] [2024-10-12 21:48:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:17,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:17,304 INFO L87 Difference]: Start difference. First operand 750 states and 1230 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:20,482 INFO L93 Difference]: Finished difference Result 2297 states and 3828 transitions. [2024-10-12 21:48:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:20,489 INFO L225 Difference]: With dead ends: 2297 [2024-10-12 21:48:20,490 INFO L226 Difference]: Without dead ends: 1567 [2024-10-12 21:48:20,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:20,492 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1634 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:20,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2188 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4019 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-12 21:48:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1096. [2024-10-12 21:48:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1002 states have (on average 1.6387225548902196) internal successors, (1642), 1006 states have internal predecessors, (1642), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:48:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1791 transitions. [2024-10-12 21:48:20,545 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1791 transitions. Word has length 172 [2024-10-12 21:48:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:20,545 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1791 transitions. [2024-10-12 21:48:20,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1791 transitions. [2024-10-12 21:48:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:20,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:20,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:48:20,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:20,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 744940358, now seen corresponding path program 1 times [2024-10-12 21:48:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86698898] [2024-10-12 21:48:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86698898] [2024-10-12 21:48:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86698898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:20,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6413307] [2024-10-12 21:48:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:20,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:20,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:20,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:20,742 INFO L87 Difference]: Start difference. First operand 1096 states and 1791 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:23,796 INFO L93 Difference]: Finished difference Result 3632 states and 6043 transitions. [2024-10-12 21:48:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:23,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:23,808 INFO L225 Difference]: With dead ends: 3632 [2024-10-12 21:48:23,808 INFO L226 Difference]: Without dead ends: 2556 [2024-10-12 21:48:23,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:23,813 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1632 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:23,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2186 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:48:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-10-12 21:48:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2024-10-12 21:48:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1637 states have (on average 1.6328649969456324) internal successors, (2673), 1643 states have internal predecessors, (2673), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:48:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2918 transitions. [2024-10-12 21:48:23,920 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2918 transitions. Word has length 172 [2024-10-12 21:48:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:23,921 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2918 transitions. [2024-10-12 21:48:23,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2918 transitions. [2024-10-12 21:48:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:23,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:23,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:23,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:48:23,923 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 480292868, now seen corresponding path program 1 times [2024-10-12 21:48:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864253152] [2024-10-12 21:48:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864253152] [2024-10-12 21:48:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864253152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251395239] [2024-10-12 21:48:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:24,176 INFO L87 Difference]: Start difference. First operand 1789 states and 2918 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:27,385 INFO L93 Difference]: Finished difference Result 6189 states and 10262 transitions. [2024-10-12 21:48:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:27,413 INFO L225 Difference]: With dead ends: 6189 [2024-10-12 21:48:27,414 INFO L226 Difference]: Without dead ends: 4420 [2024-10-12 21:48:27,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:27,419 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1628 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:27,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 2186 Invalid, 4075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-12 21:48:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3176. [2024-10-12 21:48:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3176 states, 2908 states have (on average 1.6282668500687758) internal successors, (4735), 2918 states have internal predecessors, (4735), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 21:48:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 5178 transitions. [2024-10-12 21:48:27,613 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 5178 transitions. Word has length 172 [2024-10-12 21:48:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:27,614 INFO L471 AbstractCegarLoop]: Abstraction has 3176 states and 5178 transitions. [2024-10-12 21:48:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 5178 transitions. [2024-10-12 21:48:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:27,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:27,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:27,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:48:27,616 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1883548794, now seen corresponding path program 1 times [2024-10-12 21:48:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679284502] [2024-10-12 21:48:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679284502] [2024-10-12 21:48:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679284502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709969946] [2024-10-12 21:48:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:27,846 INFO L87 Difference]: Start difference. First operand 3176 states and 5178 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:30,868 INFO L93 Difference]: Finished difference Result 11302 states and 18716 transitions. [2024-10-12 21:48:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:30,897 INFO L225 Difference]: With dead ends: 11302 [2024-10-12 21:48:30,897 INFO L226 Difference]: Without dead ends: 8146 [2024-10-12 21:48:30,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:30,907 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1756 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:30,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 1416 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3304 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:48:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8146 states. [2024-10-12 21:48:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8146 to 5955. [2024-10-12 21:48:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5955 states, 5455 states have (on average 1.625114573785518) internal successors, (8865), 5473 states have internal predecessors, (8865), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:48:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5955 states to 5955 states and 9722 transitions. [2024-10-12 21:48:31,265 INFO L78 Accepts]: Start accepts. Automaton has 5955 states and 9722 transitions. Word has length 172 [2024-10-12 21:48:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 5955 states and 9722 transitions. [2024-10-12 21:48:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5955 states and 9722 transitions. [2024-10-12 21:48:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:31,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:31,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:48:31,270 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:31,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1088239556, now seen corresponding path program 1 times [2024-10-12 21:48:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887128294] [2024-10-12 21:48:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887128294] [2024-10-12 21:48:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887128294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:31,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:31,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326658383] [2024-10-12 21:48:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:31,474 INFO L87 Difference]: Start difference. First operand 5955 states and 9722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:35,340 INFO L93 Difference]: Finished difference Result 21512 states and 35654 transitions. [2024-10-12 21:48:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:35,381 INFO L225 Difference]: With dead ends: 21512 [2024-10-12 21:48:35,381 INFO L226 Difference]: Without dead ends: 15577 [2024-10-12 21:48:35,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:35,394 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1626 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:35,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 2186 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15577 states. [2024-10-12 21:48:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15577 to 11543. [2024-10-12 21:48:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11543 states, 10579 states have (on average 1.6236884393609983) internal successors, (17177), 10613 states have internal predecessors, (17177), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-12 21:48:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 18916 transitions. [2024-10-12 21:48:36,065 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 18916 transitions. Word has length 172 [2024-10-12 21:48:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:36,066 INFO L471 AbstractCegarLoop]: Abstraction has 11543 states and 18916 transitions. [2024-10-12 21:48:36,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 18916 transitions. [2024-10-12 21:48:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:36,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:36,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:36,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:48:36,073 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1426527106, now seen corresponding path program 1 times [2024-10-12 21:48:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202746744] [2024-10-12 21:48:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:36,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202746744] [2024-10-12 21:48:36,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202746744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:36,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:36,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579768672] [2024-10-12 21:48:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:36,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:36,264 INFO L87 Difference]: Start difference. First operand 11543 states and 18916 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:40,682 INFO L93 Difference]: Finished difference Result 41966 states and 69786 transitions. [2024-10-12 21:48:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:40,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:40,794 INFO L225 Difference]: With dead ends: 41966 [2024-10-12 21:48:40,794 INFO L226 Difference]: Without dead ends: 30443 [2024-10-12 21:48:40,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:40,833 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1625 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3951 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:40,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 2186 Invalid, 4020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3951 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30443 states. [2024-10-12 21:48:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30443 to 22748. [2024-10-12 21:48:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22748 states, 20856 states have (on average 1.622698504027618) internal successors, (33843), 20922 states have internal predecessors, (33843), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-10-12 21:48:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22748 states to 22748 states and 37508 transitions. [2024-10-12 21:48:42,419 INFO L78 Accepts]: Start accepts. Automaton has 22748 states and 37508 transitions. Word has length 172 [2024-10-12 21:48:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 22748 states and 37508 transitions. [2024-10-12 21:48:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22748 states and 37508 transitions. [2024-10-12 21:48:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:42,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:48:42,432 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1853081604, now seen corresponding path program 1 times [2024-10-12 21:48:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907323692] [2024-10-12 21:48:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907323692] [2024-10-12 21:48:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907323692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272881214] [2024-10-12 21:48:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:42,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:42,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:42,637 INFO L87 Difference]: Start difference. First operand 22748 states and 37508 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:48,707 INFO L93 Difference]: Finished difference Result 82873 states and 138648 transitions. [2024-10-12 21:48:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:48:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:48,941 INFO L225 Difference]: With dead ends: 82873 [2024-10-12 21:48:48,941 INFO L226 Difference]: Without dead ends: 60145 [2024-10-12 21:48:49,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:49,014 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1624 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:49,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2186 Invalid, 4007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3938 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60145 states. [2024-10-12 21:48:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60145 to 45221. [2024-10-12 21:48:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45221 states, 41473 states have (on average 1.6219950329129795) internal successors, (67269), 41603 states have internal predecessors, (67269), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-10-12 21:48:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45221 states to 45221 states and 75272 transitions. [2024-10-12 21:48:51,819 INFO L78 Accepts]: Start accepts. Automaton has 45221 states and 75272 transitions. Word has length 172 [2024-10-12 21:48:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:51,820 INFO L471 AbstractCegarLoop]: Abstraction has 45221 states and 75272 transitions. [2024-10-12 21:48:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:48:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 45221 states and 75272 transitions. [2024-10-12 21:48:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:48:51,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:51,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:48:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:48:51,873 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1312652098, now seen corresponding path program 1 times [2024-10-12 21:48:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3233714] [2024-10-12 21:48:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:48:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:48:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:48:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:48:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3233714] [2024-10-12 21:48:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3233714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613423877] [2024-10-12 21:48:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:52,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:52,061 INFO L87 Difference]: Start difference. First operand 45221 states and 75272 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:49:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:49:01,837 INFO L93 Difference]: Finished difference Result 164688 states and 278222 transitions. [2024-10-12 21:49:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:49:01,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:49:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:49:02,411 INFO L225 Difference]: With dead ends: 164688 [2024-10-12 21:49:02,412 INFO L226 Difference]: Without dead ends: 119487 [2024-10-12 21:49:02,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:49:02,519 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1623 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:49:02,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 2186 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:49:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119487 states. [2024-10-12 21:49:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119487 to 90294. [2024-10-12 21:49:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90294 states, 82834 states have (on average 1.6214477147065214) internal successors, (134311), 83092 states have internal predecessors, (134311), 5661 states have call successors, (5661), 1543 states have call predecessors, (5661), 1798 states have return successors, (12476), 5914 states have call predecessors, (12476), 5659 states have call successors, (12476) [2024-10-12 21:49:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90294 states to 90294 states and 152448 transitions. [2024-10-12 21:49:09,653 INFO L78 Accepts]: Start accepts. Automaton has 90294 states and 152448 transitions. Word has length 172 [2024-10-12 21:49:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:49:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 90294 states and 152448 transitions. [2024-10-12 21:49:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:49:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 90294 states and 152448 transitions. [2024-10-12 21:49:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:49:09,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:49:09,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:49:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:49:09,724 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:49:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:49:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1156671556, now seen corresponding path program 1 times [2024-10-12 21:49:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:49:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496560689] [2024-10-12 21:49:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:49:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:49:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:49:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:49:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:49:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:49:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:49:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:49:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:49:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:49:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496560689] [2024-10-12 21:49:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496560689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:49:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:49:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:49:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821258686] [2024-10-12 21:49:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:49:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:49:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:49:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:49:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:49:09,920 INFO L87 Difference]: Start difference. First operand 90294 states and 152448 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)