./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.14.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.14.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 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:47:44,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:47:45,045 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,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:47:45,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:47:45,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:47:45,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:47:45,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:47:45,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:47:45,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:47:45,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:47:45,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:47:45,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:47:45,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:47:45,066 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:47:45,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:47:45,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:47:45,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:47:45,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:47:45,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:47:45,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:47:45,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:47:45,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:47:45,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:47:45,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:47:45,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:47:45,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:47:45,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:47:45,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:47:45,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:47:45,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:47:45,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:47:45,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:45,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:47:45,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:47:45,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:47:45,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:47:45,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:47:45,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:47:45,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:47:45,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:47:45,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:47:45,074 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 -> 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 [2024-10-12 21:47:45,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:47:45,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:47:45,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:47:45,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:47:45,449 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:47:45,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-10-12 21:47:47,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:47:47,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:47:47,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-10-12 21:47:47,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130f37fcc/f6d8dbddee8a49cc87c720513a99ece1/FLAG9a5317d10 [2024-10-12 21:47:47,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130f37fcc/f6d8dbddee8a49cc87c720513a99ece1 [2024-10-12 21:47:47,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:47:47,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:47:47,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:47,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:47:47,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:47:47,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:47" (1/1) ... [2024-10-12 21:47:47,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc69491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:47, skipping insertion in model container [2024-10-12 21:47:47,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:47" (1/1) ... [2024-10-12 21:47:47,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:47:48,003 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.14.cil.c[911,924] [2024-10-12 21:47:48,122 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.14.cil.c[8416,8429] [2024-10-12 21:47:48,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:48,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:47:48,388 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.14.cil.c[911,924] [2024-10-12 21:47:48,427 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.14.cil.c[8416,8429] [2024-10-12 21:47:48,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:48,615 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:47:48,616 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,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:48,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:48,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:47:48,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:47:48,632 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,658 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,718 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1110 [2024-10-12 21:47:48,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:48,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:47:48,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:47:48,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:47:48,739 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,743 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,747 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,782 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,782 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,782 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,798 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,813 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,819 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,827 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:48,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:47:48,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:47:48,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:47:48,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:47:48,842 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:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:48,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:48,884 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:48,893 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:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:47:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:47:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:47:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:47:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:47:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:47:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:47:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:47:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:47:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:47:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:47:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:47:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:47:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:47:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:47:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:47:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:47:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:47:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:47:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:47:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:47:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:47:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:47:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:47:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:47:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:47:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:47:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:47:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:47:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:47:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:47:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:47:49,092 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:47:49,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:47:49,916 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:47:49,916 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,116 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-10-12 21:47:50,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:47:50,173 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:47:50,173 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-12 21:47:50,174 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,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:47:50,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:47:50,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:47:50,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:47:50,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:47:47" (1/3) ... [2024-10-12 21:47:50,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8fc0c 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,179 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,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8fc0c 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,180 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,181 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.14.cil.c [2024-10-12 21:47:50,194 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:47:50,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:47:50,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:47:50,257 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;@2be47f3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:47:50,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:47:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 458 states, 396 states have (on average 1.7171717171717171) internal successors, (680), 404 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-12 21:47:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:50,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:50,276 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,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:50,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash -396566493, now seen corresponding path program 1 times [2024-10-12 21:47:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532084172] [2024-10-12 21:47:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,605 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,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532084172] [2024-10-12 21:47:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532084172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:47:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350256495] [2024-10-12 21:47:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:50,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:47:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:47:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:47:50,631 INFO L87 Difference]: Start difference. First operand has 458 states, 396 states have (on average 1.7171717171717171) internal successors, (680), 404 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:51,598 INFO L93 Difference]: Finished difference Result 908 states and 1519 transitions. [2024-10-12 21:47:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:47:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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 57 [2024-10-12 21:47:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:51,617 INFO L225 Difference]: With dead ends: 908 [2024-10-12 21:47:51,617 INFO L226 Difference]: Without dead ends: 469 [2024-10-12 21:47:51,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:51,632 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1047 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:51,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1205 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:47:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-12 21:47:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 452. [2024-10-12 21:47:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 393 states have (on average 1.61323155216285) internal successors, (634), 398 states have internal predecessors, (634), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 21:47:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 718 transitions. [2024-10-12 21:47:51,730 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 718 transitions. Word has length 57 [2024-10-12 21:47:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:51,731 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 718 transitions. [2024-10-12 21:47:51,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 718 transitions. [2024-10-12 21:47:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:51,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:51,734 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:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:47:51,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:51,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash -381047775, now seen corresponding path program 1 times [2024-10-12 21:47:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351968217] [2024-10-12 21:47:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,970 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:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351968217] [2024-10-12 21:47:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351968217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048636346] [2024-10-12 21:47:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:51,981 INFO L87 Difference]: Start difference. First operand 452 states and 718 transitions. 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:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:54,229 INFO L93 Difference]: Finished difference Result 684 states and 1064 transitions. [2024-10-12 21:47:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:47:54,230 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:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:54,241 INFO L225 Difference]: With dead ends: 684 [2024-10-12 21:47:54,241 INFO L226 Difference]: Without dead ends: 590 [2024-10-12 21:47:54,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:54,242 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1556 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 1553 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:47:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-10-12 21:47:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 553. [2024-10-12 21:47:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 472 states have (on average 1.5868644067796611) internal successors, (749), 479 states have internal predecessors, (749), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-12 21:47:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 864 transitions. [2024-10-12 21:47:54,324 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 864 transitions. Word has length 57 [2024-10-12 21:47:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:54,325 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 864 transitions. [2024-10-12 21:47:54,325 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:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 864 transitions. [2024-10-12 21:47:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:54,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:54,327 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:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:47:54,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1969926753, now seen corresponding path program 1 times [2024-10-12 21:47:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701091415] [2024-10-12 21:47:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,559 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:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701091415] [2024-10-12 21:47:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701091415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634027252] [2024-10-12 21:47:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:54,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:54,561 INFO L87 Difference]: Start difference. First operand 553 states and 864 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:56,982 INFO L93 Difference]: Finished difference Result 914 states and 1393 transitions. [2024-10-12 21:47:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:47:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:47:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:56,992 INFO L225 Difference]: With dead ends: 914 [2024-10-12 21:47:56,992 INFO L226 Difference]: Without dead ends: 726 [2024-10-12 21:47:56,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:47:56,993 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1387 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:56,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 2142 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:47:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-12 21:47:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 654. [2024-10-12 21:47:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 551 states have (on average 1.5662431941923776) internal successors, (863), 560 states have internal predecessors, (863), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2024-10-12 21:47:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1012 transitions. [2024-10-12 21:47:57,059 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1012 transitions. Word has length 57 [2024-10-12 21:47:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1012 transitions. [2024-10-12 21:47:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1012 transitions. [2024-10-12 21:47:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:57,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:57,064 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:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:47:57,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:57,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1431554205, now seen corresponding path program 1 times [2024-10-12 21:47:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134173274] [2024-10-12 21:47:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:57,210 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 1 [2024-10-12 21:47:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:57,229 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 35 [2024-10-12 21:47:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:57,235 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,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134173274] [2024-10-12 21:47:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134173274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548173481] [2024-10-12 21:47:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:57,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:57,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:57,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:57,237 INFO L87 Difference]: Start difference. First operand 654 states and 1012 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:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:59,393 INFO L93 Difference]: Finished difference Result 2052 states and 3061 transitions. [2024-10-12 21:47:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:59,393 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:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:59,402 INFO L225 Difference]: With dead ends: 2052 [2024-10-12 21:47:59,402 INFO L226 Difference]: Without dead ends: 1751 [2024-10-12 21:47:59,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:59,406 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 3655 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3673 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:59,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3673 Valid, 2391 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:47:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2024-10-12 21:47:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1618. [2024-10-12 21:47:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1310 states have (on average 1.465648854961832) internal successors, (1920), 1334 states have internal predecessors, (1920), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2024-10-12 21:47:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2312 transitions. [2024-10-12 21:47:59,520 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2312 transitions. Word has length 57 [2024-10-12 21:47:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2312 transitions. [2024-10-12 21:47:59,522 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:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2312 transitions. [2024-10-12 21:47:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:59,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:59,523 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:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:47:59,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:59,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1917518946, now seen corresponding path program 1 times [2024-10-12 21:47:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595805533] [2024-10-12 21:47:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595805533] [2024-10-12 21:47:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595805533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119380919] [2024-10-12 21:47:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:59,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:59,769 INFO L87 Difference]: Start difference. First operand 1618 states and 2312 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:48:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:01,357 INFO L93 Difference]: Finished difference Result 2999 states and 4236 transitions. [2024-10-12 21:48:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:48:01,358 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:48:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:01,367 INFO L225 Difference]: With dead ends: 2999 [2024-10-12 21:48:01,367 INFO L226 Difference]: Without dead ends: 1740 [2024-10-12 21:48:01,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:48:01,371 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 938 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:01,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2253 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:48:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2024-10-12 21:48:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1650. [2024-10-12 21:48:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1334 states have (on average 1.4527736131934033) internal successors, (1938), 1358 states have internal predecessors, (1938), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2024-10-12 21:48:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2338 transitions. [2024-10-12 21:48:01,476 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2338 transitions. Word has length 58 [2024-10-12 21:48:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:01,476 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2338 transitions. [2024-10-12 21:48:01,477 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:48:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2338 transitions. [2024-10-12 21:48:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:48:01,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:01,478 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:48:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:48:01,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1989905504, now seen corresponding path program 1 times [2024-10-12 21:48:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128054709] [2024-10-12 21:48:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:48:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:48:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128054709] [2024-10-12 21:48:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128054709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:48:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346648536] [2024-10-12 21:48:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:01,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:48:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:01,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:48:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:48:01,640 INFO L87 Difference]: Start difference. First operand 1650 states and 2338 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:48:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:03,672 INFO L93 Difference]: Finished difference Result 4909 states and 6899 transitions. [2024-10-12 21:48:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:48:03,673 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:48:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:03,682 INFO L225 Difference]: With dead ends: 4909 [2024-10-12 21:48:03,682 INFO L226 Difference]: Without dead ends: 2020 [2024-10-12 21:48:03,687 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:48:03,688 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 4200 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:03,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 2092 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:48:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2024-10-12 21:48:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1864. [2024-10-12 21:48:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1476 states have (on average 1.4004065040650406) internal successors, (2067), 1502 states have internal predecessors, (2067), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2024-10-12 21:48:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2553 transitions. [2024-10-12 21:48:03,806 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2553 transitions. Word has length 58 [2024-10-12 21:48:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:03,806 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2553 transitions. [2024-10-12 21:48:03,806 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:48:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2553 transitions. [2024-10-12 21:48:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:03,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:03,808 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,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:48:03,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash -638490220, now seen corresponding path program 1 times [2024-10-12 21:48:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066897963] [2024-10-12 21:48:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,906 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,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066897963] [2024-10-12 21:48:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066897963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:48:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085230335] [2024-10-12 21:48:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:48:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:48:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:48:03,908 INFO L87 Difference]: Start difference. First operand 1864 states and 2553 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:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:05,153 INFO L93 Difference]: Finished difference Result 3533 states and 4791 transitions. [2024-10-12 21:48:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:48:05,154 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:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:05,162 INFO L225 Difference]: With dead ends: 3533 [2024-10-12 21:48:05,162 INFO L226 Difference]: Without dead ends: 2028 [2024-10-12 21:48:05,165 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:05,166 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 929 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:05,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 2222 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:48:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2024-10-12 21:48:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1912. [2024-10-12 21:48:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1512 states have (on average 1.3869047619047619) internal successors, (2097), 1538 states have internal predecessors, (2097), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2024-10-12 21:48:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2595 transitions. [2024-10-12 21:48:05,284 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2595 transitions. Word has length 80 [2024-10-12 21:48:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2595 transitions. [2024-10-12 21:48:05,284 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:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2595 transitions. [2024-10-12 21:48:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:05,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:05,286 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:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:48:05,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1289782482, now seen corresponding path program 1 times [2024-10-12 21:48:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797493686] [2024-10-12 21:48:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:05,431 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:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797493686] [2024-10-12 21:48:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797493686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:48:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516766908] [2024-10-12 21:48:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:05,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:48:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:48:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:05,433 INFO L87 Difference]: Start difference. First operand 1912 states and 2595 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:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:06,833 INFO L93 Difference]: Finished difference Result 3311 states and 4431 transitions. [2024-10-12 21:48:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:48:06,834 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:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:06,851 INFO L225 Difference]: With dead ends: 3311 [2024-10-12 21:48:06,854 INFO L226 Difference]: Without dead ends: 1979 [2024-10-12 21:48:06,857 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:06,862 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1735 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:06,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1602 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:48:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2024-10-12 21:48:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1704. [2024-10-12 21:48:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1357 states have (on average 1.3942520265291083) internal successors, (1892), 1378 states have internal predecessors, (1892), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2024-10-12 21:48:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2322 transitions. [2024-10-12 21:48:07,022 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2322 transitions. Word has length 80 [2024-10-12 21:48:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:07,022 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2322 transitions. [2024-10-12 21:48:07,023 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:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2322 transitions. [2024-10-12 21:48:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:48:07,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:07,027 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:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:48:07,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:07,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1713429204, now seen corresponding path program 1 times [2024-10-12 21:48:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:07,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360736169] [2024-10-12 21:48:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:48:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:07,119 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:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360736169] [2024-10-12 21:48:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360736169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159940258] [2024-10-12 21:48:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:07,121 INFO L87 Difference]: Start difference. First operand 1704 states and 2322 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:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:07,799 INFO L93 Difference]: Finished difference Result 3153 states and 4251 transitions. [2024-10-12 21:48:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:48:07,800 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:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:07,813 INFO L225 Difference]: With dead ends: 3153 [2024-10-12 21:48:07,813 INFO L226 Difference]: Without dead ends: 1809 [2024-10-12 21:48:07,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:48:07,818 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1569 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:07,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 1172 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:48:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-12 21:48:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1704. [2024-10-12 21:48:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1357 states have (on average 1.367722918201916) internal successors, (1856), 1378 states have internal predecessors, (1856), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2024-10-12 21:48:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2286 transitions. [2024-10-12 21:48:07,937 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2286 transitions. Word has length 80 [2024-10-12 21:48:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:07,938 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2286 transitions. [2024-10-12 21:48:07,939 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:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2286 transitions. [2024-10-12 21:48:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:48:07,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:07,941 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:07,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:48:07,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1809860207, now seen corresponding path program 1 times [2024-10-12 21:48:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473718790] [2024-10-12 21:48:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:08,087 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:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473718790] [2024-10-12 21:48:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473718790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:48:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986645784] [2024-10-12 21:48:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:48:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:48:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:48:08,089 INFO L87 Difference]: Start difference. First operand 1704 states and 2286 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:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:09,683 INFO L93 Difference]: Finished difference Result 3925 states and 5172 transitions. [2024-10-12 21:48:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 21:48:09,683 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:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:09,692 INFO L225 Difference]: With dead ends: 3925 [2024-10-12 21:48:09,692 INFO L226 Difference]: Without dead ends: 2440 [2024-10-12 21:48:09,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-12 21:48:09,694 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1972 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:09,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 2270 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:48:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2024-10-12 21:48:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2276. [2024-10-12 21:48:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 1775 states have (on average 1.3233802816901408) internal successors, (2349), 1804 states have internal predecessors, (2349), 269 states have call successors, (269), 169 states have call predecessors, (269), 230 states have return successors, (369), 304 states have call predecessors, (369), 265 states have call successors, (369) [2024-10-12 21:48:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 2987 transitions. [2024-10-12 21:48:09,813 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 2987 transitions. Word has length 81 [2024-10-12 21:48:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:09,814 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 2987 transitions. [2024-10-12 21:48:09,814 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:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2987 transitions. [2024-10-12 21:48:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 21:48:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:09,815 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:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:48:09,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1131838132, now seen corresponding path program 1 times [2024-10-12 21:48:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805145970] [2024-10-12 21:48:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 21:48:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:48:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 21:48:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 21:48:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:09,975 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:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805145970] [2024-10-12 21:48:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805145970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415933149] [2024-10-12 21:48:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:09,981 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:09,988 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:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:10,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:10,304 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:10,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415933149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601317868] [2024-10-12 21:48:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:10,307 INFO L87 Difference]: Start difference. First operand 2276 states and 2987 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:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:10,670 INFO L93 Difference]: Finished difference Result 5872 states and 7486 transitions. [2024-10-12 21:48:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:10,670 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:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:10,687 INFO L225 Difference]: With dead ends: 5872 [2024-10-12 21:48:10,687 INFO L226 Difference]: Without dead ends: 4026 [2024-10-12 21:48:10,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 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,691 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 57 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1327 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:10,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1327 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:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2024-10-12 21:48:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3986. [2024-10-12 21:48:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3072 states have (on average 1.2835286458333333) internal successors, (3943), 3124 states have internal predecessors, (3943), 476 states have call successors, (476), 330 states have call predecessors, (476), 436 states have return successors, (637), 533 states have call predecessors, (637), 472 states have call successors, (637) [2024-10-12 21:48:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5056 transitions. [2024-10-12 21:48:10,943 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5056 transitions. Word has length 145 [2024-10-12 21:48:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 5056 transitions. [2024-10-12 21:48:10,945 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:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5056 transitions. [2024-10-12 21:48:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:48:10,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:10,948 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:10,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:48:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 21:48:11,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash 776960780, now seen corresponding path program 1 times [2024-10-12 21:48:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:11,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661884274] [2024-10-12 21:48:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:48:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:48:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:48:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:48:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:48:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:48:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,429 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:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661884274] [2024-10-12 21:48:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661884274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949584901] [2024-10-12 21:48:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:11,431 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:11,433 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:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:11,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:11,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:11,727 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:11,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949584901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:11,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:11,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534490418] [2024-10-12 21:48:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:11,731 INFO L87 Difference]: Start difference. First operand 3986 states and 5056 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:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:12,554 INFO L93 Difference]: Finished difference Result 11238 states and 13996 transitions. [2024-10-12 21:48:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:12,554 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:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:12,586 INFO L225 Difference]: With dead ends: 11238 [2024-10-12 21:48:12,586 INFO L226 Difference]: Without dead ends: 7612 [2024-10-12 21:48:12,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 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:12,595 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 48 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:12,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1296 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:48:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7612 states. [2024-10-12 21:48:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7612 to 7604. [2024-10-12 21:48:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7604 states, 5818 states have (on average 1.2567892746648333) internal successors, (7312), 5917 states have internal predecessors, (7312), 918 states have call successors, (918), 652 states have call predecessors, (918), 866 states have return successors, (1244), 1036 states have call predecessors, (1244), 914 states have call successors, (1244) [2024-10-12 21:48:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7604 states to 7604 states and 9474 transitions. [2024-10-12 21:48:13,273 INFO L78 Accepts]: Start accepts. Automaton has 7604 states and 9474 transitions. Word has length 175 [2024-10-12 21:48:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:13,274 INFO L471 AbstractCegarLoop]: Abstraction has 7604 states and 9474 transitions. [2024-10-12 21:48:13,274 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:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7604 states and 9474 transitions. [2024-10-12 21:48:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:48:13,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:13,277 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:13,294 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:13,477 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,SelfDestructingSolverStorable11 [2024-10-12 21:48:13,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 382593994, now seen corresponding path program 1 times [2024-10-12 21:48:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503559785] [2024-10-12 21:48:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:48:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:48:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:48:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:48:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:48:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:48:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:48:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:48:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:48:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:48:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:48:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:48:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:48:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:48:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:48:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:48:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,635 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:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503559785] [2024-10-12 21:48:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503559785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:48:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669623239] [2024-10-12 21:48:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:13,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:48:13,637 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:13,638 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:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:13,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:48:13,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:48:13,919 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:13,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:48:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669623239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:48:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:48:13,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674558282] [2024-10-12 21:48:13,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:13,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:48:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:48:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:13,923 INFO L87 Difference]: Start difference. First operand 7604 states and 9474 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:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:14,487 INFO L93 Difference]: Finished difference Result 13590 states and 17146 transitions. [2024-10-12 21:48:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:48:14,491 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:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:14,500 INFO L225 Difference]: With dead ends: 13590 [2024-10-12 21:48:14,500 INFO L226 Difference]: Without dead ends: 352 [2024-10-12 21:48:14,517 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:14,517 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 596 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:14,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 641 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:48:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-12 21:48:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-12 21:48:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 317 states have (on average 1.637223974763407) internal successors, (519), 319 states have internal predecessors, (519), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:48:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 573 transitions. [2024-10-12 21:48:14,535 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 573 transitions. Word has length 175 [2024-10-12 21:48:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:14,536 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 573 transitions. [2024-10-12 21:48:14,536 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:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 573 transitions. [2024-10-12 21:48:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:14,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:14,537 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] [2024-10-12 21:48:14,554 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:14,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:48:14,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 971192510, now seen corresponding path program 1 times [2024-10-12 21:48:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350998437] [2024-10-12 21:48:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,899 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,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:14,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350998437] [2024-10-12 21:48:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350998437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:14,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:48:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507665720] [2024-10-12 21:48:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:48:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:48:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:48:14,901 INFO L87 Difference]: Start difference. First operand 352 states and 573 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:16,413 INFO L93 Difference]: Finished difference Result 829 states and 1372 transitions. [2024-10-12 21:48:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:16,418 INFO L225 Difference]: With dead ends: 829 [2024-10-12 21:48:16,418 INFO L226 Difference]: Without dead ends: 482 [2024-10-12 21:48:16,419 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:16,419 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 987 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:16,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 639 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:48:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-12 21:48:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 352. [2024-10-12 21:48:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 317 states have (on average 1.6340694006309149) internal successors, (518), 319 states have internal predecessors, (518), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:48:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 572 transitions. [2024-10-12 21:48:16,446 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 572 transitions. Word has length 162 [2024-10-12 21:48:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:16,447 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 572 transitions. [2024-10-12 21:48:16,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 572 transitions. [2024-10-12 21:48:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:16,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:16,449 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] [2024-10-12 21:48:16,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:48:16,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -9762304, now seen corresponding path program 1 times [2024-10-12 21:48:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652996844] [2024-10-12 21:48:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:48:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652996844] [2024-10-12 21:48:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652996844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:48:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399211440] [2024-10-12 21:48:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:16,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:48:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:48:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:48:16,651 INFO L87 Difference]: Start difference. First operand 352 states and 572 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:18,391 INFO L93 Difference]: Finished difference Result 821 states and 1355 transitions. [2024-10-12 21:48:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:18,396 INFO L225 Difference]: With dead ends: 821 [2024-10-12 21:48:18,396 INFO L226 Difference]: Without dead ends: 482 [2024-10-12 21:48:18,397 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:18,398 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 978 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:18,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 637 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:48:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-12 21:48:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 352. [2024-10-12 21:48:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 317 states have (on average 1.6309148264984228) internal successors, (517), 319 states have internal predecessors, (517), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:48:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 571 transitions. [2024-10-12 21:48:18,426 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 571 transitions. Word has length 162 [2024-10-12 21:48:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:18,427 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 571 transitions. [2024-10-12 21:48:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 571 transitions. [2024-10-12 21:48:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:18,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:18,429 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] [2024-10-12 21:48:18,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:48:18,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 254885186, now seen corresponding path program 1 times [2024-10-12 21:48:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240438680] [2024-10-12 21:48:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,662 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:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240438680] [2024-10-12 21:48:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240438680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:48:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444219113] [2024-10-12 21:48:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:18,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:48:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:48:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:48:18,665 INFO L87 Difference]: Start difference. First operand 352 states and 571 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:21,387 INFO L93 Difference]: Finished difference Result 1297 states and 2153 transitions. [2024-10-12 21:48:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:48:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:21,392 INFO L225 Difference]: With dead ends: 1297 [2024-10-12 21:48:21,392 INFO L226 Difference]: Without dead ends: 964 [2024-10-12 21:48:21,393 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:21,394 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1494 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:21,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1077 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:48:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-10-12 21:48:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 703. [2024-10-12 21:48:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 640 states have (on average 1.6421875) internal successors, (1051), 643 states have internal predecessors, (1051), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-12 21:48:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1150 transitions. [2024-10-12 21:48:21,435 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1150 transitions. Word has length 162 [2024-10-12 21:48:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:21,435 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1150 transitions. [2024-10-12 21:48:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1150 transitions. [2024-10-12 21:48:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:21,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:21,437 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] [2024-10-12 21:48:21,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:48:21,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:21,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1950483198, now seen corresponding path program 1 times [2024-10-12 21:48:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329879235] [2024-10-12 21:48:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:21,646 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:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329879235] [2024-10-12 21:48:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329879235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168856661] [2024-10-12 21:48:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:21,648 INFO L87 Difference]: Start difference. First operand 703 states and 1150 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:25,207 INFO L93 Difference]: Finished difference Result 2150 states and 3577 transitions. [2024-10-12 21:48:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:25,218 INFO L225 Difference]: With dead ends: 2150 [2024-10-12 21:48:25,218 INFO L226 Difference]: Without dead ends: 1466 [2024-10-12 21:48:25,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:25,221 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1640 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 3246 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:25,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1422 Invalid, 3348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3246 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:48:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-10-12 21:48:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1028. [2024-10-12 21:48:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 937 states have (on average 1.6360725720384204) internal successors, (1533), 941 states have internal predecessors, (1533), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-12 21:48:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1676 transitions. [2024-10-12 21:48:25,276 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1676 transitions. Word has length 162 [2024-10-12 21:48:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:25,276 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1676 transitions. [2024-10-12 21:48:25,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1676 transitions. [2024-10-12 21:48:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:25,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:25,278 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] [2024-10-12 21:48:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:48:25,279 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 556614276, now seen corresponding path program 1 times [2024-10-12 21:48:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726130814] [2024-10-12 21:48:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:25,537 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:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726130814] [2024-10-12 21:48:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726130814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175663806] [2024-10-12 21:48:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:25,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:25,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:25,539 INFO L87 Difference]: Start difference. First operand 1028 states and 1676 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:29,204 INFO L93 Difference]: Finished difference Result 3398 states and 5643 transitions. [2024-10-12 21:48:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:29,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:29,212 INFO L225 Difference]: With dead ends: 3398 [2024-10-12 21:48:29,213 INFO L226 Difference]: Without dead ends: 2389 [2024-10-12 21:48:29,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:29,215 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1535 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:29,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 2051 Invalid, 3780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 21:48:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2024-10-12 21:48:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1681. [2024-10-12 21:48:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1534 states have (on average 1.6310299869621903) internal successors, (2502), 1540 states have internal predecessors, (2502), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 21:48:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2737 transitions. [2024-10-12 21:48:29,294 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2737 transitions. Word has length 162 [2024-10-12 21:48:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2737 transitions. [2024-10-12 21:48:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2737 transitions. [2024-10-12 21:48:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:29,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:29,296 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] [2024-10-12 21:48:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:48:29,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:29,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1579268926, now seen corresponding path program 1 times [2024-10-12 21:48:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440653629] [2024-10-12 21:48:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:29,500 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:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:29,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440653629] [2024-10-12 21:48:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440653629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060554299] [2024-10-12 21:48:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:29,502 INFO L87 Difference]: Start difference. First operand 1681 states and 2737 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:33,334 INFO L93 Difference]: Finished difference Result 5797 states and 9596 transitions. [2024-10-12 21:48:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:33,370 INFO L225 Difference]: With dead ends: 5797 [2024-10-12 21:48:33,371 INFO L226 Difference]: Without dead ends: 4135 [2024-10-12 21:48:33,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:33,381 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1530 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3700 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:33,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 2051 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3700 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 21:48:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2024-10-12 21:48:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 2990. [2024-10-12 21:48:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2731 states have (on average 1.6272427682167705) internal successors, (4444), 2741 states have internal predecessors, (4444), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 21:48:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4869 transitions. [2024-10-12 21:48:33,638 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4869 transitions. Word has length 162 [2024-10-12 21:48:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:33,638 INFO L471 AbstractCegarLoop]: Abstraction has 2990 states and 4869 transitions. [2024-10-12 21:48:33,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4869 transitions. [2024-10-12 21:48:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:33,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:33,641 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] [2024-10-12 21:48:33,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:48:33,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1509621052, now seen corresponding path program 1 times [2024-10-12 21:48:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:33,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226761257] [2024-10-12 21:48:33,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:33,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:33,911 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:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226761257] [2024-10-12 21:48:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226761257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:33,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:33,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529954524] [2024-10-12 21:48:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:33,913 INFO L87 Difference]: Start difference. First operand 2990 states and 4869 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:37,850 INFO L93 Difference]: Finished difference Result 10596 states and 17522 transitions. [2024-10-12 21:48:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:37,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:37,874 INFO L225 Difference]: With dead ends: 10596 [2024-10-12 21:48:37,874 INFO L226 Difference]: Without dead ends: 7625 [2024-10-12 21:48:37,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:37,884 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1529 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:37,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 2051 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:48:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7625 states. [2024-10-12 21:48:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7625 to 5615. [2024-10-12 21:48:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5132 states have (on average 1.6247077162899455) internal successors, (8338), 5150 states have internal predecessors, (8338), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-12 21:48:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 9161 transitions. [2024-10-12 21:48:38,313 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 9161 transitions. Word has length 162 [2024-10-12 21:48:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:38,314 INFO L471 AbstractCegarLoop]: Abstraction has 5615 states and 9161 transitions. [2024-10-12 21:48:38,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 9161 transitions. [2024-10-12 21:48:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:38,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:38,318 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] [2024-10-12 21:48:38,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:48:38,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:38,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1091732350, now seen corresponding path program 1 times [2024-10-12 21:48:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:38,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433646167] [2024-10-12 21:48:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:38,519 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:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433646167] [2024-10-12 21:48:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433646167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7398978] [2024-10-12 21:48:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:38,521 INFO L87 Difference]: Start difference. First operand 5615 states and 9161 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:42,400 INFO L93 Difference]: Finished difference Result 20195 states and 33436 transitions. [2024-10-12 21:48:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:42,448 INFO L225 Difference]: With dead ends: 20195 [2024-10-12 21:48:42,449 INFO L226 Difference]: Without dead ends: 14599 [2024-10-12 21:48:42,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:42,468 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1528 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:42,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 2051 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2024-10-12 21:48:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 10880. [2024-10-12 21:48:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10880 states, 9949 states have (on average 1.6230776962508795) internal successors, (16148), 9983 states have internal predecessors, (16148), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-12 21:48:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10880 states to 10880 states and 17821 transitions. [2024-10-12 21:48:43,106 INFO L78 Accepts]: Start accepts. Automaton has 10880 states and 17821 transitions. Word has length 162 [2024-10-12 21:48:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:43,108 INFO L471 AbstractCegarLoop]: Abstraction has 10880 states and 17821 transitions. [2024-10-12 21:48:43,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10880 states and 17821 transitions. [2024-10-12 21:48:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:43,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:43,116 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] [2024-10-12 21:48:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:48:43,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 307221252, now seen corresponding path program 1 times [2024-10-12 21:48:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662746278] [2024-10-12 21:48:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:43,321 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:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662746278] [2024-10-12 21:48:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662746278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242564799] [2024-10-12 21:48:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:43,325 INFO L87 Difference]: Start difference. First operand 10880 states and 17821 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:47,813 INFO L93 Difference]: Finished difference Result 39394 states and 65458 transitions. [2024-10-12 21:48:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:47,985 INFO L225 Difference]: With dead ends: 39394 [2024-10-12 21:48:47,985 INFO L226 Difference]: Without dead ends: 28533 [2024-10-12 21:48:48,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:48,019 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1527 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:48,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2051 Invalid, 3729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:48:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28533 states. [2024-10-12 21:48:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28533 to 21441. [2024-10-12 21:48:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21441 states, 19614 states have (on average 1.6220046905271746) internal successors, (31814), 19680 states have internal predecessors, (31814), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 21:48:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21441 states to 21441 states and 35349 transitions. [2024-10-12 21:48:49,374 INFO L78 Accepts]: Start accepts. Automaton has 21441 states and 35349 transitions. Word has length 162 [2024-10-12 21:48:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 21441 states and 35349 transitions. [2024-10-12 21:48:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21441 states and 35349 transitions. [2024-10-12 21:48:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:49,388 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] [2024-10-12 21:48:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:48:49,388 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1310219198, now seen corresponding path program 1 times [2024-10-12 21:48:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:49,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374705725] [2024-10-12 21:48:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:49,570 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:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374705725] [2024-10-12 21:48:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374705725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178288308] [2024-10-12 21:48:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:49,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:49,572 INFO L87 Difference]: Start difference. First operand 21441 states and 35349 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:55,546 INFO L93 Difference]: Finished difference Result 77793 states and 130104 transitions. [2024-10-12 21:48:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:55,781 INFO L225 Difference]: With dead ends: 77793 [2024-10-12 21:48:55,781 INFO L226 Difference]: Without dead ends: 56371 [2024-10-12 21:48:55,849 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:55,850 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1532 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 3711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:55,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 2051 Invalid, 3711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:48:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56371 states. [2024-10-12 21:48:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56371 to 42626. [2024-10-12 21:48:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42626 states, 39007 states have (on average 1.621247468403107) internal successors, (63240), 39137 states have internal predecessors, (63240), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-10-12 21:48:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42626 states to 42626 states and 70985 transitions. [2024-10-12 21:48:58,882 INFO L78 Accepts]: Start accepts. Automaton has 42626 states and 70985 transitions. Word has length 162 [2024-10-12 21:48:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:58,882 INFO L471 AbstractCegarLoop]: Abstraction has 42626 states and 70985 transitions. [2024-10-12 21:48:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 42626 states and 70985 transitions. [2024-10-12 21:48:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:58,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:58,913 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] [2024-10-12 21:48:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:48:58,913 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash -946752700, now seen corresponding path program 1 times [2024-10-12 21:48:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002824664] [2024-10-12 21:48:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:59,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:59,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:59,241 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:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002824664] [2024-10-12 21:48:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002824664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655955519] [2024-10-12 21:48:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:59,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:59,245 INFO L87 Difference]: Start difference. First operand 42626 states and 70985 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:49:08,270 INFO L93 Difference]: Finished difference Result 154462 states and 260986 transitions. [2024-10-12 21:49:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:49:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:49:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:49:08,680 INFO L225 Difference]: With dead ends: 154462 [2024-10-12 21:49:08,681 INFO L226 Difference]: Without dead ends: 111855 [2024-10-12 21:49:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:49:09,006 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 1618 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:49:09,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 1307 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2994 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:49:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111855 states.